Abstract
A general algorithm for finding finite-difference approximations to derivatives is presented. The algorithm uses a linear combination of suitable Taylor expansions, and is sufficiently general to cater for non-equispaced nodes. It also provides analytical expressions for truncation and round-off errors.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Mathematical Education in Science and Technology
Disclaimer: 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.