LU factorization with errors - Archive ouverte HAL Access content directly
Conference Papers Year :

LU factorization with errors

Abstract

We present new algorithms to detect and correct errors in the lower-upper factorization of a matrix, or the triangular linear system solution, over an arbitrary field. Our main algorithms do not require any additional information or encoding other than the original inputs and the erroneous output. Their running time is softly linear in the dimension times the number of errors when there are few errors, smoothly growing to the cost of fast matrix multiplication as the number of errors increases. We also present applications to general linear system solving.
Fichier principal
Vignette du fichier
lu-errors.pdf (518.33 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01997592 , version 1 (29-01-2019)

Identifiers

Cite

Jean-Guillaume Dumas, Joris van Der Hoeven, Clément Pernet, Daniel S. Roche. LU factorization with errors. International Symposium on Symbolic and Algebraic Computation - ISSAC'19, Jul 2019, Beijing, China. pp.131-138, ⟨10.1145/3326229.3326244⟩. ⟨hal-01997592⟩
241 View
922 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More