Approximate Weak Greedy Algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Advances in Computational Mathematics Année : 2001

Approximate Weak Greedy Algorithms

Rémi Gribonval
Morten Nielsen
  • Fonction : Auteur
  • PersonId : 884523

Résumé

We present a generalization of V. Temlyakov's weak greedy algorithm, and give a sufficient condition for norm convergence of the algorithm for an arbitrary dictionary in a Hilbert space. We provide two counter-examples to show that the condition cannot be relaxed for general dictionaries. For a class of dictionaries with more structure, we give a more relaxed necessary and sufficient condition for convergence of the algorithm. We also provide as detailed discussion of how a "real-world" implementation of the weak greedy algorithm, when one has to take into account floating point arithmetic and other types of finite precision errors, can be modeled by the new algorithm.
Fichier principal
Vignette du fichier
2001_ACM_GribonvalNielsen.pdf (9.49 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

inria-00576643 , version 1 (15-03-2011)

Identifiants

Citer

Rémi Gribonval, Morten Nielsen. Approximate Weak Greedy Algorithms. Advances in Computational Mathematics, 2001, 14 (4), pp.361-378. ⟨10.1023/A:1012255021470⟩. ⟨inria-00576643⟩
57 Consultations
59 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More