DD-DeepONet: Domain decomposition and DeepONet for solving partial differential equations in three application scenarios
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913974969171968 |
|---|---|
| author | Yang, Bo Li, Xingquan Zhao, Jie Jiang, Ying |
| author_facet | Yang, Bo Li, Xingquan Zhao, Jie Jiang, Ying |
| contents | In certain practical engineering applications, there is an urgent need to perform repetitive solving of partial differential equations (PDEs) in a short period. This paper primarily considers three scenarios requiring extensive repetitive simulations. These three scenarios are categorized based on whether the geometry, boundary conditions(BCs), or parameters vary. We introduce the DD-DeepONet, a framework with strong scalability, whose core concept involves decomposing complex geometries into simple structures and vice versa. We primarily study complex geometries composed of rectangles and cuboids, which have numerous practical applications. Simultaneously, stretching transformations are applied to simple geometries to solve shape-dependent problems. This work solves several prototypical PDEs in three scenarios, including Laplace, Poission, N-S, and drift-diffusion equations, demonstrating DD-DeepONet's computational potential. Experimental results demonstrate that DD-DeepONet reduces training difficulty, requires smaller datasets andVRAMper network, and accelerates solution acquisition. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_02717 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | DD-DeepONet: Domain decomposition and DeepONet for solving partial differential equations in three application scenarios Yang, Bo Li, Xingquan Zhao, Jie Jiang, Ying Numerical Analysis In certain practical engineering applications, there is an urgent need to perform repetitive solving of partial differential equations (PDEs) in a short period. This paper primarily considers three scenarios requiring extensive repetitive simulations. These three scenarios are categorized based on whether the geometry, boundary conditions(BCs), or parameters vary. We introduce the DD-DeepONet, a framework with strong scalability, whose core concept involves decomposing complex geometries into simple structures and vice versa. We primarily study complex geometries composed of rectangles and cuboids, which have numerous practical applications. Simultaneously, stretching transformations are applied to simple geometries to solve shape-dependent problems. This work solves several prototypical PDEs in three scenarios, including Laplace, Poission, N-S, and drift-diffusion equations, demonstrating DD-DeepONet's computational potential. Experimental results demonstrate that DD-DeepONet reduces training difficulty, requires smaller datasets andVRAMper network, and accelerates solution acquisition. |
| title | DD-DeepONet: Domain decomposition and DeepONet for solving partial differential equations in three application scenarios |
| topic | Numerical Analysis |
| url | https://arxiv.org/abs/2508.02717 |