{"title":"Space-Time FEM-BEM Couplings for Parabolic Transmission Problems","authors":"Thomas Führer, Gregor Gantner, Michael Karkulik","doi":"10.1137/24m1695646","DOIUrl":null,"url":null,"abstract":"SIAM Journal on Numerical Analysis, Volume 63, Issue 5, Page 1909-1932, October 2025. <br/> Abstract. We develop couplings of a recent space-time first-order system least-squares method for parabolic problems and space-time boundary element methods for the heat equation to numerically solve a parabolic transmission problem on the full space and a finite time interval. In particular, we demonstrate coercivity of the couplings under certain restrictions and validate our theoretical findings by numerical experiments.","PeriodicalId":49527,"journal":{"name":"SIAM Journal on Numerical Analysis","volume":"1 1","pages":""},"PeriodicalIF":2.9000,"publicationDate":"2025-09-05","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/24m1695646","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 5, Page 1909-1932, October 2025. Abstract. We develop couplings of a recent space-time first-order system least-squares method for parabolic problems and space-time boundary element methods for the heat equation to numerically solve a parabolic transmission problem on the full space and a finite time interval. In particular, we demonstrate coercivity of the couplings under certain restrictions and validate our theoretical findings by numerical experiments.
期刊介绍:
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.