Design of an iterative solution module for a parallel sparse matrix library (P\_SPARSLIB)
type: Item
instance of: scholarly article
title: Design of an iterative solution module for a parallel sparse matrix library (P\_SPARSLIB)
zbMATH Open document ID: 0854.65029
DOI: 10.1016/0168-9274(95)00090-9
author: Y. Saad
author: Kesheng Wu
published in: Applied Numerical Mathematics
publication date: 1996-09-05T00:00:00Z
review text: Presentation of a program package for the iterative solution of (sparse) linear systems by (generalized) conjugate gradient methods on parallel computers. The crucial points for parallelization: matrix-vector product, scalar product and preconditioning step must be delivered by the user. Examples are presented for different matrices, different algorithms and different parallel computers.
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 65F35
Mathematics Subject Classification ID: 65Y05
Mathematics Subject Classification ID: 65Y15
zbMATH DE Number: 897516
zbMATH Keywords: sparse linear systems
zbMATH Keywords: program package
zbMATH Keywords: iterative solution
zbMATH Keywords: conjugate gradient methods
zbMATH Keywords: parallel computers
zbMATH Keywords: matrix-vector product
zbMATH Keywords: scalar product
zbMATH Keywords: preconditioning
Wikidata QID: Q59359436
describes a project that uses: P-SPARSLIB
describes a project that uses: ITSOL
describes a project that uses: DQGMRES
describes a project that uses: SPARSKIT
describes a project that uses: Harwell-Boeing sparse matrix collection
describes a project that uses: CGS
MaRDI profile type: Publication
full work available at URL: 0168-9274(95)00090-9
OpenAlex ID: W2027361922
cites work: Q3323187
cites work: Q4091368
cites work: A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
cites work: QMR: A quasi-minimal residual method for non-Hermitian linear systems
cites work: The Lanczos Biorthogonalization Algorithm and Other Oblique Projection Methods for Solving Large Unsymmetric Systems
cites work: Practical Use of Some Krylov Subspace Methods for Solving Indefinite and Nonsymmetric Linear Systems
cites work: Q4395364
cites work: A Flexible Inner-Outer Preconditioned GMRES Algorithm
cites work: GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
cites work: Q4220436
cites work: CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
cites work: Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
Recommended article: Q4310144
Recommended article: Q4860193
Recommended article: Parallel iterative methods for sparse linear systems
Recommended article: Q4288588
Recommended article: Parallel, iterative solution of sparse linear systems: Models and architectures
Recommended article: Parallel algorithms for the iterative solution of sparse least-squares problems
Recommended article: A direct parallel sparse matrix solver
Recommended article: Parallel sparse matrix solution and performance
Recommended article: Résolution de grands systèmes linéaires creux par méthodes itératives parallèles
Recommended article: Partitioning Sparse Matrices for Parallel Preconditioned Iterative Methods
description: scientific article; zbMATH DE number 897516