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

DOI10.1007/s00200-007-0037-xzbMath1122.65030MaRDI 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

algorithms; numerical examples; symbolic computation; parallel computation; sparse matrix factorization; sparse Gaussian elimination; partial pivoting; multifrontal methods; sparse LU decomposition; parallel sparse solvers

Mathematics Subject Classification ID

65F50: Computational methods for sparse matrices

68W30: Symbolic computation and algebraic computation

65Y05: Parallel numerical computation

65F05: Direct numerical methods for linear systems and matrix inversion

Related Items

Non-intrusive parallelization of multibody system dynamic simulations, 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