✍ Scribed by Dexuan Xie
No coin nor oath required. For personal study only.
Implicit Runge-Kutta (IRK) methods (such as the s-stage Radau IIA method with s = 3, 5, or 7) for solving stiff ordinary differential equation systems have excellent stability properties and high solution accuracy orders, but their high computing costs in solving their nonlinear stage equations have seriously limited their applications to large scale problems. To reduce such a cost, several approximate Newton algorithms were developed, including a commonly used one called the simplified Newton method. In this paper, a new approximate Jacobian matrix and two new test rules for controlling the updating of approximate Jacobian matrices are proposed, yielding an improved approximate Newton method. Theoretical and numerical analysis show that the improved approximate Newton method can significantly improve the convergence and performance of the simplified Newton method.
📜 SIMILAR VOLUMES
In this paper, we investigate the positivity property for a class of 2-stage explicit Runge-Kutta (RK2) methods of order two when applied to the numerical solution of special nonlinear initial value problems (IVPs) for ordinary differential equations (ODEs). We also pay particular attention to monot