Abstract
We consider passive and active algorithms of reconstruction of functions, satisfying the condition |f(t′)−f(t″)|≤|t′−t″|α,0<α≤1, according to their valuesf(t) at the points of the interval [a, b]. An active algorithm is presented which guarantees, for monotonic functions from the above-mentioned class with 0<α<1, a higher order of error inC [a, b] than can be attained by any passive algorithm.
Similar content being viewed by others
References
N. P. Korneichuk,Extremal Problems in the Approximation Theory [in Russian], Nauka, Moscow (1976).
V. M. Tikhomirov,Some Problems of the Approximation Theory [in Russian], Moscow University, Moscow (1976).
N. P. Korneichuk,Exact Constants in the Approximation Theory [in Russian], Nauka, Moscow (1987).
A. G. Sukharev,Minimax Algorithms in the Problems of Numerical Analysis [in Russian], Nauka, Moscow (1989).
J. Traub, H. Wozniakowski,General Theory of Optimal Algorithms [Russian translation], Mir, Moscow (1983).
J. Traub, G. Wasilkowski, and H. Wozniakowski,Information, Uncertainty, and Complexity [Russian translation], Mir, Moscow (1988).
Author information
Authors and Affiliations
Additional information
Translated from Ukrainskii Matematicheskii ZhurnaL, Vol. 45, No. 2, pp. 258–264, February, 1993.
Rights and permissions
About this article
Cite this article
Korneichuk, N.P. On passive and active algorithms of reconstruction of functions. Ukr Math J 45, 277–283 (1993). https://doi.org/10.1007/BF01060984
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01060984