On the Stability of the Iterated Crank-Nicholson Method in Numerical Relativity
classification
🌀 gr-qc
keywords
crank-nicholsoniterationsmethoditeratednumericalrelativityalgorithmarises
read the original abstract
The iterated Crank-Nicholson method has become a popular algorithm in numerical relativity. We show that one should carry out exactly two iterations and no more. While the limit of an infinite number of iterations is the standard Crank-Nicholson method, it can in fact be worse to do more than two iterations, and it never helps. We explain how this paradoxical result arises.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.