Explicit adaptive time stepping for the Cahn-Hilliard equation by exponential Krylov subspace and Chebyshev polynomial methods
Numerical Analysis
2025-02-21 v1 Computational Engineering, Finance, and Science
Numerical Analysis
Computational Physics
Abstract
The Cahn-Hilliard equation has been widely employed within various mathematical models in physics, chemistry and engineering. Explicit stabilized time stepping methods can be attractive for time integration of the Cahn-Hilliard equation, especially on parallel and hybrid supercomputers. In this paper, we propose an exponential time integration method for the Cahn-Hilliard equation and describe its efficient Krylov subspace based implementation. We compare the method to a Chebyshev polynomial local iteration modified (LIM) time stepping scheme. Both methods are explicit (i.e., do not involve linear system solution) and tested with both constant and adaptively chosen time steps.
Keywords
Cite
@article{arxiv.2502.14589,
title = {Explicit adaptive time stepping for the Cahn-Hilliard equation by exponential Krylov subspace and Chebyshev polynomial methods},
author = {Mike A. Botchev},
journal= {arXiv preprint arXiv:2502.14589},
year = {2025}
}
Comments
22 pages, 12 figures