A column approximate minimum degree ordering algorithm
From MaRDI portal
Publication:5461205
DOI10.1145/1024074.1024079zbMath1073.65039WikidataQ113310742 ScholiaQ113310742MaRDI QIDQ5461205
Timothy A. Davis, John R. Gilbert, Esmond G. Ng, Stefan I. Larimore
Publication date: 22 July 2005
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1024074.1024079
Cholesky factorization; sparse Gaussian elimination; partial pivoting; minimum degree ordering algorithm; column preordering
65F50: Computational methods for sparse matrices
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
65F05: Direct numerical methods for linear systems and matrix inversion
Related Items
COLAMD, Factoring matrices with a tree-structured sparsity pattern, Wavelet solvers for \(hp\)-FEM discretizations in 3D using hexahedral elements, Block SOR for Kronecker structured representations, A sparse proximal implementation of the LP dual active set algorithm, Dual multilevel optimization, A MATLAB-based frequency-domain finite-difference package for solving 2D visco-acoustic wave equation, Sparse Matrix Methods for Circuit Simulation Problems, Square Root SAM: Simultaneous Localization and Mapping via Square Root Information Smoothing, Ordering techniques for singly bordered block diagonal forms for unsymmetric parallel sparse direct solvers, Combinatorial Aspects in Sparse Elimination Methods
Uses Software
