Performance of hyperplane ordering on vector computers

DOI10.1016/0377-0427(91)90165-GzbMath0753.65025MaRDI QIDQ1184116

Masatake Mori, Toshiki Takeuchi, Seiji Fujino

Publication date: 28 June 1992

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

zbMATH Keywords

conjugate gradient methodshyperplane orderingincomplete Cholesky conjugate gradient methodLarge systems of linear algebraic equationsmemory bank conflictparallel vector computers

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Numerical algorithms for specific classes of architectures (65Y10)

Related Items (6)

Parallelization of an unstructured Navier-Stokes solver using a multi-color ordering method for openmp ⋮ ILU factorization well suited to the vector processor using a variant of the 5-point difference scheme ⋮ A hierarchical wavefront method for LU-SGS ⋮ The danger of combining block red-black ordering with modified incomplete factorizations and its remedy by perturbation or relaxation ⋮ Performance of SOR methods on modern vector and scalar processors ⋮ Multicolor SOR Method with Consecutive Memory Access Implementation in a Shared and Distributed Memory Parallel Environment

Uses Software

• CGS

Cites Work

• Unnamed Item
• Unnamed Item
• Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
• ICCG and related methods for 3D problems on vector computers
• High Performance Preconditioning
• CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems

This page was built for publication: Performance of hyperplane ordering on vector computers