Design of an iterative solution module for a parallel sparse matrix library (P\_SPARSLIB)

DOI10.1016/0168-9274(95)00090-9zbMath0854.65029OpenAlexW2027361922WikidataQ59359436 ScholiaQ59359436MaRDI QIDQ1917425

Yousef Saad, Kesheng Wu

Publication date: 5 September 1996

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-9274(95)00090-9

zbMATH Keywords

preconditioningsparse linear systemsconjugate gradient methodsparallel computersscalar productmatrix-vector productiterative solutionprogram package

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Parallel numerical computation (65Y05) Packaged methods for numerical algorithms (65Y15)

Related Items

Solution of large eigenvalue problems in electronic structure calculations

Uses Software

• P-SPARSLIB
• DQGMRES
• ITSOL
• SPARSKIT
• CGS
• Harwell-Boeing sparse matrix collection

Cites Work

• QMR: A quasi-minimal residual method for non-Hermitian linear systems
• Practical Use of Some Krylov Subspace Methods for Solving Indefinite and Nonsymmetric Linear Systems
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
• The Lanczos Biorthogonalization Algorithm and Other Oblique Projection Methods for Solving Large Unsymmetric Systems
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• A Flexible Inner-Outer Preconditioned GMRES Algorithm
• A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item