Abstract
This paper deals with starting algorithms for Newton-type schemes for solving the stage equations of implicit s-stages Runge–Kutta methods applied to stiff problems. We present a family of starting algorithms with orders from 0 to s+1 and, with estimations of the error in these algorithms, we give a technique for selecting, at each step, the most convenient in the family. The proposed algorithms, that can be expressed in terms of divided differences, are based on the Lagrange interpolation of the stages of the last two integration steps. We also analyse the orders of the starting algorithms for the non-stiff case, for the Prothero and Robinson model and the stiff order. Finally, by means of some numerical experiments we show that this technique allows, in general, to greatly improve the performance of implicit Runge–Kutta methods on stiff problems.
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.
