Algorithm 836

DOI10.1145/1024074.1024080MaRDI QIDQ5461206zbMATH OpenOpenAlexWikidataFDO

Authors Timothy A. Davis, J. R. Gilbert, Stefan I. Larimore, Esmond G. Ng

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.1024080

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Computational methods for sparse matrices (65F50) Numerical mathematical programming methods (65K05) Packaged methods for numerical algorithms (65Y15) Linear programming (90C05) Interior-point methods (90C51)

Recommendations

• Algorithm 837
• A column approximate minimum degree ordering algorithm
• An Approximate Minimum Degree Ordering Algorithm
• Algorithm 832
• The Evolution of the Minimum Degree Ordering Algorithm

Cited in

(25)

• COLAMD
• Block SOR for Kronecker structured representations
• A mathematical model for the simulation of the contraction of burns
• A triangulation and fill-reducing initialization procedure for the simplex algorithm
• \texttt{Tenscalc}: a toolbox to generate fast code to solve nonlinear constrained minimizations and compute Nash equilibria
• Cached Gaussian elimination for simulating Stokes flow on domains with repetitive geometry
• A sparse proximal implementation of the LP dual active set algorithm
• Sparse matrix methods for circuit simulation problems
• A note on fast approximate minimum degree orderings for symmetric matrices with some dense rows
• Algorithm 849
• Evaluation of Orderings for Unsymmetric Sparse Matrices
• An Approximate Minimum Degree Ordering Algorithm
• A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems
• Fast algorithm for singly linearly constrained quadratic programs with box-like constraints
• Exact solution of sparse linear systems via left-looking roundoff-error-free Lu factorization in time proportional to arithmetic work
• Algorithm 832
• A column approximate minimum degree ordering algorithm
• Algorithm 837
• Factoring matrices with a tree-structured sparsity pattern
• Generalized Rybicki Press algorithm.
• A survey of direct methods for sparse linear systems
• Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization
• Robust PRESB preconditioning of a 3-dimensional space-time finite element method for parabolic problems
• Sparse linear least-squares problems
• Algorithm 1050: SPEX Cholesky, LDL, and backslash for exactly solving sparse linear systems

Describes a project that uses

Uses Software

• KORBX
• BLAS
• Matlab
• symamd

This page was built for publication: Algorithm 836

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