Explicit Adaptive Time Stepping for the Cahn–Hilliard Equation by Exponential Krylov Subspace and Chebyshev Polynomial Methods

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.

Authors

Institutions

Publication Details

Journal
Lobachevskii Journal of Mathematics
Published
2025-09-01
DOI
https://doi.org/10.1134/s1995080225610811
Primary Topic
Numerical methods for differential equations
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Explicit Adaptive Time Stepping for the Cahn–Hilliard Equation by Exponential Krylov Subspace and Chebyshev Polynomial Methods

M. A. Botchev
Lobachevskii Journal of Mathematics
Numerical methods for differential equations
article

Explicit Adaptive Time Stepping for the Cahn–Hilliard Equation by Exponential Krylov Subspace and Chebyshev Polynomial Methods

M. A. Botchev
article en

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.

Lobachevskii Journal of MathematicsVol. 46(9)
Keldysh Institute of Applied Mathematics (RU)
Openalex Percentile: Top 23%
Numerical methods for differential equations
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.