The concept of sequential optimality for problems in numerical analysis
The author defines the concept of sequential optimality for the worst- case analysis of approximately solved problems. A class of sequentially optimal algorithms for the numerical integration of monotonic functions is described. Extensions to more general settings are indicated.
numerical integration of monotonic functions
scientific article; zbMATH DE number 4039145