Skip to content
DraconiticResearch
Search Sources API
186,125 studies31 sourcesUpdated 47 min ago
PreprintarXiv licencearXiv

Implict-Explicit Runge-Kutta schemes for geometric flows

Abstract

We propose a one-step implicit-explicit (IMEX) Runge-Kutta framework for high-order time integration of geometric flows. Starting from the Dziuk and Deckelnick-Dziuk parametric finite element formulations of curve shortening flow, we recast the spatially semidiscrete equations as systems of ordinary differential equations and construct second- and third-order schemes. Each stage requires only a linear solve. The key ingredient is a reduced-coefficient structure that allows the variational problem at each stage to be posed on the geometry generated by the preceding stage. The Runge-Kutta stages thus supply the required prediction geometry without a separate prediction procedure. The resulting schemes require no additional starting values. The framework also extends directly to the Barrett-Garcke-Nürnberg formulations of mean curvature flow and surface diffusion for curves and surfaces. Numerical experiments support the designed orders of temporal convergence and indicate that suitable coefficient choices yield mesh quality comparable to that of the corresponding first-order methods.

Related

  1. Average Energy Dissipation Rates of Implicit-Explicit Runge-Kutta Methods for Gradient Flow Problems
    Hong-lin Liao, Xuping Wang, Cao Wen
    CSIAM Transactions on Applied MathematicsPeer-reviewedLicence not stated6 citedNumerical analysis & scientific computingOpenAlex
  2. Order Reduction of Exponential Runge--Kutta Methods: Fourth-Order Schemes for Non-Commuting Operators
    Thi Tam Dang, Pablo Alexei Gazca-Orozco, Trung Hau Hoang
    arXivPreprintCC BY-NC-ND 4.0Full textNumerical analysis & scientific computingarXiv
  3. Decoupled energy-stable Runge-Kutta schemes of arbitrary order for the anisotropic phase-field dendritic crystal growth model
    Weiwen Wang, Shaoqin Zheng
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  4. Runge--Kutta-Aligned Oscillation Elimination: Restoring Superconvergence for Fully Discrete Shock-Capturing DG Schemes
    Manting Peng, Zhuoyun Li, Kailiang Wu
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingComputational physicsarXiv
  5. High-Order BUG Dynamical Low-Rank Integrators Based on Explicit Runge-Kutta Methods.
    Fabio Nobile, Sébastien Riffaud
    Journal of scientific computingPeer-reviewedCC BYFull text7 citedNumerical analysis & scientific computingEurope PMCOpenAlex
BibTeX
@misc{jiang2026implictexplicit,
  title = {{Implict-Explicit Runge-Kutta schemes for geometric flows}},
  author = {Wei Jiang and Chunmei Su and Kaike Tang},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.08019},
  eprint = {2610.08019},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.08019},
}
RIS
TY  - UNPB
TI  - Implict-Explicit Runge-Kutta schemes for geometric flows
AU  - Wei Jiang
AU  - Chunmei Su
AU  - Kaike Tang
PY  - 2026
DA  - 2026/10/06
PB  - arXiv
DO  - 10.48550/arxiv.2610.08019
UR  - https://arxiv.org/abs/2610.08019
AB  - We propose a one-step implicit-explicit (IMEX) Runge-Kutta framework for high-order time integration of geometric flows. Starting from the Dziuk and Deckelnick-Dziuk parametric finite element formulations of curve shortening flow, we recast the spatially semidiscrete equations as systems of ordinary differential equations and construct second- and third-order schemes. Each stage requires only a linear solve. The key ingredient is a reduced-coefficient structure that allows the variational problem at each stage to be posed on the geometry generated by the preceding stage. The Runge-Kutta stages thus supply the required prediction geometry without a separate prediction procedure. The resulting schemes require no additional starting values. The framework also extends directly to the Barrett-Garcke-Nürnberg formulations of mean curvature flow and surface diffusion for curves and surfaces. Numerical experiments support the designed orders of temporal convergence and indicate that suitable coefficient choices yield mesh quality comparable to that of the corresponding first-order methods.
ER  -