Abstract
In this paper, we give some optimal algorithms for diagonal operator T from space l p (1 ≦ p ≦ 2) to l 2 on n-widths in different computational setting.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Chen, G. G. and Fang, G. S., Probabilistic and Average Widths of Multivariate Sobolev Spaces with Mixed Derivative Equipped with the Gaussian Measure, J. Complexity, 6(2004), 858–875.
Fang, G. S., Fang, G. S. and Ye, P. X., Probabilistic and average Linear widths of Sobolev with Gaussian measure, J. of Complexity, 19(2003), 73–84.
Fang, G. S. and Ye, P. X., Probabilistic and Average Linear Widths of Sobolev Space with Gaussian Measure in L∞-norm, Constr. Approx, 20(2004), 159–172.
Fang, G. S. and Qian, L. X., Approximation Characteristics for Diagonal Operators in Different Computational Settings, J. Approx. Theory, 140(2006), 178–190.
Kolmogorov, A. N., Über die deste Annäherung von Funktionen Einer Gegebehen Funktionenklasse, Ann. Math., 37(1936), 107 (in Russian).
Lorentz, G. G., Golischek, M. V. and Makovoz, Y., Constructive Approximation, Springer-Verlage, New York, 1993.
Maiorov, V. E., Discretisation of a Problem About n-widths, Uspekhi Mat. Nauk, 30(1976), 179–180.
Maiorov, V. E., Kolmogorov’s (n, δ)-widths of the Spaces of the Smooth Functions, Russian Acad. Sci. Sb. Math., 79(1994), 265–279.
Mathé, P., Random Approximation of Sobolev Embeddings, J. Complexity, 7(1991), 261–281.
Novak, E., Optimal Linear Randomized Methods of Linear Operators in Hilbert Spaces, J. Complexity, 8(1992), 22–36.
Pietsch, A., Operator Ideals, North-Holland, Amsterdam, 1980.
Pinkus, A., n-Widths in Approximation Theory, Springer-Verlag, New York, 1985.
Sun, Y. S., Theory of Approximation, Vol.1, Beijing Normal University Press, Beijing, 1989 (in Chinese).
Sun, Y. S. and Fang, G. S., Theory of Approximation, Vol. 2, Beijing Normal University Press, Beijing, 1990 (in Chinese).
Sun, Y. S., Average n-width of Point Set in Hilbert Space, Chinese. Sci. Bull., 37(1992), 1153–1157.
Sun, Y. S., Estimation of Widths for a Besov Class of Multivariate Periodic Functions, Chinese. Sci. Bull., 39(1994), 2113–2115 (in Chinese).
Sun, Y. S., Some Remarks on the Paper Approximative Characteristics of the Space S pϕ of Stepanets, preprint, 2000.
Temlyakov, V. N., Approximation of Periodic Functions, Nova Science, New York, 1993.
Traub, J. F., Wasilkowski G. W. and Woźniakowski, H., Information-Based Complexity, Academic Press, New York, 1988.
Author information
Authors and Affiliations
Additional information
Supported by the Natural Science Foundation of China(Grant No. 10671019) and Research Fund for the Doctoral Program Higher Education (No. 20050027007).
Rights and permissions
About this article
Cite this article
Fang, G., Qian, L. Optimal algorithms for diagonal operators on N-widths in different computational setting. Analys in Theo Applic 23, 180–187 (2007). https://doi.org/10.1007/s10496-007-0180-z
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10496-007-0180-z