Greedy approximation by arbitrary sets

descriptionPublicationkeyboard_double_arrow_right Article 01 Apr 2020Publisher:Steklov Mathematical InstituteJournal:Izvestiya: Mathematics, volume 84, pages 246-261 (issn: 1064-5632,

Copyright policy )

Authors: Borodin, Pëtr A.;

doi: 10.1070/im8891

Greedy approximation by arbitrary sets

- Summary
- Subjects
- Metrics

Abstract

Abstract We define various algorithms for greedy approximations by elements of an arbitrary set in a Banach space. We study the convergence of these algorithms in a Hilbert space under various geometric conditions on . As a consequence, we obtain sufficient conditions for the additive semigroup generated by to be dense.

Related Organizations

Lomonosov Moscow State University
Russian Federation

Keywords

Abstract approximation theory (approximation in normed linear spaces and other abstract spaces), Hilbert space, greedy approximation, density of a semigroup

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	7
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%

Found an issue? Give us feedback

7

Top 10%

Fields of Science

Fields of Science

Upload OA version

Are you the author of this publication? Upload your Open Access version to Zenodo!

It’s fast and easy, just two clicks!

uploadUpload now