Greedy approximation by arbitrary sets

DOI10.1070/IM8891zbMath1471.41014OpenAlexW2973288087MaRDI QIDQ5112463

P. A. Borodin

Publication date: 29 May 2020

Published in: Izvestiya: Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1070/im8891

zbMATH Keywords

Hilbert spacegreedy approximationdensity of a semigroup

Mathematics Subject Classification ID

Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)

Related Items (4)

Condition of coincidence between greedy approximations and \(m\)-term ones ⋮ Weak limits of consecutive projections and of greedy steps ⋮ Weak convergence of a greedy algorithm and the WN-property ⋮ Example of divergence of a greedy algorithm with respect to an asymmetric dictionary

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On \(n\)-term approximation with positive coefficients
• On a conjecture of Huber concerning the convergence of projection pursuit regression
• Geometry of Banach spaces. Selected topics
• Approximation by simple fractions
• Approximation properties of the most simple fractions
• Asymptotically neutral distributions of electrons and polynomial approximation
• Approximation by simple partial fractions with constraints on the poles. II
• Greedy Approximation
• Density of a semigroup in a Banach space
• A criterion for the best uniform approximation by simple partial fractions in terms of alternance. II

This page was built for publication: Greedy approximation by arbitrary sets