Verification May be Better than Estimation

DOI10.1137/0917065zbMATH Open0858.65040OpenAlexW2059726238MaRDI QIDQ4891749FDOQ4891749

Authors:

Publication date: 25 March 1997

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0917065

Recommendations

• Tight enclosures of solutions of linear systems
• Computation of sharp rigorous componentwise error bounds for the approximate solutions of systems of linear equations
• Modified error bounds for approximate solutions of dense linear systems
• Fast verification of solutions of matrix equations
• Verified error bounds for linear systems through the Lanczos process

zbMATH Keywords

error boundscomputational performanceerror estimationlinear system\(H\)-matricesbackward error analysisnumerical librariesLAPACKITPACKerror verification

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Roundoff error (65G50) Iterative numerical methods for linear systems (65F10)

Cited In (2)

• Modified error bounds for approximate solutions of dense linear systems
• Computation of sharp rigorous componentwise error bounds for the approximate solutions of systems of linear equations

Uses Software

• LAPACK

This page was built for publication: Verification May be Better than Estimation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4891749)