Scalable iterative solution of sparse linear systems

DOI10.1016/0167-8191(94)90004-3MaRDI QIDQ1323641zbMATH OpenOpenAlexFDO

Authors Mark Jones, Paul E. Plassmann

Publication date 11 December 1994

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(94)90004-3

zbMATH Keywords

coloring orderingsconjugate gradient methodfinite element matricesgraph coloringincomplete Cholesky factorizationparallel algorithmsperformancesparse linear systems

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05)

Review text

The conjugate gradient method preconditioned by an incomplete Cholesky factorization is considered. One method to minimize the number of major parallel steps is to choose an column ordering based on a coloring of the symmetric graph representing the nonzero adjacency structure of the matrix. The performance of the preconditioned conjugate gradient method using these coloring orderings is compared with a number of standard orderings on finite element matrices. Results from Intel iPSC/860 are given.

Recommendations

• scientific article; zbMATH DE number 554772
• Multicolor ICCG Methods for Vector Computers
• Ordering techniques for the preconditioned conjugate gradient method on parallel computers
• Orderings for Parallel Conjugate Gradient Preconditioners

Cited in

(23)

• Parallel implementation of the finite element method using compressed data structures
• Efficient VLSI implementation of iterative solutions to sparse linear systems
• Iterative solution of SPARK methods applied to DAEs
• Preconditioning techniques for large linear systems: A survey
• A variant of IDRstab with reliable update strategies for solving sparse linear systems
• About one parallel version of the second order incomplete triangular factorization
• scientific article; zbMATH DE number 989459 (Why is no real title available?)
• Effects of Ordering Strategies and Programming Paradigms on Sparse Matrix Computations
• scientific article; zbMATH DE number 6501155 (Why is no real title available?)
• Graph coloring using GPUs
• A Block Ordering Method for Sparse Matrices
• scientific article; zbMATH DE number 3915502 (Why is no real title available?)
• Multicolor ICCG Methods for Vector Computers
• Résolution de grands systèmes linéaires creux par méthodes itératives parallèles
• scientific article; zbMATH DE number 554770 (Why is no real title available?)
• scientific article; zbMATH DE number 663839 (Why is no real title available?)
• Sparse Preconditioned Iterative Methods for Dense Linear Systems
• Orderings for Parallel Conjugate Gradient Preconditioners
• A framework for scalable greedy coloring on distributed-memory parallel computers
• scientific article; zbMATH DE number 833709 (Why is no real title available?)
• Fine-grained parallel incomplete LU factorization
• Sparse Matrix Factorizations for Fast Linear Solvers with Application to Laplacian Systems
• Exploiting thread-level parallelism in the iterative solution of sparse linear systems

This page was built for publication: Scalable iterative solution of sparse linear systems

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