{"title":"rayleigh - bassaard问题的隐式Schwarz域分解方法","authors":"D. Martínez, H. Herrero, F. Pla","doi":"10.1016/j.cam.2025.116718","DOIUrl":null,"url":null,"abstract":"<div><div>This paper introduces an implicit Schwarz domain decomposition (SDD) method for solving the Rayleigh–Bénard convection problem. The motivation behind this work is to develop an alternative algorithm that eliminates the stagnation error observed in the alternating Schwarz domain decomposition method while enhancing information transmission across subdomain interfaces. A key question explored is whether the implicit SDD method is comparable to the alternating approach and whether it provides a real improvement in terms of efficiency and accuracy. The study focuses on establishing a theoretical proof of convergence for the implicit SDD method combined with Legendre collocation, ensuring its suitability for the Rayleigh–Bénard problem. Additionally, efforts are made to optimize computational cost, making the algorithm more practical for large-scale simulations. Numerical validation is carried out to assess its performance and confirm its advantages. Unlike the alternating approach, which requires solving multiple systems per time step, the implicit method solves a single system, potentially improving convergence speed. Theoretical analysis and numerical experiments demonstrate that this approach effectively improves the accuracy and reduces computational effort, particularly in the case of asymmetric domain decompositions.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"470 ","pages":"Article 116718"},"PeriodicalIF":2.1000,"publicationDate":"2025-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Implicit Schwarz domain decomposition method for a Rayleigh–Bénard problem\",\"authors\":\"D. Martínez, H. Herrero, F. Pla\",\"doi\":\"10.1016/j.cam.2025.116718\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>This paper introduces an implicit Schwarz domain decomposition (SDD) method for solving the Rayleigh–Bénard convection problem. The motivation behind this work is to develop an alternative algorithm that eliminates the stagnation error observed in the alternating Schwarz domain decomposition method while enhancing information transmission across subdomain interfaces. A key question explored is whether the implicit SDD method is comparable to the alternating approach and whether it provides a real improvement in terms of efficiency and accuracy. The study focuses on establishing a theoretical proof of convergence for the implicit SDD method combined with Legendre collocation, ensuring its suitability for the Rayleigh–Bénard problem. Additionally, efforts are made to optimize computational cost, making the algorithm more practical for large-scale simulations. Numerical validation is carried out to assess its performance and confirm its advantages. Unlike the alternating approach, which requires solving multiple systems per time step, the implicit method solves a single system, potentially improving convergence speed. Theoretical analysis and numerical experiments demonstrate that this approach effectively improves the accuracy and reduces computational effort, particularly in the case of asymmetric domain decompositions.</div></div>\",\"PeriodicalId\":50226,\"journal\":{\"name\":\"Journal of Computational and Applied Mathematics\",\"volume\":\"470 \",\"pages\":\"Article 116718\"},\"PeriodicalIF\":2.1000,\"publicationDate\":\"2025-04-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Computational and Applied Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0377042725002328\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational and Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0377042725002328","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
Implicit Schwarz domain decomposition method for a Rayleigh–Bénard problem
This paper introduces an implicit Schwarz domain decomposition (SDD) method for solving the Rayleigh–Bénard convection problem. The motivation behind this work is to develop an alternative algorithm that eliminates the stagnation error observed in the alternating Schwarz domain decomposition method while enhancing information transmission across subdomain interfaces. A key question explored is whether the implicit SDD method is comparable to the alternating approach and whether it provides a real improvement in terms of efficiency and accuracy. The study focuses on establishing a theoretical proof of convergence for the implicit SDD method combined with Legendre collocation, ensuring its suitability for the Rayleigh–Bénard problem. Additionally, efforts are made to optimize computational cost, making the algorithm more practical for large-scale simulations. Numerical validation is carried out to assess its performance and confirm its advantages. Unlike the alternating approach, which requires solving multiple systems per time step, the implicit method solves a single system, potentially improving convergence speed. Theoretical analysis and numerical experiments demonstrate that this approach effectively improves the accuracy and reduces computational effort, particularly in the case of asymmetric domain decompositions.
期刊介绍:
The Journal of Computational and Applied Mathematics publishes original papers of high scientific value in all areas of computational and applied mathematics. The main interest of the Journal is in papers that describe and analyze new computational techniques for solving scientific or engineering problems. Also the improved analysis, including the effectiveness and applicability, of existing methods and algorithms is of importance. The computational efficiency (e.g. the convergence, stability, accuracy, ...) should be proved and illustrated by nontrivial numerical examples. Papers describing only variants of existing methods, without adding significant new computational properties are not of interest.
The audience consists of: applied mathematicians, numerical analysts, computational scientists and engineers.