Improved Symbolic and Numerical Factorization Algorithms for Unsymmetric Sparse Matrices

DOI10.1137/S089547980139604XzbMath1021.65014MaRDI QIDQ4785789

Anshul Gupta

Publication date: 5 January 2003

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

symbolic computationparallel computationsparse matrix factorizationpartial pivotingmultifrontal methodssparse LU factorizationparallel sparse solverssparse unsymmetric systemsstatic communication pattern

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

A shared- and distributed-memory parallel general sparse direct solver ⋮ On the finite volume reformulation of the mixed finite element method for elliptic and parabolic PDE on triangles. ⋮ Enhancing Performance and Robustness of ILU Preconditioners by Blocking and Selective Transposition ⋮ A survey of direct methods for sparse linear systems ⋮ Mixed and componentwise condition numbers for matrix decompositions

Uses Software

• WSMP