UM
A parallel multilevel domain decomposition method for source identification problems governed by elliptic equations
Deng,Xiaomao1; Liao,Zi Ju2; Cai,Xiao Chuan3
2021-08-15
Source PublicationJournal of Computational and Applied Mathematics
ISSN0377-0427
Volume392
AbstractIn this paper we develop a parallel multilevel domain decomposition method for large-scale source identification problems governed by elliptic equations. A popular approach is to formulate the inverse problem as a PDE-constrained optimization problem. The minima satisfies a Karush–Kuhn–Tucker (KKT) system consisting of the state, adjoint and source equations which is rather difficult to solve on parallel computers. We propose and study a parallel method that decomposes the optimization problem on the global domain into subproblems on overlapping subdomains, each subdomain is further decomposed to form an additive Schwarz preconditioner for solving these smaller subproblems simultaneously with a preconditioned Krylov subspace method. For each subproblem, the overlapping part of the solution is discarded and the remaining non-overlapping part of the solution is put together to obtain an approximated global solution to the inverse problem. Since all the subproblems are solved independently, the multilevel domain decomposition method has the advantage of higher degree of parallelism. Numerical experiments show that the algorithm is accurate in terms of the reconstruction error and has reasonably good speedup in terms of the computing time. The efficiency and robustness of the proposed approach on a parallel computer with more than 1, 000 processors are reported.
KeywordDomain decomposition Inverse problems Parallel computing Source identification
DOI10.1016/j.cam.2021.113441
URLView the original
Language英语
Fulltext Access
Citation statistics
Cited Times [WOS]:0   [WOS Record]     [Related Records in WOS]
Document TypeJournal article
CollectionUniversity of Macau
Affiliation1.School of Mathematics and Statistics,Guangdong University of Foreign Studies,Guangdong,Guangzhou,510006,China
2.Department of Mathematics,College of Information Science and Technology,Jinan University,Guangdong,Guangzhou,510632,China
3.Department of Mathematics,University of Macau,Macau,China
Recommended Citation
GB/T 7714
Deng,Xiaomao,Liao,Zi Ju,Cai,Xiao Chuan. A parallel multilevel domain decomposition method for source identification problems governed by elliptic equations[J]. Journal of Computational and Applied Mathematics,2021,392.
APA Deng,Xiaomao,Liao,Zi Ju,&Cai,Xiao Chuan.(2021).A parallel multilevel domain decomposition method for source identification problems governed by elliptic equations.Journal of Computational and Applied Mathematics,392.
MLA Deng,Xiaomao,et al."A parallel multilevel domain decomposition method for source identification problems governed by elliptic equations".Journal of Computational and Applied Mathematics 392(2021).
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Deng,Xiaomao]'s Articles
[Liao,Zi Ju]'s Articles
[Cai,Xiao Chuan]'s Articles
Baidu academic
Similar articles in Baidu academic
[Deng,Xiaomao]'s Articles
[Liao,Zi Ju]'s Articles
[Cai,Xiao Chuan]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Deng,Xiaomao]'s Articles
[Liao,Zi Ju]'s Articles
[Cai,Xiao Chuan]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.