Parallel Symbolic Factorization for Sparse LU with Static Pivoting

DOI10.1137/050638102zbMath1141.65354OpenAlexW2053266474MaRDI QIDQ3506558

No author found.

Publication date: 16 June 2008

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/050638102

zbMATH Keywords

numerical examplessparse LU factorizationparallel symbolic factorizationsparse unsymmetric matricesmemory scalability

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)

Multi-core parallel robust structured multifrontal factorization method for large discretized PDEs ⋮ ELSI: a unified software interface for Kohn-Sham electronic structure solvers ⋮ A survey on direct solvers for Galerkin methods ⋮ A survey of direct methods for sparse linear systems ⋮ Mixed and componentwise condition numbers for matrix decompositions

Uses Software

• SuperLU-DIST
• HSL
• PSPASES
• SparseMatrix

This page was built for publication: Parallel Symbolic Factorization for Sparse LU with Static Pivoting