A Distributed Normalized Explicit Preconditioned Conjugate Gradient Method

DOI10.1080/10637190412331279975zbMath1091.65031MaRDI QIDQ4823585

Nikolaos M. Missirlis, George A. Gravvanis, Konstantinos M. Giannoutakis

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

zbMATH Keywords

numerical results; sparse linear systems; Finite difference; Preconditioning; Parallel computations; Normalized approximate factorization procedures; Normalized approximate inverse matrix techniques; Parallel preconditioned conjugate gradient method

Mathematics Subject Classification ID

35J25: Boundary value problems for second-order elliptic equations

65F10: Iterative numerical methods for linear systems

65F35: Numerical computation of matrix norms, conditioning, scaling

65Y05: Parallel numerical computation

65N06: Finite difference methods for boundary value problems involving PDEs

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