Pub Date : 2025-01-24DOI: 10.1007/s10444-025-10219-x
Jianjian Song, Dongwoo Sheen, Xinlong Feng, Yinnian He
In this paper, a class of 3D elliptic equations is solved by using the combination of the finite difference method in one direction and nonconforming finite element methods in the other two directions. A finite-difference (FD) discretization based on (P_1)-element in the z-direction and a finite-element (FE) discretization based on (P_1^{NC})-nonconforming element in the (x, y)-plane are used to convert the 3D equation into a series of 2D ones. This paper analyzes the convergence of (P_1^{NC})-nonconforming finite element methods in the 2D elliptic equation and the error estimation of the ({H^1})-norm of the DFE method. Finally, in this paper, the DFE method is tested on the 3D elliptic equation with the FD method based on the (P_1) element in the z-direction and the FE method based on the Crouzeix-Raviart element, the (P_1) linear element, the Park-Sheen element, and the (Q_1) bilinear element, respectively, in the (x, y)-plane.
{"title":"A difference finite element method based on nonconforming finite element methods for 3D elliptic problems","authors":"Jianjian Song, Dongwoo Sheen, Xinlong Feng, Yinnian He","doi":"10.1007/s10444-025-10219-x","DOIUrl":"https://doi.org/10.1007/s10444-025-10219-x","url":null,"abstract":"<p>In this paper, a class of 3D elliptic equations is solved by using the combination of the finite difference method in one direction and nonconforming finite element methods in the other two directions. A finite-difference (FD) discretization based on <span>(P_1)</span>-element in the <i>z</i>-direction and a finite-element (FE) discretization based on <span>(P_1^{NC})</span>-nonconforming element in the (<i>x</i>, <i>y</i>)-plane are used to convert the 3D equation into a series of 2D ones. This paper analyzes the convergence of <span>(P_1^{NC})</span>-nonconforming finite element methods in the 2D elliptic equation and the error estimation of the <span>({H^1})</span>-norm of the DFE method. Finally, in this paper, the DFE method is tested on the 3D elliptic equation with the FD method based on the <span>(P_1)</span> element in the <i>z</i>-direction and the FE method based on the Crouzeix-Raviart element, the <span>(P_1)</span> linear element, the Park-Sheen element, and the <span>(Q_1)</span> bilinear element, respectively, in the (<i>x</i>, <i>y</i>)-plane.</p>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"44 1","pages":""},"PeriodicalIF":1.7,"publicationDate":"2025-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143027255","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-01-16DOI: 10.1007/s10444-024-10218-4
Mahadevan Ganesh, Stuart C. Hawkins, Darko Volkov
We introduce a new system of surface integral equations for Maxwell’s transmission problem in three dimensions (3-D). This system has two remarkable features, both of which we prove. First, it is well-posed at all frequencies. Second, the underlying linear operator has a uniformly bounded inverse as the frequency approaches zero, ensuring that there is no low-frequency breakdown. The system is derived from a formulation we introduced in our previous work, which required additional integral constraints to ensure well-posedness across all frequencies. In this study, we eliminate those constraints and demonstrate that our new self-adjoint, constraints-free linear system—expressed in the desirable form of an identity plus a compact weakly-singular operator—is stable for all frequencies. Furthermore, we propose and analyze a fully discrete numerical method for these systems and provide a proof of spectrally accurate convergence for the computational method. We also computationally demonstrate the high-order accuracy of the algorithm using benchmark scatterers with curved surfaces.
{"title":"An all-frequency stable integral system for Maxwell’s equations in 3-D penetrable media: continuous and discrete model analysis","authors":"Mahadevan Ganesh, Stuart C. Hawkins, Darko Volkov","doi":"10.1007/s10444-024-10218-4","DOIUrl":"10.1007/s10444-024-10218-4","url":null,"abstract":"<div><p>We introduce a new system of surface integral equations for Maxwell’s transmission problem in three dimensions (3-D). This system has two remarkable features, both of which we prove. First, it is well-posed at all frequencies. Second, the underlying linear operator has a uniformly bounded inverse as the frequency approaches zero, ensuring that there is no low-frequency breakdown. The system is derived from a formulation we introduced in our previous work, which required additional integral constraints to ensure well-posedness across all frequencies. In this study, we eliminate those constraints and demonstrate that our new self-adjoint, constraints-free linear system—expressed in the desirable form of an identity plus a compact weakly-singular operator—is stable for all frequencies. Furthermore, we propose and analyze a fully discrete numerical method for these systems and provide a proof of spectrally accurate convergence for the computational method. We also computationally demonstrate the high-order accuracy of the algorithm using benchmark scatterers with curved surfaces.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"51 1","pages":""},"PeriodicalIF":1.7,"publicationDate":"2025-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142986729","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-01-03DOI: 10.1007/s10444-024-10209-5
Tobias Long, Robert Barnett, Richard Jefferson-Loveday, Giovanni Stabile, Matteo Icardi
Problems with dominant advection, discontinuities, travelling features, or shape variations are widespread in computational mechanics. However, classical linear model reduction and interpolation methods typically fail to reproduce even relatively small parameter variations, making the reduced models inefficient and inaccurate. This work proposes a model order reduction approach based on the Radon Cumulative Distribution Transform (RCDT). We demonstrate numerically that this non-linear transformation can overcome some limitations of standard proper orthogonal decomposition (POD) reconstructions and is capable of interpolating accurately some advection-dominated phenomena, although it may introduce artefacts due to the discrete forward and inverse transform. The method is tested on various test cases coming from both manufactured examples and fluid dynamics problems.
{"title":"A reduced-order model for advection-dominated problems based on the Radon Cumulative Distribution Transform","authors":"Tobias Long, Robert Barnett, Richard Jefferson-Loveday, Giovanni Stabile, Matteo Icardi","doi":"10.1007/s10444-024-10209-5","DOIUrl":"10.1007/s10444-024-10209-5","url":null,"abstract":"<div><p>Problems with dominant advection, discontinuities, travelling features, or shape variations are widespread in computational mechanics. However, classical linear model reduction and interpolation methods typically fail to reproduce even relatively small parameter variations, making the reduced models inefficient and inaccurate. This work proposes a model order reduction approach based on the Radon Cumulative Distribution Transform (RCDT). We demonstrate numerically that this non-linear transformation can overcome some limitations of standard proper orthogonal decomposition (POD) reconstructions and is capable of interpolating accurately some advection-dominated phenomena, although it may introduce artefacts due to the discrete forward and inverse transform. The method is tested on various test cases coming from both manufactured examples and fluid dynamics problems.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"51 1","pages":""},"PeriodicalIF":1.7,"publicationDate":"2025-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142913015","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-01-02DOI: 10.1007/s10444-024-10217-5
Bo Feng, Gang Wu
The generalized Lanczos trust-region (GLTR) method is one of the most popular approaches for solving large-scale trust-region subproblem (TRS). In Jia and Wang, SIAM J. Optim., 31, 887–914 2021. Z. Jia et al. considered the convergence of this method and established some a priori error bounds on the residual and the Lagrange multiplier. In this paper, we revisit the convergence of the GLTR method and try to improve these bounds. First, we establish a sharper upper bound on the residual. Second, we present a non-asymptotic bound for the convergence of the Lagrange multiplier and define a factor that plays an important role in the convergence of the Lagrange multiplier. Third, we revisit the convergence of the Krylov subspace method for the cubic regularization variant of the trust-region subproblem and substantially improve the convergence result established in Jia et al., SIAM J. Matrix Anal. Appl. 43 (2022), pp. 812–839 2022 on the multiplier. Numerical experiments demonstrate the effectiveness of our theoretical results.
广义Lanczos信任域(GLTR)方法是求解大规模信任域子问题(TRS)最常用的方法之一。在贾和王,SIAM J.优化。中华医学杂志,31,887-914 2021。Z. Jia等人考虑了该方法的收敛性,在残差和拉格朗日乘子上建立了一些先验误差界。在本文中,我们重新审视了GLTR方法的收敛性,并尝试改进这些边界。首先,我们在残差上建立一个更清晰的上界。其次,给出了拉格朗日乘子收敛的非渐近界,并定义了一个在拉格朗日乘子收敛中起重要作用的因子。第三,我们重新审视了信赖域子问题三次正则化变体的Krylov子空间方法的收敛性,并大大改进了Jia et al., SIAM J. Matrix Anal中建立的收敛结果。应用程序43 (2022),pp. 812-839关于乘数2022。数值实验证明了理论结果的有效性。
{"title":"On convergence of the generalized Lanczos trust-region method for trust-region subproblems","authors":"Bo Feng, Gang Wu","doi":"10.1007/s10444-024-10217-5","DOIUrl":"10.1007/s10444-024-10217-5","url":null,"abstract":"<div><p>The generalized Lanczos trust-region (GLTR) method is one of the most popular approaches for solving large-scale trust-region subproblem (TRS). In Jia and Wang, <i>SIAM J. Optim., 31, 887–914</i> 2021. Z. Jia et al. considered the convergence of this method and established some <i>a priori</i> error bounds on the residual and the Lagrange multiplier. In this paper, we revisit the convergence of the GLTR method and try to improve these bounds. First, we establish a sharper upper bound on the residual. Second, we present a <i>non-asymptotic</i> bound for the convergence of the Lagrange multiplier and define a factor that plays an important role in the convergence of the Lagrange multiplier. Third, we revisit the convergence of the Krylov subspace method for the cubic regularization variant of the trust-region subproblem and substantially improve the convergence result established in Jia et al., <i>SIAM J. Matrix Anal. Appl. 43 (2022), pp. 812–839</i> 2022 on the multiplier. Numerical experiments demonstrate the effectiveness of our theoretical results.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"51 1","pages":""},"PeriodicalIF":1.7,"publicationDate":"2025-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142912941","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we introduce a novel unfitted finite element method to solve the quad-curl interface problem. We adapt Nitsche’s method for ({operatorname {curl}}{operatorname {curl}})-conforming elements and double the degrees of freedom on interface elements. To ensure stability, we incorporate ghost penalty terms and a discrete divergence-free term. We establish the well-posedness of our method and demonstrate an optimal error bound in the discrete energy norm. We also analyze the stiffness matrix’s condition number. Our numerical tests back up our theory on convergence rates and condition numbers.
{"title":"Unfitted finite element method for the quad-curl interface problem","authors":"Hailong Guo, Mingyan Zhang, Qian Zhang, Zhimin Zhang","doi":"10.1007/s10444-024-10213-9","DOIUrl":"10.1007/s10444-024-10213-9","url":null,"abstract":"<div><p>In this paper, we introduce a novel unfitted finite element method to solve the quad-curl interface problem. We adapt Nitsche’s method for <span>({operatorname {curl}}{operatorname {curl}})</span>-conforming elements and double the degrees of freedom on interface elements. To ensure stability, we incorporate ghost penalty terms and a discrete divergence-free term. We establish the well-posedness of our method and demonstrate an optimal error bound in the discrete energy norm. We also analyze the stiffness matrix’s condition number. Our numerical tests back up our theory on convergence rates and condition numbers.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"51 1","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142888189","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-18DOI: 10.1007/s10444-024-10216-6
Xiaojuan Liu, Maojun Li, Tao Yin, Shangyou Zhang
This paper studies the finite element method for solving the exterior Stokes problem in two dimensions. A nonlocal boundary condition is defined using a nonsingular-kernel Dirichlet-to-Dirichlet (DtD) mapping, which maps the Dirichlet data on an interior circle to the Dirichlet data on another circular artificial boundary based on the Poisson integral formula of the Stokes problem. The truncated problem is then solved using the MINI-element method and a simple DtD iteration strategy, resulting into a sequence of unique and geometrically (h- independent) convergent solutions. The quasi-optimal error estimate is proved for the iterative solution at the end of the iteration process. Numerical experiments are presented to demonstrate the accuracy and efficiency of the proposed method.
{"title":"A nonsingular-kernel Dirichlet-to-Dirichlet mapping method for the exterior Stokes problem","authors":"Xiaojuan Liu, Maojun Li, Tao Yin, Shangyou Zhang","doi":"10.1007/s10444-024-10216-6","DOIUrl":"10.1007/s10444-024-10216-6","url":null,"abstract":"<div><p>This paper studies the finite element method for solving the exterior Stokes problem in two dimensions. A nonlocal boundary condition is defined using a nonsingular-kernel Dirichlet-to-Dirichlet (DtD) mapping, which maps the Dirichlet data on an interior circle to the Dirichlet data on another circular artificial boundary based on the Poisson integral formula of the Stokes problem. The truncated problem is then solved using the MINI-element method and a simple DtD iteration strategy, resulting into a sequence of unique and geometrically (<i>h</i>- independent) convergent solutions. The quasi-optimal error estimate is proved for the iterative solution at the end of the iteration process. Numerical experiments are presented to demonstrate the accuracy and efficiency of the proposed method.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"51 1","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142841447","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-17DOI: 10.1007/s10444-024-10211-x
Ben S. Ashby, Tristan Pryer
In this article, we present a numerical method for the Stokes flow of an Oldroyd-B fluid. The viscoelastic stress evolves according to a constitutive law formulated in terms of the upper convected time derivative. A finite difference method is used to discretise along fluid trajectories to approximate the advection and deformation terms of the upper convected derivative in a simple, cheap and cohesive manner, as well as ensuring that the discrete conformation tensor is positive definite. A full implementation with coupling to the fluid flow is presented, along with a detailed discussion of the issues that arise with such schemes. We demonstrate the performance of this method with detailed numerical experiments in a lid-driven cavity setup. Numerical results are benchmarked against published data, and the method is shown to perform well in this challenging case.
{"title":"Discretisation of an Oldroyd-B viscoelastic fluid flow using a Lie derivative formulation","authors":"Ben S. Ashby, Tristan Pryer","doi":"10.1007/s10444-024-10211-x","DOIUrl":"10.1007/s10444-024-10211-x","url":null,"abstract":"<div><p>In this article, we present a numerical method for the Stokes flow of an Oldroyd-B fluid. The viscoelastic stress evolves according to a constitutive law formulated in terms of the upper convected time derivative. A finite difference method is used to discretise along fluid trajectories to approximate the advection and deformation terms of the upper convected derivative in a simple, cheap and cohesive manner, as well as ensuring that the discrete conformation tensor is positive definite. A full implementation with coupling to the fluid flow is presented, along with a detailed discussion of the issues that arise with such schemes. We demonstrate the performance of this method with detailed numerical experiments in a lid-driven cavity setup. Numerical results are benchmarked against published data, and the method is shown to perform well in this challenging case.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"51 1","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10444-024-10211-x.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142826394","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-13DOI: 10.1007/s10444-024-10212-w
Jan Giesselmann, Kiwoong Kwon
We provide a posteriori error estimates for a discontinuous Galerkin scheme for the parabolic-elliptic Keller-Segel system in 2 or 3 space dimensions. The estimates are conditional in the sense that an a posteriori computable quantity needs to be small enough—which can be ensured by mesh refinement—and optimal in the sense that the error estimator decays with the same order as the error under mesh refinement. A specific feature of our error estimator is that it can be used to prove the existence of a weak solution up to a certain time based on numerical results.
{"title":"A posteriori error control for a discontinuous Galerkin approximation of a Keller-Segel model","authors":"Jan Giesselmann, Kiwoong Kwon","doi":"10.1007/s10444-024-10212-w","DOIUrl":"10.1007/s10444-024-10212-w","url":null,"abstract":"<div><p>We provide a posteriori error estimates for a discontinuous Galerkin scheme for the parabolic-elliptic Keller-Segel system in 2 or 3 space dimensions. The estimates are conditional in the sense that an a posteriori computable quantity needs to be small enough—which can be ensured by mesh refinement—and optimal in the sense that the error estimator decays with the same order as the error under mesh refinement. A specific feature of our error estimator is that it can be used to prove the existence of a weak solution up to a certain time based on numerical results.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 6","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10444-024-10212-w.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142810845","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-09DOI: 10.1007/s10444-024-10208-6
Khalil A. Hall-Hooper, Arvind K. Saibaba, Julianne Chung, Scot M. Miller
We study Bayesian methods for large-scale linear inverse problems, focusing on the challenging task of hyperparameter estimation. Typical hierarchical Bayesian formulations that follow a Markov Chain Monte Carlo approach are possible for small problems but are not computationally feasible for problems with a very large number of unknown inverse parameters. In this work, we describe an empirical Bayes (EB) method to estimate hyperparameters that maximize the marginal posterior, i.e., the probability density of the hyperparameters conditioned on the data, and then we use the estimated hyperparameters to compute the posterior of the unknown inverse parameters. For problems where the computation of the square root and inverse of prior covariance matrices are not feasible, we describe an approach based on the generalized Golub-Kahan bidiagonalization to approximate the marginal posterior and seek hyperparameters that minimize the approximate marginal posterior. Numerical results from seismic and atmospheric tomography demonstrate the accuracy, robustness, and potential benefits of the proposed approach.
{"title":"Efficient iterative methods for hyperparameter estimation in large-scale linear inverse problems","authors":"Khalil A. Hall-Hooper, Arvind K. Saibaba, Julianne Chung, Scot M. Miller","doi":"10.1007/s10444-024-10208-6","DOIUrl":"10.1007/s10444-024-10208-6","url":null,"abstract":"<div><p>We study Bayesian methods for large-scale linear inverse problems, focusing on the challenging task of hyperparameter estimation. Typical hierarchical Bayesian formulations that follow a Markov Chain Monte Carlo approach are possible for small problems but are not computationally feasible for problems with a very large number of unknown inverse parameters. In this work, we describe an empirical Bayes (EB) method to estimate hyperparameters that maximize the marginal posterior, i.e., the probability density of the hyperparameters conditioned on the data, and then we use the estimated hyperparameters to compute the posterior of the unknown inverse parameters. For problems where the computation of the square root and inverse of prior covariance matrices are not feasible, we describe an approach based on the generalized Golub-Kahan bidiagonalization to approximate the marginal posterior and seek hyperparameters that minimize the approximate marginal posterior. Numerical results from seismic and atmospheric tomography demonstrate the accuracy, robustness, and potential benefits of the proposed approach.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 6","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142793849","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-09DOI: 10.1007/s10444-024-10215-7
Xiaodi Zhang, Jialin Xie, Xianzhu Li
This paper studies a time filtered finite element method for the unsteady inductionless magnetohydrodynamic (MHD) equations. The method uses the semi-implicit backward Euler scheme with a time filter in time and adopts the standard inf-sup stable fluid pairs to discretize the velocity and pressure, and the inf-sup stable face-volume elements for solving the current density and electric potential in space. Since the time filter for the velocity is added as a separate post-processing step, the scheme can be easily incorporated into the existing backward Euler code and improves the time accuracy from first order to second order. The unique solvability, unconditional energy stability, and charge conservativeness of the scheme are also proven. In terms of the energy arguments, we establish the error estimates for the velocity, current density, and electric potential. Numerical experiments are performed to verify the theoretical analysis.
{"title":"Analysis of a time filtered finite element method for the unsteady inductionless MHD equations","authors":"Xiaodi Zhang, Jialin Xie, Xianzhu Li","doi":"10.1007/s10444-024-10215-7","DOIUrl":"10.1007/s10444-024-10215-7","url":null,"abstract":"<div><p>This paper studies a time filtered finite element method for the unsteady inductionless magnetohydrodynamic (MHD) equations. The method uses the semi-implicit backward Euler scheme with a time filter in time and adopts the standard inf-sup stable fluid pairs to discretize the velocity and pressure, and the inf-sup stable face-volume elements for solving the current density and electric potential in space. Since the time filter for the velocity is added as a separate post-processing step, the scheme can be easily incorporated into the existing backward Euler code and improves the time accuracy from first order to second order. The unique solvability, unconditional energy stability, and charge conservativeness of the scheme are also proven. In terms of the energy arguments, we establish the error estimates for the velocity, current density, and electric potential. Numerical experiments are performed to verify the theoretical analysis.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"50 6","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142793905","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}