Exactly Solving Sparse Rational Linear Systems via Roundoff-Error-Free Cholesky Factorizations

DOI10.1137/20M1371592zbMath1492.65106OpenAlexW4220829346WikidataQ114074149 ScholiaQ114074149MaRDI QIDQ5071429

Erick Moreno-Centeno, Christopher J. Lourenco

Publication date: 21 April 2022

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/20m1371592

zbMATH Keywords

Cholesky factorizationexact factorizationsparse matrix algorithms

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Roundoff error (65G50) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (max. 100)

Exact QR factorizations of rectangular matrices

Uses Software

• AMD
• gmp
• MA57
• CHOLMOD
• SparseMatrix
• mctoolbox
• Eigen
• CSparse

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Componentwise perturbation bounds for some matrix decompositions
• A note on rounding-error analysis of Cholesky factorization
• Fraction free Gaussian elimination for sparse matrices
• Computational problems associated with Racah algebra
• Fast multiplication of large numbers
• Roundoff-Error-Free Algorithms for Solving Linear Systems via Cholesky and LU Factorizations
• Direct Methods for Sparse Matrices
• On the Minimum FLOPs Problem in the Sparse Cholesky Factorization
• The university of Florida sparse matrix collection
• The Use of Linear Graphs in Gauss Elimination
• Refined Error Analyses of Cholesky Factorization
• Direct Methods for Sparse Linear Systems
• A compact row storage scheme for Cholesky factors using elimination trees
• General Sparse Elimination Requires No Permanent Integer Storage
• Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
• Algorithms and software for in-core factorization of sparse symmetric positive definite matrices
• Algorithms and Data Structures for Sparse Symmetric Gaussian Elimination
• Computing the Minimum Fill-In is NP-Complete
• A generalized envelope method for sparse factorization by rows
• Solution of Dense Linear Systems via Roundoff-Error-Free Factorization Algorithms
• An Approximate Minimum Degree Ordering Algorithm
• 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
• MA57---a code for the solution of sparse symmetric definite and indefinite systems
• Algorithm 837
• Systems of distinct representatives and linear algebra
• Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
• Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations
• Computational Solutions of Matrix Problems Over an Integral Domain
• Benchmarking optimization software with performance profiles.

This page was built for publication: Exactly Solving Sparse Rational Linear Systems via Roundoff-Error-Free Cholesky Factorizations