Univariate amenable functions
Abstract
The concepts of amenable and compatible functions have been introduced in a recent work, in order to state precise mathematical theorems that guarantee that a backward stable algorithm is also forward stable, and that the composition of two stable algorithms results in an stable algorithm. In this work, we elaborate in this theory for univariate real analytic functions, providing simple tests for both concepts and producing tables for a number of elementary functions which are or fail to be amenable.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.