Notes on the classification of numerical algorithms with respect to their stability to roundoff errors

DOI10.1007/3-540-62598-4_139MaRDI QIDQ6560306zbMATH OpenFDO

Authors Plamen Yalamov

Publication date 21 June 2024

Full work available at URL https://doi.org/10.1007/3-540-62598-4_139

Mathematics Subject Classification ID

Roundoff error (65G50)

Recommendations

• Graphs and stability of algorithms
• scientific article; zbMATH DE number 150454
• scientific article; zbMATH DE number 4111908
• A model for understanding numerical stability
• Complexity estimates depending on condition and round-off error

Cited in

(1)

• When can forward stable algorithms be composed stably?

This page was built for publication: Notes on the classification of numerical algorithms with respect to their stability to roundoff errors

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