In 1963, H.H. Rosenbrock (Some general implicit processes for the numerical solution of differential equations. Computer J., vol. 5, pp. 329-330) first presented such a methodology. The general format for the Rosenbrock methods is shown below:


With

Rosenbrock methods are sometimes referred to as higher order RK methods (ref: Butcher, Numerical Methods for ODEs) since it follows the step-wise implementation of implicit Runge Kutta algorithms, while avoiding the Newton iterations at each step. The superior performance of Rosenbrock algorithms comes into play while solving stiff differential equations.
[…] matrix A is the same as the one defined earlier. The step-by-step process (which is similar to the generalized RK methods) can be summarized […]
ReplyDelete