Data structures to vectorize CG algorithms for general sparsity patterns
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4074338
- Parallel conjugate gradient-like algorithms for solving sparse nonsymmetric linear systems on a vector multiprocessor
- Publication:4723159
- Conjugate-gradient subroutines for the IBM 3090 Vector Facility
- The behavior of conjugate gradient algorithms on a multivector processor with a hierarchical memory
Cites work
- scientific article; zbMATH DE number 3924021 (Why is no real title available?)
- scientific article; zbMATH DE number 3584897 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- A Vectorizable Variant of some ICCG Methods
- A class of first order factorization methods
- A survey of preconditioned iterative methods for linear systems of algebraic equations
- An Incomplete Factorization Technique for Positive Definite Linear Systems
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Approximating the inverse of a matrix for use in iterative algorithms on vector processors
- Block Preconditioning for the Conjugate Gradient Method
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Conjugate-gradient subroutines for the IBM 3090 Vector Facility
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
- Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problems
- ICCG and related methods for 3D problems on vector computers
- Implementation of the GMRES Method Using Householder Transformations
- Matrix multiplication by diagonals on a vector/parallel processor
- Methods of conjugate gradients for solving linear systems
- On Vectorizing Incomplete Factorization and SSOR Preconditioners
- Polynomial Preconditioners for Conjugate Gradient Calculations
- Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method
- Sparse matrix test problems
- The Lanczos Biorthogonalization Algorithm and Other Oblique Projection Methods for Solving Large Unsymmetric Systems
- The block preconditioned conjugate gradient method on vector computers
- The effect of ordering on preconditioned conjugate gradients
- The performance of FORTRAN implementations for preconditioned conjugate gradients on vector computers
Cited in
(6)- Parallel preconditioned conjugate-gradient type algorithms for general sparsity structures
- A parallel preconditioned conjugate gradient package for solving sparse linear systems on a Cray Y-MP
- Sparse data structure design for wavelet-based methods
- scientific article; zbMATH DE number 4074338 (Why is no real title available?)
- Conjugate-gradient subroutines for the IBM 3090 Vector Facility
- scientific article; zbMATH DE number 3997019 (Why is no real title available?)
This page was built for publication: Data structures to vectorize CG algorithms for general sparsity patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1262077)
