Combinatorial Aspects in Sparse Elimination Methods

DOI10.1002/GAMM.201490037zbMATH Open1177.65047OpenAlexW2110107069MaRDI QIDQ3603887FDOQ3603887

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

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

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)

Cites Work

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

Cited In (1)

• State-of-the-art sparse direct solvers

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)