Abstract
Abstract : This thesis presents two algorithms for the computation of smooth piecewise polynomial approximations which are adaptive in nature and which are based upon results from uniform approximation theory. It also presents a discussion of existing algorithms for computing uniform approximations, uniform approximations with interpolatory constraints, and restricted range uniform approximation. Finally, numerical testing of our two algorithms is reported and suggestions offered for their effective use.
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.
