ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Overlapping Schwarz methods on unstructured meshes using non-matching coarse grids (1996)
    Springer
    Numerische Mathematik 73 (1996), S. 149-167 
    Details
    ISSN: 0945-3245
    Keywords: Mathematics Subject Classification (1991):65N30, 65F10
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary. We consider two level overlapping Schwarz domain decomposition methods for solving the finite element problems that arise from discretizations of elliptic problems on general unstructured meshes in two and three dimensions. Standard finite element interpolation from the coarse to the fine grid may be used. Our theory requires no assumption on the substructures that constitute the whole domain, so the substructures can be of arbitrary shape and of different size. The global coarse mesh is allowed to be non-nested to the fine grid on which the discrete problem is to be solved, and neither the coarse mesh nor the fine mesh need be quasi-uniform. In addition, the domains defined by the fine and coarse grid need not be identical. The one important constraint is that the closure of the coarse grid must cover any portion of the fine grid boundary for which Neumann boundary conditions are given. In this general setting, our algorithms have the same optimal convergence rate as the usual two level overlapping domain decomposition methods on structured meshes. The condition number of the preconditioned system depends only on the (possibly small) overlap of the substructures and the size of the coarse grid, but is independent of the sizes of the subdomains.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/s002110050189
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    An analysis of the composite step biconjugate gradient method (1993)
    Springer
    Numerische Mathematik 66 (1993), S. 295-319 
    Details
    ISSN: 0945-3245
    Keywords: 65N20 ; 65F10
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary The composite step biconjugate gradient method (CSBCG) is a simple modification of the standard biconjugate gradient algorithm (BCG) which smooths the sometimes erratic convergence of BCG by computing only a subset of the iterates. We show that 2×2 composite steps can cure breakdowns in the biconjugate gradient method caused by (near) singularity of principal submatrices of the tridiagonal matrix generated by the underlying Lanczos process. We also prove a “best approximation” result for the method. Some numerical illustrations showing the effect of roundoff error are given.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01385699
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    4-Amido-2-carboxytetrahydroquinolines. Structure-activity relationships for antagonism at the glycine site of the NMDA receptor (1992)
    s.l. : American Chemical Society
    Journal of medicinal chemistry 35 (1992), S. 1954-1968 
    Details
    ISSN: 1520-4804
    Source: ACS Legacy Archives
    Topics: Chemistry and Pharmacology
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1021/jm00089a004
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    3-Nitro-3,4-dihydro-2(1H)-quinolones. Excitatory amino acid antagonists acting at glycine-site NMDA and (RS)-.alpha.-amino-3-hydroxy-5-methyl-4-isoxazolepropionic acid receptors (1993)
    s.l. : American Chemical Society
    Journal of medicinal chemistry 36 (1993), S. 3397-3408 
    Details
    ISSN: 1520-4804
    Source: ACS Legacy Archives
    Topics: Chemistry and Pharmacology
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1021/jm00074a021
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Solving quadratically constrained least squares using black box solvers (1992)
    Springer
    BIT 32 (1992), S. 481-494 
    Details
    ISSN: 1572-9125
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We present algorithms for solving quadratically constrained linear least squares problems that do not necessarily require expensive dense matrix factorizations. Instead, only “black box” solvers for certain related unconstrained least squares problems, as well as the solution of two related linear systems involving the coefficient matrixA and the constraint matrixB, are required. Special structures in the problem can thus be exploited in these solvers, and iterative as well as direct solvers can be used. Our approach is to solve for the Lagrange multiplier as the root of an implicitly-defined secular equation. We use both a linear and a rational (Hebden) local model and a Newton and secant method. We also derive a formula for estimating the Lagrange multiplier which depends on the amount the unconstrained solution violates the constraint and an estimate of the smallest generalized singular value ofA andB. The Lagrange multiplier estimate can be used as a good initial guess for solving the secular equation. We also show conditions under which this estimate is guaranteed to be an acceptable solution without further refinement. Numerical results comparing the different algorithms are presented.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02074882
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    A composite step conjugate gradients squared algorithm for solving nonsymmetric linear systems (1994)
    Springer
    Numerical algorithms 7 (1994), S. 17-32 
    Details
    ISSN: 1572-9265
    Keywords: Lanczos method ; conjugate gradients squared algorithm ; breakdowns ; composite step ; 65F10 ; 65F25
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We propose a new and more stable variant of the CGS method [27] for solving nonsymmetric linear systems. The method is based on squaring the Composite Step BCG method, introduced recently by Bank and Chan [1,2], which itself is a stabilized variant of BCG in that it skips over steps for which the BCG iterate is not defined and causes one kind of breakdown in BCG. By doing this, we obtain a method (Composite Step CGS or CSCGS) which not only handles the breakdowns described above, but does so with the advantages of CGS, namely, no multiplications by the transpose matrix and a faster convergence rate than BCG. Our strategy for deciding whether to skip a step does not involve any machine dependent parameters and is designed to skip near breakdowns as well as produce smoother iterates. Numerical experiments show that the new method does produce improved performance over CGS on practical problems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02141259
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    Erratum to “Additive Schwarz domain decomposition methods for elliptic problems on unstructured meshes” (1995)
    Springer
    Numerical algorithms 9 (1995), S. 397-397 
    Details
    ISSN: 1572-9265
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02141598
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    Circulant preconditioners for Toeplitz-block matrices (1994)
    Springer
    Numerical algorithms 6 (1994), S. 89-101 
    Details
    ISSN: 1572-9265
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We propose two block preconditioners for Toeplitz-block matrices (i.e. each block is Toeplitz), intended to be used in conjunction with conjugate gradient methods. These preconditioners employ and extend existing circulant preconditioners for point Toeplitz matrices. The two preconditioners differ in whether the point circulant approximation is used once or twice, and also in the cost per step. We discuss efficient implementation of these two preconditioners, as well as some basic theoretical properties (such as preservation of symmetry and positive definiteness). We report results of numerical experiments, including an example from active noise control, to compare their performance.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02149764
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    A composite step bi-conjugate gradient algorithm for nonsymmetric linear systems (1994)
    Springer
    Numerical algorithms 7 (1994), S. 1-16 
    Details
    ISSN: 1572-9265
    Keywords: Biconjugate gradients ; nonsymmetric linear systems ; 65N20 ; 65F10
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The Bi-Conjugate Gradient (BCG) algorithm is the simplest and most natural generalization of the classical conjugate gradient method for solving nonsymmetric linear systems. It is well-known that the method suffers from two kinds of breakdowns. The first is due to the breakdown of the underlying Lanczos process and the second is due to the fact that some iterates are not well-defined by the Galerkin condition on the associated Krylov subspaces. In this paper, we derive a simple modification of the BCG algorithm, the Composite Step BCG (CSBCG) algorithm, which is able to compute all the well-defined BCG iterates stably, assuming that the underlying Lanczos process does not break down. The main idea is to skip over a step for which the BCG iterate is not defined.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02141258
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 10
    Electronic Resource
    Electronic Resource
    Additive Schwarz domain decomposition methods for elliptic problems on unstructured meshes (1994)
    Springer
    Numerical algorithms 8 (1994), S. 329-346 
    Details
    ISSN: 1572-9265
    Keywords: Unstructured meshes ; non-nested coarse meshes ; additive Schwarz algorithm ; optimal convergence rate ; 65N30 ; 65F10
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We give several additive Schwarz domain decomposition methods for solving finite element problems which arise from the discretizations of elliptic problems on general unstructured meshes in two and three dimensions. Our theory requires no assumption (for the main results) on the substructures which constitute the whole domain, so each substructure can be of arbitrary shape and of different size. The global coarse mesh is allowed to be non-nested to the fine grid on which the discrete problem is to be solved and both the coarse meshes and the fine meshes need not be quasi-uniform. In this general setting, our algorithms have the same optimal convergence rate of the usual domain decomposition methods on structured meshes. The condition numbers of the preconditioned systems depend only on the (possibly small) overlap of the substructures and the size of the coares grid, but is independent of the sizes of the subdomains.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02142697
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...