Papers
Topics
Authors
Recent
Search
2000 character limit reached

DD-DeepONet: Domain decomposition and DeepONet for solving partial differential equations in three application scenarios

Published 31 Jul 2025 in math.NA and cs.NA | (2508.02717v1)

Abstract: 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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (4)

Collections

Sign up for free to add this paper to one or more collections.