Combinatorial Aspects in Sparse Elimination Methods

DOI10.1002/GAMM.201490037MaRDI QIDQ3603887zbMATH OpenOpenAlexFDO

Authors Matthias Bollhöfer, Olaf Schenk

Publication date 24 February 2009

Published in GAMM-Mitteilungen (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/gamm.201490037

zbMATH Keywords

sparse matricesnumerical examplesmaximum weight matchingLU decompositionelimination treesparse direct methodssupernodesreordering techniques

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) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• State-of-the-art sparse direct solvers
• Elimination Structures for Unsymmetric Sparse $LU$ Factors
• Sparse Gaussian Elimination Modulo p: An Update
• A survey of direct methods for sparse linear systems
• Direct methods for sparse matrices

Cites work

• scientific article; zbMATH DE number 3976197 (Why is no real title available?)
• scientific article; zbMATH DE number 3681933 (Why is no real title available?)
• scientific article; zbMATH DE number 3767009 (Why is no real title available?)
• scientific article; zbMATH DE number 554767 (Why is no real title available?)
• scientific article; zbMATH DE number 2087097 (Why is no real title available?)
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• A Supernodal Approach to Sparse Partial Pivoting
• A column approximate minimum degree ordering algorithm
• A new pivoting strategy for Gaussian elimination
• A shared- and distributed-memory parallel general sparse direct solver
• An Approximate Minimum Degree Ordering Algorithm
• An Efficient Heuristic Procedure for Partitioning Graphs
• An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems
• An out-of-core sparse symmetric-indefinite factorization method
• Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
• Comparative Analysis of the Cuthill–McKee and the Reverse Cuthill–McKee Ordering Algorithms for Sparse Matrices
• Efficient sparse LU factorization with left-right looking strategy on shared memory multiprocessors
• Exploiting Structural Symmetry in a Sparse Partial Pivoting Code
• Multifrontal parallel distributed symmetric and unsymmetric solvers
• Preconditioning highly indefinite and nonsymmetric matrices
• Predicting Structure in Sparse Matrix Computations
• Recent advances in direct methods for solving unsymmetric sparse systems of linear equations
• Solution of sparse linear least squares problems using Givens rotations
• Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
• Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting
• TWO THEOREMS IN GRAPH THEORY
• The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
• The Evolution of the Minimum Degree Ordering Algorithm
• The Role of Elimination Trees in Sparse Factorization
• Theory of the flow of electrons and holes in Germanium and other semiconductors

Cited in

(1)

• State-of-the-art sparse direct solvers

Describes a project that uses

Uses Software

• SuperLU-DIST
• COLAMD
• LAPACK
• PARDISO
• MUMPS
• Ipopt
• WSMP

This page was built for publication: Combinatorial Aspects in Sparse Elimination Methods

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