LU factorization with errors
From MaRDI portal
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.
Recommendations
Cited in
(7)- Efficiently correcting matrix products
- Efficiently correcting matrix products
- scientific article; zbMATH DE number 1735440 (Why is no real title available?)
- Fixed-parameter tractability of error correction in graphical linear systems
- Error correction in fast matrix multiplication and inverse
- Verifying the product of generalized Boolean matrix multiplication and its applications to detect small subgraphs
- Corrigimus, verificamus, vincimus: ensuring algorithmic accuracy in an age of uncertainty
This page was built for publication: LU factorization with errors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5120484)