Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization

DOI10.1145/3519024OpenAlexW4220942726WikidataQ113309842 ScholiaQ113309842MaRDI QIDQ5883713

Timothy A. Davis, Jinhao Chen, Christopher J. Lourenco, Erick Moreno-Centeno

Publication date: 22 March 2023

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3519024

zbMATH Keywords

sparse linear systemsroundoff errorssparse matrix algorithmsexact matrix factorizationexactly solving linear systems

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Related Items

Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization, SPEX Left LU

Uses Software

• AMD
• COLAMD
• FFLAS-FFPACK
• FLINT
• Givaro
• gmp
• LinBox
• Magma
• NTL
• UMFPACK
• SCIP
• MPFR
• SoPlex
• SuiteSparse
• SparseMatrix
• QSopt_ex
• mctoolbox
• QSopt-Exact
• Xyce
• KLU
• SuiteSparseQR
• SPQR_RANK
• COLMOD
• MC21A
• kepler98
• Algorithm 529

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matrix computations.
• Exact solution of linear equations using p-adic expansions
• The Magma algebra system. I: The user language
• Exact arithmetic at low cost. -- A case study in linear programming
• Fraction free Gaussian elimination for sparse matrices
• Exact solutions to linear programming problems
• A proof of the Kepler conjecture
• Roundoff-Error-Free Algorithms for Solving Linear Systems via Cholesky and LU Factorizations
• Algorithm 907
• Solving Very Sparse Rational Systems of Equations
• Computing the Crosscap Number of a Knot Using Integer Programming and Normal Surfaces
• Algorithm 933
• The Lanczos Algorithm With Partial Reorthogonalization
• MPFR
• Matrix Analysis
• Solving sparse linear equations over finite fields
• Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
• A generalized envelope method for sparse factorization by rows
• Accuracy and Stability of Numerical Algorithms
• Exact Solution of Sparse Linear Systems via Left-Looking Roundoff-Error-Free LU Factorization in Time Proportional to Arithmetic Work
• Algorithm 832
• Algorithm 836
• Algorithm 837
• Systems of distinct representatives and linear algebra
• Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
• A survey of direct methods for sparse linear systems
• Fast Library for Number Theory: An Introduction
• Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization
• Benchmarking optimization software with performance profiles.