Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization
From MaRDI portal
(Redirected from Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization)
Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization
Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization
Cites work
- A generalized envelope method for sparse factorization by rows
- A proof of the Kepler conjecture
- A survey of direct methods for sparse linear systems
- Accuracy and Stability of Numerical Algorithms
- Algorithm 832
- Algorithm 836
- Algorithm 837
- Algorithm 907
- Algorithm 933
- 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.
- Computing the crosscap number of a knot using integer programming and normal surfaces
- Exact and fast algorithms for mixed-integer nonlinear programming
- Exact arithmetic at low cost. -- A case study in linear programming
- Exact solution of linear equations using p-adic expansions
- Exact solution of sparse linear systems via left-looking roundoff-error-free Lu factorization in time proportional to arithmetic work
- Exact solutions to linear programming problems
- Fast Library for Number Theory: An Introduction
- Fraction free Gaussian elimination for sparse matrices
- scientific article; zbMATH DE number 1253981 (Why is no real title available?)
- scientific article; zbMATH DE number 1860706 (Why is no real title available?)
- Matrix Analysis
- Matrix computations.
- MPFR
- Roundoff-error-free algorithms for solving linear systems via Cholesky and LU factorizations
- Solving sparse linear equations over finite fields
- Solving very sparse rational systems of equations
- Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
- Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
- Systems of distinct representatives and linear algebra
- The Lanczos Algorithm With Partial Reorthogonalization
- The Magma algebra system. I: The user language
Cited in
(4)- Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization
- SPEX Left LU
- Algorithm 1050: SPEX Cholesky, LDL, and backslash for exactly solving sparse linear systems
- Expediting exact linear programming solvers via integer preserving factorization
Describes a project that uses
Uses Software
This page was built for publication: Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5883713)
