Yumiao Li , Tiegang Liu , Kui Cao , Weixiong Yuan , Yin Yang
{"title":"可压缩Navier-Stokes方程的显-隐-零时间离散化直接不连续Galerkin方法","authors":"Yumiao Li , Tiegang Liu , Kui Cao , Weixiong Yuan , Yin Yang","doi":"10.1016/j.jcp.2025.114362","DOIUrl":null,"url":null,"abstract":"<div><div>In this paper, we discuss the direct discontinuous Galerkin (DDG) method combined with two specific high-order explicit-implicit-null (EIN) time discretizations for solving the compressible Navier-Stokes (CNS) equations. This paper presents the EIN method whose basic idea is to add and subtract an identical Laplacian operator on the right-hand side of the considered equations, and then apply the implicit-explicit (IMEX) time-marching method to the equivalent equations. More specifically, the added term is treated implicitly while the rest of the terms are treated explicitly. The EIN method is designed to eliminate the severe time step restriction associated with explicit methods, without requiring any nonlinear iterative solver. Based on the Fourier method, we analyze the stability of the EIN-DDG schemes for the one-dimensional CNS equations, and further validate numerically that the stability criteria can be extended to the two-dimensional case. The numerical results demonstrate that our schemes achieve both stability and optimal orders of accuracy under a relaxed time-step restriction, provided that an appropriate coefficient is used for the Laplacian operator. Furthermore, the computational efficiency of different time discretizations, such as the strong stability-preserving Runge-Kutta (SSP-RK) and EIN methods, is evaluated and compared, demonstrating the advantages of the proposed schemes.</div></div>","PeriodicalId":352,"journal":{"name":"Journal of Computational Physics","volume":"542 ","pages":"Article 114362"},"PeriodicalIF":3.8000,"publicationDate":"2025-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The direct discontinuous Galerkin method with explicit-implicit-null time discretizations for the compressible Navier-Stokes equations\",\"authors\":\"Yumiao Li , Tiegang Liu , Kui Cao , Weixiong Yuan , Yin Yang\",\"doi\":\"10.1016/j.jcp.2025.114362\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>In this paper, we discuss the direct discontinuous Galerkin (DDG) method combined with two specific high-order explicit-implicit-null (EIN) time discretizations for solving the compressible Navier-Stokes (CNS) equations. This paper presents the EIN method whose basic idea is to add and subtract an identical Laplacian operator on the right-hand side of the considered equations, and then apply the implicit-explicit (IMEX) time-marching method to the equivalent equations. More specifically, the added term is treated implicitly while the rest of the terms are treated explicitly. The EIN method is designed to eliminate the severe time step restriction associated with explicit methods, without requiring any nonlinear iterative solver. Based on the Fourier method, we analyze the stability of the EIN-DDG schemes for the one-dimensional CNS equations, and further validate numerically that the stability criteria can be extended to the two-dimensional case. The numerical results demonstrate that our schemes achieve both stability and optimal orders of accuracy under a relaxed time-step restriction, provided that an appropriate coefficient is used for the Laplacian operator. Furthermore, the computational efficiency of different time discretizations, such as the strong stability-preserving Runge-Kutta (SSP-RK) and EIN methods, is evaluated and compared, demonstrating the advantages of the proposed schemes.</div></div>\",\"PeriodicalId\":352,\"journal\":{\"name\":\"Journal of Computational Physics\",\"volume\":\"542 \",\"pages\":\"Article 114362\"},\"PeriodicalIF\":3.8000,\"publicationDate\":\"2025-09-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Computational Physics\",\"FirstCategoryId\":\"101\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0021999125006448\",\"RegionNum\":2,\"RegionCategory\":\"物理与天体物理\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational Physics","FirstCategoryId":"101","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0021999125006448","RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
The direct discontinuous Galerkin method with explicit-implicit-null time discretizations for the compressible Navier-Stokes equations
In this paper, we discuss the direct discontinuous Galerkin (DDG) method combined with two specific high-order explicit-implicit-null (EIN) time discretizations for solving the compressible Navier-Stokes (CNS) equations. This paper presents the EIN method whose basic idea is to add and subtract an identical Laplacian operator on the right-hand side of the considered equations, and then apply the implicit-explicit (IMEX) time-marching method to the equivalent equations. More specifically, the added term is treated implicitly while the rest of the terms are treated explicitly. The EIN method is designed to eliminate the severe time step restriction associated with explicit methods, without requiring any nonlinear iterative solver. Based on the Fourier method, we analyze the stability of the EIN-DDG schemes for the one-dimensional CNS equations, and further validate numerically that the stability criteria can be extended to the two-dimensional case. The numerical results demonstrate that our schemes achieve both stability and optimal orders of accuracy under a relaxed time-step restriction, provided that an appropriate coefficient is used for the Laplacian operator. Furthermore, the computational efficiency of different time discretizations, such as the strong stability-preserving Runge-Kutta (SSP-RK) and EIN methods, is evaluated and compared, demonstrating the advantages of the proposed schemes.
期刊介绍:
Journal of Computational Physics thoroughly treats the computational aspects of physical problems, presenting techniques for the numerical solution of mathematical equations arising in all areas of physics. The journal seeks to emphasize methods that cross disciplinary boundaries.
The Journal of Computational Physics also publishes short notes of 4 pages or less (including figures, tables, and references but excluding title pages). Letters to the Editor commenting on articles already published in this Journal will also be considered. Neither notes nor letters should have an abstract.