Abstract
New algorithms are presented for computing verified error bounds for least squares problems and underdetermined linear systems. In contrast to previous approaches the new methods do not rely on normal equations and are applicable to sparse matrices. Computational results demonstrate that the new methods are faster than existing ones.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.