Pith. sign in

REVIEW 1 cited by

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2508.02717 v1 pith:GERMTL6M submitted 2025-07-31 math.NA cs.NA

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

classification math.NA cs.NA
keywords dd-deeponetscenariosthreeequationsgeometriesapplicationscomplexdifferential
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original 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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. A Trainable-by-Parts Operator Learning Framework: Bridging DeepONet and Karhunen-Loeve Expansions for Large-Scale Applications

    cs.LG 2026-06 unverdicted novelty 5.0

    KL-DNN uses low-rank SVD and nested Karhunen-Loeve expansions to enable scalable operator learning on large 3D GCS simulations, achieving 0.04% relative pressure error and two-order speedup over DeepONet.