Abstract
We introduce the concept of informativeness of a continuous functional on a metric spaceX with respect to a setM⊂X and a metric ρx. We pose the problem of finding the most informative functional. For some sets of continuous functions, this problem is solved by reduction to a subset of functionals given by the value of a function at a certain point.
Similar content being viewed by others
References
G. G. Lorentz,Approximation of Functions, Holt, Rinehart, and Winston, New York (1966).
V. M. Tikhomirov,Some Problems in the Theory of Approximation [in Russian], Moscow University, Moscow (1976).
N. P. Korneichuk,Extremum Problems in the Theory of Approximation [in Russian], Nauka, Moscow (1976).
A. Pinkus,N-widths in Approximation Theory, Springer, Berlin (1985).
N. P. Korneichuk,Exact Constants in the Theory of Approximation [in Russian], Nauka, Moscow (1987).
J. Traub and 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. 46, No. 9, pp. 1156–1163, September, 1994.
Rights and permissions
About this article
Cite this article
Korneichuk, N.P. Informativeness of functionals. Ukr Math J 46, 1272–1279 (1994). https://doi.org/10.1007/BF01059418
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01059418