Search

The iterated Crank-Nicolson (ICN) method is a successful numerical algorithm in numerical relativity for solving partial differential equations. The $\theta$-ICN method is the extension of the original ICN method where $\theta$ is the weight when averaging the predicted and corrected values. It has better stability when $\theta$ is chosen to be larger than 0.5, but the accuracy is reduced since the $\theta$-ICN method is second order accurate only when $\theta$ = 0.5. In this paper, we propose two modified $\theta$-ICN algorithms that have second order of convergence rate when $\theta$ is not 0.5, based on two different ways to choose the weight $\theta$. The first approach employs two geometrically averaged $\theta$s in two iterations within one time step, and the second one uses arithmetically averaged $\theta$s for two consecutive time steps while $\theta$ remains the same in each time step. The stability and second order accuracy of our methods are verified using stability and truncation error analysis and are demonstrated by numerical examples on linear and semi-linear hyperbolic partial differential equations and Burgers' equation.