Parallel preconditioned conjugate-gradient type algorithms for general sparsity structures
DOI10.1080/00207169208804102zbMath0758.65023OpenAlexW2081478920MaRDI QIDQ4021064
Michele Marrone, Salvatore Filippone, Giuseppe Radicati di Brozolo
Publication date: 17 January 1993
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169208804102
preconditioningparallel computationiterative methodsconjugate gradient algorithmpreconditionerlarge sparse linear systemsshared memorynonsymmetric systemsparallel processorvector processorirregular sparsity structures
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Parallel numerical computation (65Y05)
Cites Work
- Unnamed Item
- Unnamed Item
- Parallelizing conjugate gradient for the CRAY X-MP
- Large tridiagonal and block tridiagonal linear systems on vector and parallel computers
- Parallel conjugate gradient-like algorithms for solving sparse nonsymmetric linear systems on a vector multiprocessor
- A parallel preconditioned conjugate gradient package for solving sparse linear systems on a Cray Y-MP
- Data structures to vectorize CG algorithms for general sparsity patterns
- The effect of ordering on preconditioned conjugate gradients
- ICCG and related methods for 3D problems on vector computers
- A Taxonomy for Conjugate Gradient Methods
- Krylov Subspace Methods on Supercomputers
- Polynomial Preconditioners for Conjugate Gradient Calculations
- 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
- An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
- Comparative Analysis of the Cuthill–McKee and the Reverse Cuthill–McKee Ordering Algorithms for Sparse Matrices
- A Comparison of Several Bandwidth and Profile Reduction Algorithms
