Extremal Problems of Approximation Theory

By R. Trigub, Eduard S. Bellinsky. 2004

92 citations recorded by the source corpus.

Subfields: Applied Mathematics, Numerical Analysis, Statistics and Probability

View Paper: https://www.semanticscholar.org/paper/6ecc1864b05caeda578772f927a58c204e873110

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Applied Mathematics

1. Vladimir N. Temlyakov
2. Stephen J. Dilworth
3. Nigel J. Kalton
4. Denka Kutzarova
5. Loukas Grafakos
6. A. Dalet

In Numerical Analysis

1. Vladimir N. Temlyakov

In Statistics and Probability

1. Vladimir N. Temlyakov
2. Stephen J. Dilworth
3. Nigel J. Kalton
4. Denka Kutzarova
5. Loukas Grafakos

Citations in the corpus

• The Thresholding Greedy Algorithm, Greedy Bases, and Duality (2003, background): “[7]), there exists x∗ ∈ [ej ]j∈A with ‖x∗‖ = 1 and (5.”