High-order Crank-Nicolson method via diagonal Padé factorization
We present a numerical method to solve the time-dependent Schrödinger equation at arbitrary order of accuracy in the time step, particularly well suited for tridiagonal Hamilton operators. The method is based on a factorization of the diagonal Padé approximants of the matrix exponential into products of linear factors, which preserves tridiagonal matrix structure at every time step and yields a propagator of order 2q in the time step at a cost of O(qN) operations. The propagator is exactly unitary by construction, and at lowest order q=1 it reduces to the standard Crank-Nicolson algorithm. We further extend the method to any Hamiltonian admitting a decomposition into a sum of tridiagonal or diagonal operators via high-order split-operator techniques (McLachlan, 2022), retaining O(qN) scaling at each time step. We also analytically show and numerically verify that the precision is dictated by the split-operator method. This covers a broad range of physically relevant cases, including higher-dimensional systems, higher-order spatial discretizations, and non-separable potentials.
Authors
- Richard Taïeb (ORCID: https://orcid.org/0000-0001-6301-6008)
- Jérémie Caillat (ORCID: https://orcid.org/0000-0002-1975-6356)
- Lou Freschi (ORCID: https://orcid.org/0000-0002-2460-295X)
- Camille Lévêque
- Jonathan Dubois
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-11-16
- DOI
- https://doi.org/10.48550/arxiv.2611.20800
- Primary Topic
- Numerical Solvers for Ordinary Differential Equations
- Type
- preprint