Abstract
We find an estimate for the nth minimal error of linear algorithms for some problem defined in a finite-dimensional space with values in an arbitrary normed vector space.
Similar content being viewed by others
References
Traub J. F. and Wozniakowski H., A General Theory of Optimal Algorithms [Russian translation], Mir, Moscow (1983).
Sidorov S. P., “An estimate of the nth minimal error of linear algorithms for an approximation problem,” Zh. Vychisl. Mat. i Mat. Fiziki, 44, No.6, 997–1001 (2004).
Sidorov S. P., “On some extremal properties of Lagrange interpolatory polynomials,” J. Approx. Theory, 118, No.1, 188–201 (2002).
Akhiezer N. I., Lectures on Approximation Theory [in Russian], Nauka, Moscow (1965).
Tikhomirov V. M., “The widths of the sets in a function space and the theory of the best approximations,” Uspekhi Mat. Nauk, 15, No.3, 81–120 (1960).
Author information
Authors and Affiliations
Additional information
Original Russian Text Copyright © 2005 Sidorov S. P.
The author was supported by the Russian Foundation for Basic Research (Grant 04-01-00060), the State Maintenance Programs for the Leading Scientific Schools of the Russian Federation (Grant 1295.2003.1), and the Program “ Universities of Russia” (Grant 04.01.374).
__________
Translated from Sibirskii Matematicheskii Zhurnal, Vol. 46, No. 3, pp. 673–678, May–June, 2005.
Rights and permissions
About this article
Cite this article
Sidorov, S.P. An Estimate for the nth Minimal Error of Linear Algorithms for One Problem in a Normed Vector Space. Sib Math J 46, 535–539 (2005). https://doi.org/10.1007/s11202-005-0055-5
Received:
Issue Date:
DOI: https://doi.org/10.1007/s11202-005-0055-5