ICCG and related methods for 3D problems on vector computers

DOI10.1016/0010-4655(89)90162-8zbMath0798.65036OpenAlexW2050875433MaRDI QIDQ1330640

Henk A. van der Vorst

Publication date: 30 October 1994

Published in: Computer Physics Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0010-4655(89)90162-8

zbMATH Keywords

performancegradient methodsupercomputersvector computersICCG preconditioningincomplete Cholesky conjugate

Mathematics Subject Classification ID

Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Numerical algorithms for specific classes of architectures (65Y10)

Related Items (8)

How fast the Laplace equation was solved in 1995 ⋮ Large-numbered multicolor milu preconditioning on sx-3/14 ⋮ Parallel preconditioned conjugate-gradient type algorithms for general sparsity structures ⋮ Solution of nonlinear Poisson-type equations ⋮ Performance of hyperplane ordering on vector computers ⋮ Data structures to vectorize CG algorithms for general sparsity patterns ⋮ Solving 3D block bidiagonal linear systems on vector computers ⋮ Iterative solution of linear systems in the 20th century

Cites Work

• Unnamed Item
• The block preconditioned conjugate gradient method on vector computers
• The performance of FORTRAN implementations for preconditioned conjugate gradients on vector computers
• On Vectorizing Incomplete Factorization and SSOR Preconditioners
• Efficient Implementation of a Class of Preconditioned Conjugate Gradient Methods
• A class of first order factorization methods

This page was built for publication: ICCG and related methods for 3D problems on vector computers