Adaptive greedy techniques for approximate solution of large RBF systems

Numerical Algorithms

Volumn 24, Issue 3, 2000, Pages 239-254

  Schaback, Robert ^a   Wendland, Holger ^a  

^a UNIVERSITY OF GÖTTINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 23044522578     PISSN: 10171398     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (9)

1. G. Davis, S. Mallat and M. Avallaneda, Adaptive greedy approximations, Constr. Approx. 13 (1997) 737-785.
2. R.A. DeVore and V.N. Temlyakov, Some remarks on greedy algorithms, Adv. Comput. Math. 5 (1996) 173-187.
3. G. Fasshauer, C. Gartland and J. Jerome, Nash iteration as a computational tool for differential equations, Preprint (1999).
4. A. Faul and M.J.D. Powell, Proof of convergence of an iterative technique for thin-plate spline interpolation in two dimensions, Adv. Comput. Math. 11 (1999) 183-192.
5. L. Jones, A simple lemma on greedy approximation in Hubert space and convergence rates for projection pursuit regression and neural network training, Ann. Statist. 20 (1992) 608-613.
6. R. Schaback, Native spaces of radial basis functions I, in: New Developments in Approximation Theory, eds. M.W. Müller, M.D. Buhmann, D.H. Mache and M. Felten, International Series of Numerical Mathematics, Vol. 132 (Birkhäuser, Basel, 1999) pp. 255-282.
7. V.N. Temlyakov, The best m-term approximation and greedy algoriths, Adv. Comput. Math. 8 (1998) 249-265.
8. V.N. Temlyakov, Greedy algorithms and M-term approximation with regard to redundant dictionaries, J. Approx. Theory 98 (1999) 117-145.
9. www.math.nps.navy.mil/~rfranke.