Abstract
The problem of numerical differentiation for non-periodic bivariate functions is investigated. For the recovering mixed derivatives of such functions an approach on the base of truncation method is proposed. The constructed algorithms deal with Legendere polynomials, the degree of which is chosen so as to minimize the approximation error. It is established that these algorithms are order-optimal both in terms of accuracy and in the sense of the amount of Galerkin information involved.
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.
