On Multilevel Preconditioners which are Optimal with Respect to Both Problem and Discretization Parameters
| LEADER | caa a22 4500 | ||
|---|---|---|---|
| 001 | 378860127 | ||
| 003 | CHVBK | ||
| 005 | 20180305123344.0 | ||
| 007 | cr unu---uuuuu | ||
| 008 | 161128s2003 xx s 000 0 eng | ||
| 024 | 7 | 0 | |a 10.2478/cmam-2003-0002 |2 doi |
| 035 | |a (NATIONALLICENCE)gruyter-10.2478/cmam-2003-0002 | ||
| 245 | 0 | 0 | |a On Multilevel Preconditioners which are Optimal with Respect to Both Problem and Discretization Parameters |h [Elektronische Daten] |
| 520 | 3 | |a Preconditioners based on various multilevel extensions of two-level piecewise linear finite element methods lead to iterative methods which have an optimal order computational complexity with respect to the size (or discretization parameter) of the system. The methods can be in block matrix factorized form, recursively extended via certain matrix polynomial approximations of the arising Schur complement matrices or on additive, i.e., block diagonal form using stabilizations of the condition number at certain levels. The resulting spectral equivalence holds uniformly with respect to jumps in the coefficients of the differential operator and for arbitrary triangulations. Such methods were first presented by Axelsson and Vassilevski in the late 1980s. An important part of the algorithm is the treatment of systems with a diagonal block matrix, which arises on each finer level in a recursive refinement method and corresponds to the added degrees of freedom on that level. This block is well-conditioned for model type problems but becomes increasingly ill-conditioned when the coefficient matrix becomes more anisotropic or, equivalently, when the mesh aspect ratio increases. This paper presents some methods for approximating this matrix also leading to a preconditioner with spectral equivalence bounds which hold uniformly with respect to both the problem and the discretization parameters. Therefore, the same holds also for the preconditioner to the global matrix. | |
| 540 | |a This article is distributed under the terms of the Creative Commons Attribution Non-Commercial License, which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited. | ||
| 690 | 7 | |a multilevel preconditioners |2 nationallicence | |
| 690 | 7 | |a partial differential equations |2 nationallicence | |
| 690 | 7 | |a hierarchical basis |2 nationallicence | |
| 690 | 7 | |a optimal order preconditioners |2 nationallicence | |
| 700 | 1 | |a Axelsson |D O. |u Department of Mathematics, University of Nijmegen, Toernooiveld, 6525 ED Nijmegen, The Netherlands. | |
| 700 | 1 | |a Margenov |D S. |u Central Laboratory for Parallel Processing, Bulgarian Academy of Sciences, Acad. G. Bonchev, Bl. 25A, 1113 Sofia, Bulgaria. | |
| 773 | 0 | |t Computational Methods in Applied Mathematics |d De Gruyter |g 3/1(2003), 6-22 |x 1609-4840 |q 3:1<6 |1 2003 |2 3 |o cmam | |
| 856 | 4 | 0 | |u https://doi.org/10.2478/cmam-2003-0002 |q text/html |z Onlinezugriff via DOI |
| 908 | |D 1 |a research article |2 jats | ||
| 950 | |B NATIONALLICENCE |P 856 |E 40 |u https://doi.org/10.2478/cmam-2003-0002 |q text/html |z Onlinezugriff via DOI | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Axelsson |D O. |u Department of Mathematics, University of Nijmegen, Toernooiveld, 6525 ED Nijmegen, The Netherlands | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Margenov |D S. |u Central Laboratory for Parallel Processing, Bulgarian Academy of Sciences, Acad. G. Bonchev, Bl. 25A, 1113 Sofia, Bulgaria | ||
| 950 | |B NATIONALLICENCE |P 773 |E 0- |t Computational Methods in Applied Mathematics |d De Gruyter |g 3/1(2003), 6-22 |x 1609-4840 |q 3:1<6 |1 2003 |2 3 |o cmam | ||
| 900 | 7 | |b CC0 |u http://creativecommons.org/publicdomain/zero/1.0 |2 nationallicence | |
| 898 | |a BK010053 |b XK010053 |c XK010000 | ||
| 949 | |B NATIONALLICENCE |F NATIONALLICENCE |b NL-gruyter | ||