Roundoff-error-free algorithms for solving linear systems via Cholesky and LU factorizations
DOI10.1287/IJOC.2015.0653zbMATH Open1337.65025OpenAlexW2209734631WikidataQ114058191 ScholiaQ114058191MaRDI QIDQ2802247FDOQ2802247
Adolfo R. Escobedo, Erick Moreno-Centeno
Publication date: 25 April 2016
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/30d7b1ce78a453fd91e9c1c8451528ae55e6e98c
Recommendations
- Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates
- Exact solution of sparse linear systems via left-looking roundoff-error-free Lu factorization in time proportional to arithmetic work
- Exactly solving sparse rational linear systems via roundoff-error-free Cholesky factorizations
- Forward roundoff error analysis of the LU and Cholesky factorizations
- Solution of dense linear systems via roundoff-error-free factorization algorithms. Theoretical connections and computational comparisons
computational complexityCholesky factorizationexact algorithmsmatrix factorizationsLU factorizationroundoff errorsexact mathematical programmingsolving linear systems
Direct numerical methods for linear systems and matrix inversion (65F05) Complexity and performance of numerical algorithms (65Y20) Roundoff error (65G50)
Cites Work
- Fast multiplication of large numbers
- Exact solution of linear equations using p-adic expansions
- Solving sparse linear equations over finite fields
- Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
- The final NETLIB-LP results
- An algorithm to solve integer linear systems exactly using numerical methods
- Distributed matrix-free solution of large sparse linear systems over finite fields
- Safe bounds in linear and mixed-integer linear programming
- Solving sparse rational linear systems
- Rational solutions of singular linear systems
- Systems of distinct representatives and linear algebra
- Title not available (Why is that?)
- Exact solutions to linear programming problems
- How Tight is Hadamard's Bound?
- Fraction free Gaussian elimination for sparse matrices
- Computational Solutions of Matrix Problems Over an Integral Domain
- Title not available (Why is that?)
- Analysis of Algorithms, A Case Study: Determinants of Matrices with Polynomial Entries
- Note sur les $Q$-matrices d’Edmonds
- Improving the accuracy of linear programming solvers with iterative refinement
- Solving Very Sparse Rational Systems of Equations
Cited In (6)
- Linear programming using limited-precision oracles
- Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization
- Exactly Solving Sparse Rational Linear Systems via Roundoff-Error-Free Cholesky Factorizations
- Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates
- Exact QR factorizations of rectangular matrices
- Exact Solution of Sparse Linear Systems via Left-Looking Roundoff-Error-Free LU Factorization in Time Proportional to Arithmetic Work
Uses Software
This page was built for publication: Roundoff-error-free algorithms for solving linear systems via Cholesky and LU factorizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802247)
