Hypergraph-based unsymmetric nested dissection ordering for sparse LU factorization

DOI10.1137/080720395MaRDI QIDQ5200257zbMATH OpenOpenAlexFDO

Authors Laura Grigori, E. G. Boman, Simplice Donfack, Timothy A. Davis

Publication date 1 August 2011

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

Full work available at URL https://semanticscholar.org/paper/0996ba036cc6bfc9d625728616c8b2e9ecaeb490

zbMATH Keywords

algorithmGaussian eliminationhypergraph partitioningnested dissectionnumerical examplesparallel computationpartial pivotingreordering techniquessparse LU factorization

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50)

Recommendations

• Nested-dissection orderings for sparse LU with partial pivoting
• Diagonal Markowitz Scheme with Local Symmetrization
• scientific article; zbMATH DE number 1617961
• Evaluation of Orderings for Unsymmetric Sparse Matrices
• Hypergraph Partitioning-Based Fill-Reducing Ordering for Symmetric Matrices

Cited in

(5)

• An exact algorithm for graph partitioning
• The Fiedler vector of a Laplacian tensor for hypergraph partitioning
• Hierarchical orthogonal factorization: sparse square matrices
• Aggregation of Markov flows I: theory
• A survey of direct methods for sparse linear systems

Describes a project that uses

Uses Software

• HSL
• CHOLMOD
• SparseMatrix
• HSL_MC64
• SuperLU-DIST
• UMFPACK
• METIS
• CALU
• PaToH

This page was built for publication: Hypergraph-based unsymmetric nested dissection ordering for sparse LU factorization

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