Incomplete block-factorization preconditioners for solving three-dimensional elliptic difference equations on systolic processors∗∗∗
DOI10.1080/00207169208804113zbMath0816.65069OpenAlexW2102206328MaRDI QIDQ4021075
Hristo N. Djidjev, Panayot S. Vassilevski
Publication date: 17 January 1993
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169208804113
numerical examplesfinite differencesPoisson equationparallel algorithmsparse linear systemsystolic arraypreconditioned iterative methodincomplete block-factorizationthree dimensional elliptic problem
Computational methods for sparse matrices (65F50) Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Parallel numerical computation (65Y05) Finite difference methods for boundary value problems involving PDEs (65N06)
Cites Work
- Unnamed Item
- Unnamed Item
- On some ways of approximating inverses of banded matrices in connection with deriving preconditioners based on incomplete block factorizations
- Positive definiteness aspects of vectorizable preconditioners
- The block preconditioned conjugate gradient method on vector computers
- On approximate factorization methods for block matrices suitable for vector and parallel processors
- A general incomplete block-matrix factorization method
- The block conjugate gradient algorithm and related methods
- Block Preconditioning for the Conjugate Gradient Method
- A Vectorizable Variant of some ICCG Methods
- Some questions from the general theory of difference schemes
This page was built for publication: Incomplete block-factorization preconditioners for solving three-dimensional elliptic difference equations on systolic processors∗∗∗
