Scholarlink

Abstract <p>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.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

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

  • 期刊论文

  • 发表日期：

    2025年9月1日

查看全文
  • M. A. Botchev

摘要

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.