Fraction free Gaussian elimination for sparse matrices

DOI10.1006/jsco.1995.1022zbMath0838.68048OpenAlexW2059204145MaRDI QIDQ1904132

B. David Saunders, Hong R. Lee

Publication date: 27 May 1996

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/e15d218d96b434cb63daf248328ba50daba970e9

zbMATH Keywords

Gaussian elimination

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Basic linear algebra (15A99)

Related Items (9)

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 ⋮ Generalized fraction-free \(LU\) factorization for singular systems with kernel extraction ⋮ Roundoff-Error-Free Algorithms for Solving Linear Systems via Cholesky and LU Factorizations ⋮ Complete integration-by-parts reductions of the non-planar hexagon-box via module intersections ⋮ Exact Solution of Sparse Linear Systems via Left-Looking Roundoff-Error-Free LU Factorization in Time Proportional to Arithmetic Work ⋮ Common factors in fraction-free matrix decompositions ⋮ Heuristics to sift extraneous factors in Dixon resultants

This page was built for publication: Fraction free Gaussian elimination for sparse matrices