Convergence of orthogonal greedy algorithm with errors in projectors

被引:0
|
作者
Fedotov N.N. [1 ]
机构
[1] Faculty of Mechanics and Mathematics, Moscow State University, Leninskie Gory, Moscow
关键词
Greedy Algorithm; Computational Error; Greedy Expansion; Orthogonal Greedy Algorithm;
D O I
10.3103/S0027132213010075
中图分类号
学科分类号
摘要
A model of orthogonal greedy algorithm is proposed. This model allows one to consider computational errors and to study the stability of this algorithm with respect to errors in projections onto subspaces. A criterion for the convergence of orthogonal greedy expansion to the expanded element is given in terms of computational errors. © 2013 Allerton Press, Inc.
引用
收藏
页码:37 / 41
页数:4
相关论文
共 50 条