A parallel preconditioned conjugate gradient package for solving sparse linear systems on a Cray Y-MP

DOI10.1016/0168-9274(91)90045-2zbMath0738.65025MaRDI QIDQ1181505

Chao Yang, Phuong Anh Vu, Michael A. Heroux

Publication date: 27 June 1992

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

Full work available at URL: https://doi.org/10.1016/0168-9274(91)90045-2

zbMATH Keywords

parallel computing; sparse matrix; scaling; package; computational results; matrix-vector product; incomplete Cholesky; shared-memory; CRAY Y-MP; vector/parallel computers; \(LU\) factorizations; CRAY PCG; preconditioned conjugate gradient iterative methods

Mathematics Subject Classification ID

65F50: Computational methods for sparse matrices

65F10: Iterative numerical methods for linear systems

65Y05: Parallel numerical computation

15-04: Software, source code, etc. for problems pertaining to linear algebra

Related Items

Efficient approximate solution of sparse linear systems, Numerical experiments with two approximate inverse preconditioners, Parallel preconditioned conjugate-gradient type algorithms for general sparsity structures, A comparison of FAC and PCG methods for solving composite grid problems

Uses Software

• NSPCG
• ITSOL
• SPARSKIT
• CGS
• Harwell-Boeing sparse matrix collection

Cites Work

• Unnamed Item
• Unnamed Item
• A new storage scheme for an efficient implementation of the sparse matrix-vector product
• Parallel solution of linear systems with striped sparse matrices
• Vectorizable preconditioners for elliptic difference equations in three space dimensions
• Data structures to vectorize CG algorithms for general sparsity patterns
• Practical use of the conjugate gradient method on parallel supercomputers
• SPARSE MATRIX MULTIPLICATION ON VECTOR COMPUTERS
• Krylov Subspace Methods on Supercomputers
• Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method
• On Vectorizing Incomplete Factorization and SSOR Preconditioners
• CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
• Sparse matrix test problems
• An Incomplete Factorization Technique for Positive Definite Linear Systems
• The Use of Conjugate Gradients for Systems of Linear Equations Possessing “Property A”
• Methods of conjugate gradients for solving linear systems