arXiv Analytics

Sign in

arXiv:1909.12236 [cs.LG]AbstractReferencesReviewsResources

D3M: A deep domain decomposition method for partial differential equations

Ke Li, Kejun Tang, Tianfan Wu, Qifeng Liao

Published 2019-09-24Version 1

A state-of-the-art deep domain decomposition method (D3M) based on the variational principle is proposed for partial differential equations (PDEs). The solution of PDEs can be formulated as the solution of a constrained optimization problem, and we design a multi-fidelity neural network framework to solve this optimization problem. Our contribution is to develop a systematical computational procedure for the underlying problem in parallel with domain decomposition. Our analysis shows that the D3M approximation solution converges to the exact solution of underlying PDEs. Our proposed framework establishes a foundation to use variational deep learning in large-scale engineering problems and designs. We present a general mathematical framework of D3M, validate its accuracy and demonstrate its efficiency with numerical experiments.

Related articles: Most relevant | Search more
arXiv:2406.16606 [cs.LG] (Published 2024-06-24, updated 2024-12-19)
Cherry on the Cake: Fairness is NOT an Optimization Problem
arXiv:1703.06990 [cs.LG] (Published 2017-03-20)
Metalearning for Feature Selection
arXiv:1704.04932 [cs.LG] (Published 2017-04-17)
Deep Relaxation: partial differential equations for optimizing deep neural networks