Parallel Multilevel Preconditioners Export

@article{citeulike:1269161, abstract = {In this paper, we provide techniques for the development and analysis of parallel multilevel preconditioners for the discrete systems which arise in numerical approximation of symmetric elliptic boundary value problems. These preconditioners are defined as a sum of independent operators on a sequence of nested subspaces of the full approximation space. On a parallel computer, the evaluation of these operators and hence of the preconditioner on a given function can be computed concurrently. We shall study this new technique for developing preconditioners first in an abstract setting, next by considering applications to second-order elliptic problems, and finally by providing numerically computed condition numbers for the resulting preconditioned systems. The abstract theory gives estimates on the condition number in terms of three assumptions. These assumptions can be verified for quasi-uniform as well as refined meshes in any number of dimensions. Numerical results for the condition number of the preconditioned systems are provided for the new algorithms and compared with other well-known multilevel approaches.}, author = {Bramble, James H. and Pasciak, Joseph E. and Xu, Jinchao}, citeulike-article-id = {1269161}, citeulike-linkout-0 = {http://www.jstor.org/stable/2008789}, journal = {Mathematics of Computation}, keywords = {algorithm, amg, parallel}, number = {191}, pages = {1--22}, posted-at = {2007-04-30 20:58:46}, priority = {4}, title = {Parallel Multilevel Preconditioners}, url = {http://www.jstor.org/stable/2008789}, volume = {55}, year = {1990} }

TY - JOUR ID - citeulike:1269161 L3 - citeulike-article-id:1269161 N2 - In this paper, we provide techniques for the development and analysis of parallel multilevel preconditioners for the discrete systems which arise in numerical approximation of symmetric elliptic boundary value problems. These preconditioners are defined as a sum of independent operators on a sequence of nested subspaces of the full approximation space. On a parallel computer, the evaluation of these operators and hence of the preconditioner on a given function can be computed concurrently. We shall study this new technique for developing preconditioners first in an abstract setting, next by considering applications to second-order elliptic problems, and finally by providing numerically computed condition numbers for the resulting preconditioned systems. The abstract theory gives estimates on the condition number in terms of three assumptions. These assumptions can be verified for quasi-uniform as well as refined meshes in any number of dimensions. Numerical results for the condition number of the preconditioned systems are provided for the new algorithms and compared with other well-known multilevel approaches. IS - 191 JF - Mathematics of Computation EP - 22 TI - Parallel Multilevel Preconditioners VL - 55 SP - 1 KW - algorithm KW - amg KW - parallel AU - Bramble, James AU - Pasciak, Joseph AU - Xu, Jinchao PY - 1990/// UR - http://www.jstor.org/stable/2008789 ER -