Abstract
In this paper we study greedy approximation in Banach spaces. We discuss a modification of the Weak Chebyshev Greedy Algorithm, in which steps of the algorithm can be executed imprecisely. Such inaccuracies are represented by both absolute and relative errors, which provides more flexibility for numerical applications. We obtain the conditions on the error parameters that guarantee convergence of the algorithm in all uniformly smooth Banach spaces and prove that these conditions are sharp. Additionally, we discuss the conditions that need to be imposed on a Banach space to guarantee convergence of the Chebyshev Greedy Algorithm, and construct a smooth Banach space in which the algorithm diverges.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
