8 citations · 25 across the 12 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
math.NA2025
On stability of Weak Greedy Algorithm in the presence of noise
V. N. Temlyakov
This paper is devoted to the theoretical study of the efficiency, namely, stability of some greedy algorithms. In the greedy approximation theory researchers are mostly interested…
math.NA2025
Brief introduction in greedy approximation
V. Temlyakov
Sparse approximation is important in many applications because of concise form of an approximant and good accuracy guarantees. The theory of compressed sensing, which proved to be…