An efficient parallel preconditioned conjugate gradient method for sparse linear equations

MaRDI QIDQ3194217zbMATH OpenFDO

Authors Hao Xu

Publication date 28 October 2015

zbMATH Keywords

block Jacobi iteration methoditerative methodnumerical experimentsparallel methodpreconditioned conjugate gradient methodsparse symmetric positive matrix

Mathematics Subject Classification ID

Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05)

Recommendations

• Parallel m-step preconditioners for the conjugate gradient method
• A Distributed Normalized Explicit Preconditioned Conjugate Gradient Method
• Parallel preconditioned conjugate-gradient type algorithms for general sparsity structures
• scientific article; zbMATH DE number 833706
• Preconditioned CG methods for sparse matrices on massively parallel machines

Cited in

(8)

• A parallel additive preconditioner for conjugate gradient method for AX+XB=C
• scientific article; zbMATH DE number 4092656 (Why is no real title available?)
• Iterative methods for solving sparse linear systems with a parallel preconditioner
• scientific article; zbMATH DE number 2051077 (Why is no real title available?)
• scientific article; zbMATH DE number 926693 (Why is no real title available?)
• Preconditioned conjugate gradient method for the sparse generalized eigenvalue problem in electronic structure calculations
• Parallel implementation of an efficient preconditioned linear solver for grid-based applications in chemical physics. III: Improved parallel scalability for sparse matrix-vector products
• A conjugate gradient algorithm for sparse linear inequalities

This page was built for publication: An efficient parallel preconditioned conjugate gradient method for sparse linear equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3194217)