Optimization Based Nonoverlapping Domain Decomposition Algorithms and Their Convergence

From MaRDI portal





The main objective of this paper is to develop feasible algorithms for solving large scale problems in multidisciplinary simulations. In general, these large problems contain specific individual subdomain problems. By taking the ideas which sustain the nonoverlapping domain decomposition algorithms, the author proposes to incorporate existing numerical softwares already developed for the individual subdomain problems into a viable code for the coupled system. The mathematical study includes the analysis of two simple coupled Poisson problems set upon nonoverlapping subdomains. The resulting continuous -- and then discrete -- coupled problems are carefully analyzed including convergence properties and various examples. Finally, parallel algorithms are proposed. This is a theoretical study which should constitute strong bases for the engineer who wants to couple different systems and their associated existing numerical modelization.




Cited in
(20)








This page was built for publication: Optimization Based Nonoverlapping Domain Decomposition Algorithms and Their Convergence

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