Pith. sign in

REVIEW 1 cited by

On the Stability of the Iterated Crank-Nicholson Method in Numerical Relativity

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv gr-qc/9909026 v1 pith:4V6CYXPO submitted 1999-09-07 gr-qc

Saul A. Teukolsky This is my paper · ORCID
classification gr-qc
keywords crank-nicholsoniterationsmethoditeratednumericalrelativityalgorithmarises
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Simulations of Magnetic Monopole Collisions

    hep-th 2025-02 conditional novelty 5.0 of 10

    Numerical field-theory simulations reproduce the predicted right-angle, 60-degree, and 45-degree scattering of BPS magnetic monopoles and show tetrahedral and cubic intermediate states.

Pith tools