{"title":"A Unified Framework on the Original Energy Laws of Three Effective Classes of Runge–Kutta Methods for Phase Field Crystal Type Models","authors":"Xuping Wang, Xuan Zhao, Hong-lin Liao","doi":"10.1137/24m1701770","DOIUrl":null,"url":null,"abstract":"SIAM Journal on Numerical Analysis, Volume 63, Issue 4, Page 1808-1832, August 2025. <br/> Abstract. The main theoretical obstacle to establishing the original energy dissipation laws of Runge–Kutta methods for phase field equations is verifying the maximum norm boundedness of the stage solutions without assuming global Lipschitz continuity of the nonlinear bulk. We present a unified theoretical framework for the energy stability of three effective classes of Runge–Kutta methods, including the additive implicit-explicit Runge–Kutta, explicit exponential Runge–Kutta, and corrected integrating factor Runge–Kutta methods, for the Swift–Hohenberg and phase field crystal models. By the standard discrete energy argument, it is proven that the three classes of Runge–Kutta methods preserve the original energy dissipation law if the associated differentiation matrices are positive definite. Our main tools include the differential form with the associated differentiation matrix, the discrete orthogonal convolution kernel, and the principle of mathematical induction. Many existing Runge–Kutta methods in the literature are revisited by evaluating the lower bound on the minimum eigenvalues of the associated differentiation matrices. Our theoretical approach paves a new way toward the internal nonlinear stability of Runge–Kutta methods for dissipative semilinear parabolic problems.","PeriodicalId":49527,"journal":{"name":"SIAM Journal on Numerical Analysis","volume":"15 1","pages":""},"PeriodicalIF":2.9000,"publicationDate":"2025-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM Journal on Numerical Analysis","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1137/24m1701770","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
SIAM Journal on Numerical Analysis, Volume 63, Issue 4, Page 1808-1832, August 2025. Abstract. The main theoretical obstacle to establishing the original energy dissipation laws of Runge–Kutta methods for phase field equations is verifying the maximum norm boundedness of the stage solutions without assuming global Lipschitz continuity of the nonlinear bulk. We present a unified theoretical framework for the energy stability of three effective classes of Runge–Kutta methods, including the additive implicit-explicit Runge–Kutta, explicit exponential Runge–Kutta, and corrected integrating factor Runge–Kutta methods, for the Swift–Hohenberg and phase field crystal models. By the standard discrete energy argument, it is proven that the three classes of Runge–Kutta methods preserve the original energy dissipation law if the associated differentiation matrices are positive definite. Our main tools include the differential form with the associated differentiation matrix, the discrete orthogonal convolution kernel, and the principle of mathematical induction. Many existing Runge–Kutta methods in the literature are revisited by evaluating the lower bound on the minimum eigenvalues of the associated differentiation matrices. Our theoretical approach paves a new way toward the internal nonlinear stability of Runge–Kutta methods for dissipative semilinear parabolic problems.
期刊介绍:
SIAM Journal on Numerical Analysis (SINUM) contains research articles on the development and analysis of numerical methods. Topics include the rigorous study of convergence of algorithms, their accuracy, their stability, and their computational complexity. Also included are results in mathematical analysis that contribute to algorithm analysis, and computational results that demonstrate algorithm behavior and applicability.