Solving 3D block bidiagonal linear systems on vector computers

DOI10.1016/0377-0427(89)90373-7zbMath0679.65021OpenAlexW2102360815MaRDI QIDQ1822897

J. J. F. M. Schlichting, Henk A. van der Vorst

Publication date: 1989

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(89)90373-7

zbMATH Keywords

efficiencyiterative methodsvectorizationsupercomputersPreconditioningvector computers3D-block bidiagonal systems

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05)

Related Items (1)

A parallel Jacobian-free Newton-Krylov solver for a coupled sea ice-ocean model

Cites Work

• The performance of FORTRAN implementations for preconditioned conjugate gradients on vector computers
• 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
• High Performance Preconditioning
• On Vectorizing Incomplete Factorization and SSOR Preconditioners
• Efficient Implementation of a Class of Preconditioned Conjugate Gradient Methods

This page was built for publication: Solving 3D block bidiagonal linear systems on vector computers