Solution of Dense Linear Systems via Roundoff-Error-Free Factorization Algorithms

DOI10.1145/3199571zbMath1484.65053OpenAlexW2808963723WikidataQ113310083 ScholiaQ113310083MaRDI QIDQ4611310

Christopher J. Lourenco, Adolfo R. Escobedo, Erick Moreno-Centeno

Publication date: 18 January 2019

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3199571

zbMATH Keywords

roundoff errorsdense linear systemsexact linear programming

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (2)

Exactly Solving Sparse Rational Linear Systems via Roundoff-Error-Free Cholesky Factorizations ⋮ Exact Solution of Sparse Linear Systems via Left-Looking Roundoff-Error-Free LU Factorization in Time Proportional to Arithmetic Work

This page was built for publication: Solution of Dense Linear Systems via Roundoff-Error-Free Factorization Algorithms