Approximation of the Crank–Nicholson method by the iterated dynamic-theta method Original Research Article

Choptuikʹs iterated Crank–Nicholson method has become a popular algorithm for solving partial differential equations in computational physics. We generalize Choptuikʹs explicit iteration approach to implicit finite difference schemes, by the introduction of a novel method with an iteration step dependent parameter and analyze its stability and computational efficiency.