Methods without saturation in computational mathematics
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.
saturability, unsaturability, saturation class, saturation threshold, saturation order
Publication language:russian, pages:40
Mathematical modelling in actual problems of science and technics