Greedy approximation - Open Access .click

Advances in Computational Mathematics, 2010
The authors present the properties of basis which are important for certain direct and inverse theorems in nonlinear approximation. They study greedy approximation with regard to the basis with different properties. Some results known for unconditional bases are extended to the case of quasi-greedy bases.
V N Temlyakov, Mingrui Yang, Peixin Ye
exaly +2 more sources

Approximation of Reset Thresholds with Greedy Algorithms

Fundamenta Informaticae, 2016
The problem of approximate computation of reset thresholds of synchronizing automata has gained a lot of attention recently. We introduce a broad class of algorithms that compute reset words and analyze their approximation ratios. We present three series of automata that reveal inherent limitations of greedy strategies for approximation of reset ...
Dimitry S. Ananichev, Vladimir V. Gusev
openaire +3 more sources

Greedy in Approximation Algorithms

, 2006
The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k-extendible systems, a natural generalization of matroids, and show that a greedy algorithm is a 1/k-factor approximation for these systems.
Julián Mestre
openaire +2 more sources

greedy algorithm
fos: mathematics
greedy algorithms

approximation algorithms
fos: computer and information sciences
convergence

numerical analysis math.na
mathematics - numerical analysis
dictionary