Weak greedy algorithms[*]This research was supported by National Science Foundation Grant DMS 9970326 and by ONR Grant N00014-96-1-1003.

Author： Temlyakov V.N.  

Publisher： Springer Publishing Company

ISSN： 1019-7168

Source： Advances in Computational Mathematics, Vol.12, Iss.2-3, 2000-02, pp. : 213-227

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Polynomial interpolation in several variables, cubature formulae, and ideals[*]Supported by the National Science Foundation under Grant DMS-9802265.

By Xu Yuan  

Advances in Computational Mathematics, Vol. 12, Iss. 4, 2000-03 ,pp. : 363-376

Springer Publishing Company

Access to resources Recommend Favorite

Simultaneous approximation by greedy algorithms

By Leviatan D.   Temlyakov V.  

Advances in Computational Mathematics, Vol. 25, Iss. 1-3, 2006-07 ,pp. : 73-90

Springer Publishing Company

Access to resources Recommend Favorite

Vector greedy algorithms

By Lutoborski A.   Temlyakov V.N.  

Journal of Complexity, Vol. 19, Iss. 4, 2003-08 ,pp. : 458-473

Elsevier

Access to resources Recommend Favorite

The best m-term approximation and greedy algorithms

By Temlyakov V.N.  

Advances in Computational Mathematics, Vol. 8, Iss. 3, 1998-04 ,pp. : 249-265

Springer Publishing Company

Access to resources Recommend Favorite

Performance comparisons of greedy algorithms in compressed sensing

By  

NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS (ELECTRONIC), Vol. 22, Iss. 2, 2015-03 ,pp. : 254-282

John Wiley & Sons Inc

Access to resources Recommend Favorite