Abstract
The existence of a function for which the greedy algorithm in the Faber-Schauder system is divergent in measure on is established. It is shown that for each , , there exists a measurable subset of of measure such that for each one can find a function coinciding with on , whose greedy algorithm in the Faber-Schauder system converges uniformly on . Bibliography: 33 titles.
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.
