Exactly solving sparse rational linear systems via roundoff-error-free Cholesky factorizations
From MaRDI portal
Recommendations
- Exact solution of sparse linear systems via left-looking roundoff-error-free Lu factorization in time proportional to arithmetic work
- Solution of dense linear systems via roundoff-error-free factorization algorithms. Theoretical connections and computational comparisons
- Roundoff-error-free algorithms for solving linear systems via Cholesky and LU factorizations
- Solving sparse rational linear systems
- Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates
Cites work
- scientific article; zbMATH DE number 3816913 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 3313812 (Why is no real title available?)
- A compact row storage scheme for Cholesky factors using elimination trees
- A generalized envelope method for sparse factorization by rows
- A note on rounding-error analysis of Cholesky factorization
- Accuracy and Stability of Numerical Algorithms
- Algorithm 837
- Algorithms and Data Structures for Sparse Symmetric Gaussian Elimination
- Algorithms and software for in-core factorization of sparse symmetric positive definite matrices
- An Approximate Minimum Degree Ordering Algorithm
- Benchmarking optimization software with performance profiles.
- Componentwise perturbation bounds for some matrix decompositions
- Computational Solutions of Matrix Problems Over an Integral Domain
- Computational problems associated with Racah algebra
- Computing the Minimum Fill-In is NP-Complete
- Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations
- Direct Methods for Sparse Linear Systems
- Direct methods for sparse matrices
- Exact solution of sparse linear systems via left-looking roundoff-error-free Lu factorization in time proportional to arithmetic work
- Fast multiplication of large numbers
- Fraction free Gaussian elimination for sparse matrices
- General Sparse Elimination Requires No Permanent Integer Storage
- MA57---a code for the solution of sparse symmetric definite and indefinite systems
- On the minimum FLOPs problem in the sparse Cholesky factorization
- Refined Error Analyses of Cholesky Factorization
- Roundoff-error-free algorithms for solving linear systems via Cholesky and LU factorizations
- Solution of dense linear systems via roundoff-error-free factorization algorithms. Theoretical connections and computational comparisons
- 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 University of Florida sparse matrix collection
- The Use of Linear Graphs in Gauss Elimination
Cited in
(10)- On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
- Exact solution of sparse linear systems via left-looking roundoff-error-free Lu factorization in time proportional to arithmetic work
- Algorithm 1050: SPEX Cholesky, LDL, and backslash for exactly solving sparse linear systems
- Roundoff-error-free algorithms for solving linear systems via Cholesky and LU factorizations
- Expediting exact linear programming solvers via integer preserving factorization
- RCHOL: Randomized Cholesky Factorization for Solving SDD Linear Systems
- Solution of dense linear systems via roundoff-error-free factorization algorithms. Theoretical connections and computational comparisons
- Exact Matrix Factorization Updates for Nonlinear Programming
- Exact QR factorizations of rectangular matrices
- Roundoff-error-free QR factorization via integer-preserving Gram Schmidt orthogonalization
This page was built for publication: Exactly solving sparse rational linear systems via roundoff-error-free Cholesky factorizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5071429)
