Some remarks on greedy algorithms

被引：360

作者：

DeVore, RA ^{[1
]}

Temlyakov, VN ^{[1
]}

机构：

[1] UNIV S CAROLINA,DEPT MATH,COLUMBIA,SC 29208

来源：

ADVANCES IN COMPUTATIONAL MATHEMATICS | 1996年 / 5卷 / 2-3期

关键词：

D O I：

10.1007/BF02124742

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Estimates are given for the rate of approximation of a function by means of greedy algorithms. The estimates apply to approximation from an arbitrary dictionary of functions. Three greedy algorithms are discussed: the Pure Greedy Algorithm, an Orthogonal Greedy Algorithm, and a Relaxed Greedy Algorithm.

引用

页码：173 / 187

页数：15

共 8 条

[1] UNIVERSAL APPROXIMATION BOUNDS FOR SUPERPOSITIONS OF A SIGMOIDAL FUNCTION [J].