Analysis of incomplete matrix factorizations as multigrid smoothers for vector and parallel computers
DOI10.1016/0096-3003(86)90094-9zbMath0619.65017OpenAlexW2003218817WikidataQ114215172 ScholiaQ114215172MaRDI QIDQ1089724
Publication date: 1986
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0096-3003(86)90094-9
smoothingmultigrid methodspreconditionersvectorizationincomplete blockmatrix factorizationparallel processors with pipelines
Boundary value problems for second-order elliptic equations (35J25) Numerical computation of matrix norms, conditioning, scaling (65F35) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The block preconditioned conjugate gradient method on vector computers
- On some versions of incomplete block-matrix factorization iterative methods
- On the eigenvalue distribution of a class of preconditioning methods
- Incomplete block matrix factorization preconditioning methods. The ultimate answer?
- A general incomplete block-matrix factorization method
- Matrix multiplication by diagonals on a vector/parallel processor
- Block Preconditioning for the Conjugate Gradient Method
- Decay Rates for Inverses of Band Matrices
- A Vectorizable Variant of some ICCG Methods
- A Survey of Parallel Algorithms in Numerical Linear Algebra
- An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations