Multilevel Filtering Elliptic Preconditioners
- 1 July 1990
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 11 (3) , 403-429
- https://doi.org/10.1137/0611029
Abstract
A class of preconditioners for elliptic problems built on ideas borrowed from the digital filtering theory and implemented on a multilevel grid structure is presented. These preconditioners are designed to be both rapidly convergent and highly parallelizable. The digital filtering viewpoint allows for the use of filter design techniques for constructing elliptic preconditioners and also provides an alternative framework for understanding several other recently proposed multilevel preconditioners. Numerical results are presented to assess the convergence behavior of the new methods and to compare them with other preconditioners of multilevel type, including the usual multigrid method as preconditioner, the hierarchical basis method, and a recent method proposed by Bramble–Pasciak–Xu.Keywords
This publication has 16 references indexed in Scilit:
- Parallel multilevel preconditionersMathematics of Computation, 1990
- Parallelizing preconditioned conjugate gradient algorithmsComputer Physics Communications, 1989
- Parallel elliptic preconditioners: Fourier analysis and performance on the connection machineComputer Physics Communications, 1989
- The hierarchical basis multigrid methodNumerische Mathematik, 1988
- On the eigenvalue distribution of a class of preconditioning methodsNumerische Mathematik, 1986
- Multi-Grid Methods and ApplicationsPublished by Springer Nature ,1985
- Multirate digital signal processingSignal Processing, 1983
- Multi-level adaptive solutions to boundary-value problemsMathematics of Computation, 1977
- A generalized SSOR methodBIT Numerical Mathematics, 1972
- An Approximate Factorization Procedure for Solving Self-Adjoint Elliptic Difference EquationsSIAM Journal on Numerical Analysis, 1968