Abstract
The one-step finite-difference methods of the previous chapter, with the possible exception of the trapezoidal rule method, are basically rather too uneconomic for general use. Their local truncation error is of rather low order, with the result that to achieve good accuracy we need to use either: (a) a rather small step-by-step interval, involving many steps to cover a specified range; or (b) one of our correcting devices which involve some additional computation and more computer programming. The special one-step methods of the previous chapter, the Taylor series method and the explicit Runge-Kutta methods, do not share these disadvantages, but they involve extra computer storage, the Taylor series method involves a possibly large amount of non-automatic differentiation, and with the Runge—Kutta methods we have to compute possibly rather complicated expressions several times in each step. Moreover, both these methods have rather poor partial stability properties.
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.
