Some remarks on completely vectorizing point Gauss-Seidel while using the natural ordering

DOI10.1007/BF02521108MaRDI QIDQ1895908zbMATH OpenFDO

Authors C. Douglas

Publication date 13 August 1995

Published in Advances in Computational Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02521108

zbMATH Keywords

orderingparallel computerpoint Gauss-Seidel iterationpoint SOR methodssuccessive overrelaxationvectorization

Mathematics Subject Classification ID

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

Recommendations

• Vectorizable algorithm for the (multicolour) successive overrelaxation method
• On the efficiency of a SOR-like method suited to vector processors
• A parallel Gauss-Seidel method using NR data flow ordering
• Orderings for Parallel Conjugate Gradient Preconditioners
• The vectorization of ITPACK 2C

Cites work

• A Parallel and Vector Variant of the Cyclic Reduction Algorithm
• The Solution of Tridiagonal Linear Systems on the CDC STAR 100 Computer

Cited in

(1)

• A parallel Gauss-Seidel method using NR data flow ordering

This page was built for publication: Some remarks on completely vectorizing point Gauss-Seidel while using the natural ordering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1895908)