On a greedy algorithm in the space \(L_p[0,1]\)

DOI10.1134/S0001434609050162zbMath1184.46013MaRDI QIDQ1033990

E. D. Livshits

Publication date: 10 November 2009

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

convergencebest approximationgreedy algorithmsdictionary\(L_p\)

Mathematics Subject Classification ID

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) Approximation by other special function classes (41A30)

Related Items (1)

Approximation schemes satisfying Shapiro's theorem

Cites Work

• A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
• Convergence of the weak dual greedy algorithm in \(L_{p}\)-spaces.
• Greedy approximation

This page was built for publication: On a greedy algorithm in the space \(L_p[0,1]\)