We study the efficiency of greedy type algorithms with regard to redundant dictionaries in Hilbert space and we prove a general result which gives a sufficient condition on a dictionary to guarantee that the pure greedy algorithm is near best in the sense of power decay of error of approximation. We
Greedy Algorithms with Regard to Multivariate Systems with Special Structure
β Scribed by V. N. Temlyakov
- Publisher
- Springer
- Year
- 2000
- Tongue
- English
- Weight
- 156 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0176-4276
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
During one year's period bulk milk samples were collected monthly from three different types of farms: 1. conventional farming, indoor feeding with silages throughout the year, 2. conventional farming, grazing during summer season, 3 . ecological farming, grazing during summer season. The milk prote
## Abstract A chemical ant colony algorithm (CACA) with supramolecular coefficient __Ξ³__ was put forward. It has successfully solved the multivariate calibration issue of the supramolecule analysis system, and realized the pure spectra fitting and the simultaneous determination of the calix[n]arena