Approximation characteristics for diagonal operators in different computational settings

Authors:
Fang Gensun;Qian Lixin
Affiliations:
School of Mathematical Sciences, Beijing Normal University, Beijing 100875, China;School of Mathematical Sciences, Beijing Normal University, Beijing 100875, China
Venue:
Journal of Approximation Theory
Year:
2006

Citing 5
Cited 1

Information-based complexity

Information-based complexity
s-numbers in information-based complexity

Journal of Complexity
Optimal linear randomized methods for linear operators in Hilbert spaces

Journal of Complexity
Lower bounds for the complexity of Monte Carlo function approximation

Journal of Complexity
Optimal approximation of elliptic problems by linear and nonlinear mappings I

Journal of Complexity - Special issue: Algorithms and complexity for continuous problems Schloss Dagstuhl, Germany, September 2004

Exact value of the n-term approximation of a diagonal operator

Journal of Approximation Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

First we study several extremal problems on minimax, and prove that they are equivalent. Then we connect this result with the exact values of some approximation characteristics of diagonal operators in different settings, such as the best n-term approximation, the linear average and stochastic n-widths, and the Kolmogorov and linear n-widths. Most of these exact values were known before, but in terms of equivalence of these extremal problems, we present a unified approach to give them a direct proof.