When can forward stable algorithms be composed stably?

Abstract

We state some widely satisfied hypotheses, depending only on two functions $g$ and $h$, under which the composition of a stable algorithm for $g$ and a stable algorithm for $h$ is a stable algorithm for the composition $g\circ h$.

References in corpus (3)

• Tensors in computations
• Pencil-based algorithms for tensor rank decomposition are not stable
• A theory of NP-completeness and ill-conditioning for approximate real computations

Cited by in corpus (2)

• Bean: A Language for Backward Error Analysis
• Complete Decomposition of Symmetric Tensors in Linear Time and Polylogarithmic Precision