Cohen, Albert:
Greedy Algorithms for Adaptive Approximation
Bollettino dell'Unione Matematica Italiana Serie 9 2 (2009), fasc. n.2, p. 391-402, (English)
pdf (1.85 MB), djvu (168 Kb). | MR 2537277 | Zbl 1171.65009
Sunto
We discuss the performances of greedy algorithms for two problems of numerical approximation. The first one is the best approximation of an arbitrary function by an N-terms linear combination of simple functions adaptively picked within a large dictionary. The second one is the approximation of an arbitrary function by a piecewise polynomial function on an optimally adapted triangulation of cardinality N. Performance is measured in terms of convergence rate with respect to the number of element in the dictionary in the first case and of triangles in the second case.
Referenze Bibliografiche
[1]
V. BABENKO -
Y. BABENKO -
A. LIGUN -
A. SHUMEIKO,
On Asymptotical Behavior of the Optimal Linear Spline Interpolation Error of $C^{2}$ Functions,
East J. Approx.,
12(1) (
2006), 71-101. |
MR 2294672[3]
A. BARRON -
A. COHEN -
W. DAHMEN -
R. DEVORE,
Approximation and learning by greedy algorithms, to appear in
Annals of Statistics (
2007). |
fulltext (doi) |
MR 2387964[4] J. BERGH - J. LÖFSTRÖM, Interpolation spaces, Springer Verlag, Berlin, 1976.
[6]
H. BOROUCHAKI -
P. J. FREY -
P. L. GEORGE -
P. LAUG -
E. SALTEL,
Mesh generation and mesh adaptivity: theory, techniques, in
Encyclopedia of computational mechanics,
E. Stein,
R. de Borst and
T. J. R. Hughes ed.,
John Wiley & Sons Ltd.,
2004. |
fulltext (doi) |
MR 2288277[7]
L. CHEN -
P. SUN -
J. XU,
Optimal anisotropic meshes for minimizing interpolation error in $L^{p}$-norm,
Math. of Comp.,
76 (
2007), 179-204. |
fulltext (doi) |
MR 2261017 |
Zbl 1106.41013[8]
A. COHEN -
W. DAHMEN -
I. DAUBECHIES -
R. DEVORE,
Tree-structured approximation and optimal encoding,
App. Comp. Harm. Anal.,
11 (
2001), 192-226. |
fulltext (doi) |
MR 1848303 |
Zbl 0992.65151[9]
A. COHEN -
N. DYN -
F. HECHT -
J. M. MIREBEAU,
Adaptive multiresolution analysis based on anisotropic triangulations, preprint, Laboratoire J.-L. Lions,
2008. |
fulltext (doi) |
MR 3474490[14]
A. C. GILBERT -
J. A. TROPP,
Signal recovery from random measurements via Orthogonal Matching Pursuit,
IEEE Trans. Info. Theory,
53 (
2007), 4655-4666. |
fulltext (doi) |
MR 2446929 |
Zbl 1288.94022[15]
L. K. JONES,
A simple lemma on greedy approximation in Hilbert spaces and convergence rates for projection pursuit regression and neural network training,
Ann. Stat.,
20 (
1992), 608-613. |
fulltext (doi) |
MR 1150368 |
Zbl 0746.62060[16]
S. V. KONYAGIN -
V. N. TEMLYAKOV,
Rate of convergence of Pure greedy Algorithm,
East J. Approx. 5 (
1999), 493-499. |
MR 1738484 |
Zbl 1101.41309[20] V. TEMLYAKOV, Greedy algorithms, to appear in Acta Numerica.
[21]
R. VERFURTH,
A Review of A Posteriori Error Estimation and Adaptive Mesh-Refinement Techniques,
Wiley-Teubner,
1996. |
Zbl 0853.65108