Adaptive approximations by greedy algorithms

  • Albert Cohen

    Université Pierre et Marie Curie, Paris, France
Adaptive approximations by greedy algorithms cover
Download Chapter PDF

A subscription is required to access this book chapter.

Abstract

We consider two problems of nonlinear approximation: adaptive triangulations and best N-term approximations. For both problems we present simple greedy algorithms which aim to provide near-optimal solutions at a reasonable computational cost. We also present several results on the convergence rate of these algorithms.