Speeding up Newton-type iterations for stiff problems

摘要

Iterative schemes based on the Cooper and Butcher iteration [5] are considered, in order to implement highly implicit Runge–Kutta methods on stiff problems. By introducing two appropriate parameters in the scheme, a new iteration making use of the last two iterates, is proposed. Specific schemes of this type for the Gauss, Radau IA-IIA and Lobatto IIIA-B-C processes are developed. It is also shown that in many situations the new iteration presents a faster convergence than the original.