Exponential convergence through linear finite element discretization of stratified subdomains

From MaRDI portal
Publication:729601

DOI10.1016/J.JCP.2016.06.045zbMATH Open1352.65565arXiv1507.05038OpenAlexW2281052490WikidataQ57430343 ScholiaQ57430343MaRDI QIDQ729601FDOQ729601

Ali Vaziri Astaneh, V. Druskin, Murthy N. Guddati

Publication date: 20 December 2016

Published in: Journal of Computational Physics (Search for Journal in Brave)

Abstract: Motivated by problems where the response is needed at select localized regions in a large computational domain, we devise a novel finite element discretization that results in exponential convergence at pre-selected points. The two key features of the discretization are (a) use of midpoint integration to evaluate the contribution matrices, and (b) an unconventional bending of the mesh into complex space. Named complex-length finite element method (CFEM), the technique is linked to Pade approximants that provide exponential convergence of the Dirichlet-to-Neumann maps and thus the solution at specified points in the domain. Exponential convergence facilitates drastic reduction in the number of elements. This, combined with sparse computation associated with linear finite elements, results in significant reduction in the computational cost. The paper presents the basic ideas of the method as well as illustration of its effectiveness for a variety of problems involving Laplace, Helmholtz and elastodynamic equations.


Full work available at URL: https://arxiv.org/abs/1507.05038





Cites Work


Cited In (1)

Uses Software






This page was built for publication: Exponential convergence through linear finite element discretization of stratified subdomains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q729601)