2000 character limit reached
On greedy approximation in complex Banach spaces
Published 6 Aug 2024 in math.FA, cs.NA, and math.NA | (2408.03214v2)
Abstract: The general theory of greedy approximation with respect to arbitrary dictionaries is well developed in the case of real Banach spaces. Recently, some of results proved for the Weak Chebyshev Greedy Algorithm (WCGA) in the case of real Banach spaces were extended to the case of complex Banach spaces. In this paper we extend some of known in the real case results for other than WCGA greedy algorithms to the case of complex Banach spaces.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.