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 h.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.