A tree-based dataflow model for the unsymmetric multifrontal method

MaRDI QIDQ871147zbMATH OpenFDO

Authors Stanley C. Eisenstat, Joseph W. H. Liu

Publication date 16 March 2007

Published in ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/127936

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

parallel computationelimination treesparse matrix factorizationsparse LU decompositionunsymmetric multifrontal method

Mathematics Subject Classification ID

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

Recommendations

• A combined unifrontal/multifrontal method for unsymmetric sparse matrices
• Algorithmic Aspects of Elimination Trees for Sparse Unsymmetric Matrices
• scientific article; zbMATH DE number 741180
• Multifrontal parallel distributed symmetric and unsymmetric solvers
• The Theory of Elimination Trees for Sparse Unsymmetric Matrices

Cited in

(3)

• Fast algorithms for hierarchically semiseparable matrices
• The Theory of Elimination Trees for Sparse Unsymmetric Matrices
• Acoustic inverse scattering via Helmholtz operator factorization and optimization

This page was built for publication: A tree-based dataflow model for the unsymmetric multifrontal method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q871147)