This article is cited in 5 papers

Methods without saturation in computational mathematics

M. B. Gavrikov


Abstract: Mathematical constructions of the saturation phenomenon in approximation theory and numerical analysis are considered. There are analyzed the fundamental contribution of K.I. Babenko in the study of saturable and unsaturable computational algorithms. A modern definition of saturability is given and numerous examples of saturation studies in problems of approximation theory, the theory of quadrature formulas and numerical analysis are considered.

Keywords: saturability, unsaturability, saturation class, saturation threshold, saturation order.

DOI: 10.20948/prepr-2019-75

Bibliographic databases:

•