When can forward stable algorithms be composed stably?

DOI10.1093/IMANUM/DRAD026MaRDI QIDQ6629603zbMATH OpenFDO

Authors Carlos Beltrán, Vanni Noferini, Nick Vannieuwenhoven

Publication date 30 October 2024

Published in IMA Journal of Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/IMANUM/DRAD026

zbMATH Keywords

amenabilitycomposition theoremcondition numbernumerical algorithmnumerical stabilityrelative error

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Recommendations

• On the numerical stability of algorithmic differentiation
• Notes on the classification of numerical algorithms with respect to their stability to roundoff errors
• Stability aspects in using parallel algorithms
• Graphs and stability of algorithms
• Fast linear algebra is stable

Cited in

(3)

• Mixed precision iterative refinement for low-rank matrix and tensor approximations
• Complete decomposition of symmetric tensors in linear time and polylogarithmic precision
• A chiseling algorithm for low-rank Grassmann decomposition of skew-symmetric tensors

This page was built for publication: When can forward stable algorithms be composed stably?

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