A tearing-based hybrid parallel sparse linear system solver

DOI10.1016/j.cam.2010.04.016zbMath1193.65029OpenAlexW4206369538MaRDI QIDQ984910

Maxim Naumov, Murat Manguoglu, Ahmed H. Sameh

Publication date: 20 July 2010

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

Full work available at URL: https://doi.org/10.1016/j.cam.2010.04.016

zbMATH Keywords

comparison of methodsnumerical experimentspreconditioningconjugate gradient methodparallel algorithmsKrylov subspace methodsalgebraic domain decompositionhybrid schemessparse system solver

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05) Preconditioners for iterative methods (65F08)

Related Items (4)

The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures ⋮ Parallel Hybrid Sparse Linear System Solvers ⋮ \(\text{PSPIKE}+\): A family of parallel hybrid sparse linear system solvers ⋮ Distributed algebraic tearing and interconnecting techniques

Uses Software

• MA57
• PARDISO
• UMFPACK
• SPIKE
• SparseMatrix
• mctoolbox
• Harwell-Boeing sparse matrix collection
• ILUPACK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• SPIKE: A parallel environment for solving banded linear systems
• Spectral partitioning works: planar graphs and finite element meshes
• A tearing-based hybrid parallel banded linear system solver
• Preconditioning Highly Indefinite and Nonsymmetric Matrices
• The university of Florida sparse matrix collection
• Numerical solution of saddle point problems
• Comparative Analysis of the Cuthill–McKee and the Reverse Cuthill–McKee Ordering Algorithms for Sparse Matrices
• A combined unifrontal/multifrontal method for unsymmetric sparse matrices
• Solving Sparse Linear Systems with Sparse Backward Error
• Accuracy and Stability of Numerical Algorithms
• MA57---a code for the solution of sparse symmetric definite and indefinite systems
• Algorithm 832

This page was built for publication: A tearing-based hybrid parallel sparse linear system solver