Roundoff-Error-Free Algorithms for Solving Linear Systems via Cholesky and LU Factorizations

  title={Roundoff-Error-Free Algorithms for Solving Linear Systems via Cholesky and LU Factorizations},
  author={Adolfo R. Escobedo and Erick Moreno-Centeno},
  journal={INFORMS J. Comput.},
LU and Cholesky factorizations are computational tools for efficiently solving linear systems that play a central role in solving linear programs and several other classes of mathematical programs. In many documented cases, however, the roundoff errors accrued during the construction and implementation of these factorizations lead to the misclassification of feasible problems as infeasible and vice versa. Hence, reducing these roundoff errors or eliminating them altogether is imperative to… 
Foundational Factorization Algorithms for the Efficient Roundoff-Error-Free Solution of Optimization Problems
This work introduces two roundoff-error-free factorizations (REF) constructed exclusively in integer arithmetic: the REF LU and Cholesky factorizations and develops supplementary integer-preserving substitution algorithms, thereby providing a complete tool set for solving systems of linear equations exactly and efficiently.
Fast and Exact Matrix Factorization Updates for Nonlinear Programming
A novel approach for solving sequences of closely related SLEs encountered in nonlinear programming efficiently and without roundoff errors is introduced, and the length of any coefficient calculated via the associated algorithms is bounded polynomially in the size of the inputs without having to resort to greatest common divisor operations.
Solution of Dense Linear Systems via Roundoff-Error-Free Factorization Algorithms
This article develops and analyzes an efficient streamlined version of Edmonds’s Q-matrix approach that can be implemented as another basic solution validation approach and demonstrates that the REF factorization framework outperforms this alternative integer-preserving approach in terms of memory requirements and computational effort.
Algorithm 1XXX: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-Looking Integer-Preserving LU Factorization
It is shown that SPEX Left LU outperforms the exact iterativesolvers in run time on easy instances and in stability as the iterative solver fails on a sizeable subset of the tested (both easy and hard) instances.
Exact Solution of Sparse Linear Systems via Left-Looking Roundoff-Error-Free LU Factorization in Time Proportional to Arithmetic Work
The roundoff-error-free (REF) LU factorization, along with the REF forward and backward substitution algorithms, allows a rational system of linear equations to be solved exactly and efficiently. T...
Linear Programming Using Limited-Precision Oracles
This paper introduces the idea of a limited-precision LP oracle and study how such an oracle could be used within a larger framework to compute exact precision solutions to LPs.
Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates
The roundoff-error-free (REF) LU and Cholesky factorizations, combined with the REF substitution algorithms, allow rational systems of linear equations to be solved exactly and efficiently by worki...
Linear programming using limited-precision oracles
This paper introduces the idea of a limited-precision LP oracle and study how such an oracle could be used within a larger framework to compute exact precision solutions to LPs.


Fraction-free matrix factors: new forms for LU and QR factors
The new output format for fraction free LU factoring and for QR factoring is given, which contains smaller entries than previously suggested forms, and it avoids the gcd computations required by some other partially fraction free computations.
On Wiedemann's Method of Solving Sparse Linear Systems
Douglas Wiedemann’s (1986) landmark approach to solving sparse linear systems over finite fields provides the symbolic counterpart to non-combinatorial numerical methods for solving sparse linear
An algorithm to solve integer linear systems exactly using numerical methods
  • Z. Wan
  • Computer Science, Mathematics
    J. Symb. Comput.
  • 2006
Fraction-free algorithms for linear and polynomial equations
Algorithms are presented for fraction-free LU "factorization" of a matrix and for fractions-free algorithms for both forward and back substitution for solving systems of polynomial equations.
Improving the accuracy of linear programming solvers with iterative refinement
An iterative refinement procedure for computing extended precision or exact solutions to linear programming problems (LPs) that leads to direct improvement of the best known methods for solving LPs exactly over the rational numbers.
Solving Very Sparse Rational Systems of Equations
This work considers a test set of instances arising from exact-precision linear programming and uses this test set to compare the performance of several techniques designed for symbolic sparse linear-system solving.
Exact solution of linear equations usingP-adic expansions
SummaryA method is described for computing the exact rational solution to a regular systemAx=b of linear equations with integer coefficients. The method involves: (i) computing the inverse (modp) ofA
Sylvester’s identity and multistep integer-preserving Gaussian elimination
A method is developed which permits integer-preserving elimination in systems of linear equations, AX = B, such that (a) the magnitudes of the coefficients in the transformed matrices are minimized,
On the worst-case complexity of integer Gaussian elimination
It is shown that there is an exponential length lower bound on the operands for a well-deflned variant of Gaussian elimination when applied to Smith and Hermite normal form calculation, and the analysis provides guidance as to how integer matrix algorithms based onGaussian elimination may be further developed for better performance.
Exact Solution of Linear Equations Using P-Adie Expansions*
For matrices A and b with entries of bounded size and dimensions n x n and n x 1, this method can be implemented in time O(n3(logn) 2) which is better than methods previously used.