A shared- and distributed-memory parallel general sparse direct solver

DOI10.1007/s00200-007-0037-xzbMath1122.65030OpenAlexW2007860592MaRDI QIDQ2642895

Anshul Gupta

Publication date: 6 September 2007

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-007-0037-x

zbMATH Keywords

algorithmsnumerical examplessymbolic computationparallel computationsparse matrix factorizationsparse Gaussian eliminationpartial pivotingmultifrontal methodssparse LU decompositionparallel sparse solvers

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Symbolic computation and algebraic computation (68W30) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (5)

Non-intrusive parallelization of multibody system dynamic simulations ⋮ A SBS-BD based solver for domain decomposition in BE methods ⋮ A parallel shared-memory implementation of a high-order accurate solution technique for variable coefficient Helmholtz problems ⋮ A survey of direct methods for sparse linear systems ⋮ Combinatorial Aspects in Sparse Elimination Methods

Uses Software

• SuperLU-DIST
• MUMPS
• WSMP

Cites Work

• Unnamed Item
• A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
• Multifrontal parallel distributed symmetric and unsymmetric solvers
• An Unsymmetric-Pattern Multifrontal Method for Sparse LU Factorization
• The Multifrontal Solution of Unsymmetric Sets of Linear Equations
• The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
• Improved Symbolic and Numerical Factorization Algorithms for Unsymmetric Sparse Matrices
• Recent advances in direct methods for solving unsymmetric sparse systems of linear equations
• SuperLU_DIST

This page was built for publication: A shared- and distributed-memory parallel general sparse direct solver