{"title":"混合公式中热方程空时域分解的后验停止准则","authors":"S. Hassan, C. Japhet, M. Vohralík","doi":"10.1553/ETNA_VOL49S151","DOIUrl":null,"url":null,"abstract":"We propose and analyse a posteriori estimates for global-in-time, nonoverlapping domain decomposition methods for heterogeneous and anisotropic porous media diffusion problems. We consider mixed formulations, with a lowest-order Raviart–Thomas–Nedelec discretization, often used for such problems. Optimized Robin transmission conditions are employed on the space-time interface between subdomains, and different time grids are used to adapt to different time scales in the subdomains. Our estimators allow to distinguish the spatial discretization, the temporal discretization, and the domain decomposition error components. We design an adaptive space-time domain decomposition algorithm, wherein the iterations are stopped when the domain decomposition error does not affect significantly the global error. Thus, a guaranteed bound on the overall error is obtained on each iteration of the space-time domain decomposition algorithm, and simultaneously important savings in terms of the number of domain decomposition iterations can be achieved. Numerical results for two-dimensional problems with strong heterogeneities and local time stepping are presented to illustrate the performance of our adaptive domain decomposition algorithm.","PeriodicalId":50536,"journal":{"name":"Electronic Transactions on Numerical Analysis","volume":null,"pages":null},"PeriodicalIF":0.8000,"publicationDate":"2018-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"A posteriori stopping criteria for space-time domain decomposition for the heat equation in mixed formulations\",\"authors\":\"S. Hassan, C. Japhet, M. Vohralík\",\"doi\":\"10.1553/ETNA_VOL49S151\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose and analyse a posteriori estimates for global-in-time, nonoverlapping domain decomposition methods for heterogeneous and anisotropic porous media diffusion problems. We consider mixed formulations, with a lowest-order Raviart–Thomas–Nedelec discretization, often used for such problems. Optimized Robin transmission conditions are employed on the space-time interface between subdomains, and different time grids are used to adapt to different time scales in the subdomains. Our estimators allow to distinguish the spatial discretization, the temporal discretization, and the domain decomposition error components. We design an adaptive space-time domain decomposition algorithm, wherein the iterations are stopped when the domain decomposition error does not affect significantly the global error. Thus, a guaranteed bound on the overall error is obtained on each iteration of the space-time domain decomposition algorithm, and simultaneously important savings in terms of the number of domain decomposition iterations can be achieved. Numerical results for two-dimensional problems with strong heterogeneities and local time stepping are presented to illustrate the performance of our adaptive domain decomposition algorithm.\",\"PeriodicalId\":50536,\"journal\":{\"name\":\"Electronic Transactions on Numerical Analysis\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2018-06-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronic Transactions on Numerical Analysis\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1553/ETNA_VOL49S151\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Transactions on Numerical Analysis","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1553/ETNA_VOL49S151","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
A posteriori stopping criteria for space-time domain decomposition for the heat equation in mixed formulations
We propose and analyse a posteriori estimates for global-in-time, nonoverlapping domain decomposition methods for heterogeneous and anisotropic porous media diffusion problems. We consider mixed formulations, with a lowest-order Raviart–Thomas–Nedelec discretization, often used for such problems. Optimized Robin transmission conditions are employed on the space-time interface between subdomains, and different time grids are used to adapt to different time scales in the subdomains. Our estimators allow to distinguish the spatial discretization, the temporal discretization, and the domain decomposition error components. We design an adaptive space-time domain decomposition algorithm, wherein the iterations are stopped when the domain decomposition error does not affect significantly the global error. Thus, a guaranteed bound on the overall error is obtained on each iteration of the space-time domain decomposition algorithm, and simultaneously important savings in terms of the number of domain decomposition iterations can be achieved. Numerical results for two-dimensional problems with strong heterogeneities and local time stepping are presented to illustrate the performance of our adaptive domain decomposition algorithm.
期刊介绍:
Electronic Transactions on Numerical Analysis (ETNA) is an electronic journal for the publication of significant new developments in numerical analysis and scientific computing. Papers of the highest quality that deal with the analysis of algorithms for the solution of continuous models and numerical linear algebra are appropriate for ETNA, as are papers of similar quality that discuss implementation and performance of such algorithms. New algorithms for current or new computer architectures are appropriate provided that they are numerically sound. However, the focus of the publication should be on the algorithm rather than on the architecture. The journal is published by the Kent State University Library in conjunction with the Institute of Computational Mathematics at Kent State University, and in cooperation with the Johann Radon Institute for Computational and Applied Mathematics of the Austrian Academy of Sciences (RICAM).