{"title":"Optimized Schwarz methods for the time-dependent Stokes–Darcy coupling","authors":"Marco Discacciati, Tommaso Vanzan","doi":"10.1093/imanum/drad057","DOIUrl":null,"url":null,"abstract":"Abstract This paper derives optimized coefficients for optimized Schwarz iterations for the time-dependent Stokes–Darcy problem using an innovative strategy to solve a nonstandard min-max problem. The coefficients take into account both physical and discretization parameters that characterize the coupled problem, and they guarantee the robustness of the associated domain decomposition method. Numerical results validate the proposed approach in several test cases with physically relevant parameters.","PeriodicalId":56295,"journal":{"name":"IMA Journal of Numerical Analysis","volume":null,"pages":null},"PeriodicalIF":2.3000,"publicationDate":"2023-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IMA Journal of Numerical Analysis","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1093/imanum/drad057","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
Abstract This paper derives optimized coefficients for optimized Schwarz iterations for the time-dependent Stokes–Darcy problem using an innovative strategy to solve a nonstandard min-max problem. The coefficients take into account both physical and discretization parameters that characterize the coupled problem, and they guarantee the robustness of the associated domain decomposition method. Numerical results validate the proposed approach in several test cases with physically relevant parameters.
期刊介绍：
The IMA Journal of Numerical Analysis (IMAJNA) publishes original contributions to all fields of numerical analysis; articles will be accepted which treat the theory, development or use of practical algorithms and interactions between these aspects. Occasional survey articles are also published.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
