Comparison of pure greedy algorithm with pure greedy algorithm in a pair of dictionaries

DOI10.3103/S0027132223020055MaRDI QIDQ6115272

Anastasia S. Orlova

Publication date: 12 July 2023

Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)

zbMATH Keywords

convergenceconvergence ratepure greedy algorithmpure greedy algorithm in pair of dictionaries

Mathematics Subject Classification ID

Fourier series in special orthogonal functions (Legendre polynomials, Walsh functions, etc.) (42C10) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Summability and bases; functional analytic aspects of frames in Banach and Hilbert spaces (46B15)

Cites Work

• Properties of orthorecursive expansions over nonorthogonal systems
• Some remarks on greedy algorithms
• Weak limits of consecutive projections and of greedy steps
• Greedy Approximation

This page was built for publication: Comparison of pure greedy algorithm with pure greedy algorithm in a pair of dictionaries