A Distributed Normalized Explicit Preconditioned Conjugate Gradient Method
DOI10.1080/10637190412331279975zbMath1091.65031OpenAlexW1976239022MaRDI QIDQ4823585
George A. Gravvanis, Konstantinos M. Giannoutakis, Nikolaos M. Missirlis
Publication date: 28 October 2004
Published in: Parallel Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10637190412331279975
numerical resultssparse linear systemsFinite differencePreconditioningParallel computationsNormalized approximate factorization proceduresNormalized approximate inverse matrix techniquesParallel preconditioned conjugate gradient method
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)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Normalized factorization procedures for the solution of self-adjoint elliptic partial differential equations in three-space dimensions
- Approximate sparsity patterns for the inverse of a matrix and preconditioning
- Explicit approximate inverse preconditioning techniques
- Iterative solution of linear systems in the 20th century
- The impact of high-performance computing in the solution of linear systems: Trends and problems
- Preconditioning techniques for large linear systems: A survey
- The rate of convergence of explicit approximate inverse preconditioning
- High Performance Preconditioning
- Numerical Linear Algebra for High-Performance Computers
- Iterative Solution Methods
- Parallel Preconditioning with Sparse Approximate Inverses
- A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
- ON THE RATE OF CONVERGENCE AND COMPLEXITY OF NORMALIZED IMPLICIT PRECONDITIONING FOR SOLVING FINITE DIFFERENCE EQUATIONS IN THREE SPACE VARIABLES