New conditions for the convergence of a weak greedy algorithm

DOI10.1134/S0001434624090165MaRDI QIDQ7016952zbMATH OpenFDO

Authors Dmitry Gorbachev, A. P. Solodov

Publication date 6 March 2025

Published in Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S0001434624090165

zbMATH Keywords

\(m\)-term approximationquasi-monotone sequenceweak greedy algorithm

Mathematics Subject Classification ID

Approximation by arbitrary linear expressions (41A45) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Numerical integration (65D30) Numerical solutions to equations with nonlinear operators (65J15)

Review text

In this article there is developed the solution of the problem of \(m\)-term approximation of an arbitrary element \(f_0\in H\)\quad(\(H\)) is Hilbert space) on a normalized subset \(D\) where linear space \(D\) is dense in \(H\).

Cites work

• A criterion for convergence of weak greedy algorithms
• On convergence of weak greedy algorithms
• Weak greedy algorithms

This page was built for publication: New conditions for the convergence of a weak greedy algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7016952)