Solving 3D block bidiagonal linear systems on vector computers
From MaRDI portal
(Redirected from Publication:1822897)
Different techniques are described for the vectorization of the solution of 3D-block bidiagonal systems. The proposed methods are directly applicable to ETA-10 family of supercomputers and can be adapted to other vector computers. Preconditioning techniques are discussed and examples are given showing the efficiency of the proposed methods.
Recommendations
- Large tridiagonal and block tridiagonal linear systems on vector and parallel computers
- scientific article; zbMATH DE number 17467
- Wrap-around partitioning for block bidiagonal linear systems
- The block preconditioned conjugate gradient method on vector computers
- Review of general and Toeplitz vector bidiagonal solvers
Cites work
- Efficient Implementation of a Class of Preconditioned Conjugate Gradient Methods
- Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problems
- High Performance Preconditioning
- ICCG and related methods for 3D problems on vector computers
- On Vectorizing Incomplete Factorization and SSOR Preconditioners
- The performance of FORTRAN implementations for preconditioned conjugate gradients on vector computers
Cited in
(4)
This page was built for publication: Solving 3D block bidiagonal linear systems on vector computers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1822897)