Pith. sign in

REVIEW 3 cited by

A Structure-Preserving Domain Decomposition Method for Data-Driven Modeling

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 2406.05571 v1 pith:62RMFHG5 submitted 2024-06-08 math.NA cs.NA

classification math.NAcs.NA
keywords dataelementfinitelocalstructure-preservingaccuracyanalysiscases
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We present a domain decomposition strategy for developing structure-preserving finite element discretizations from data when exact governing equations are unknown. On subdomains, trainable Whitney form elements are used to identify structure-preserving models from data, providing a Dirichlet-to-Neumann map which may be used to globally construct a mortar method. The reduced-order local elements may be trained offline to reproduce high-fidelity Dirichlet data in cases where first principles model derivation is either intractable, unknown, or computationally prohibitive. In such cases, particular care must be taken to preserve structure on both local and mortar levels without knowledge of the governing equations, as well as to ensure well-posedness and stability of the resulting monolithic data-driven system. This strategy provides a flexible means of both scaling to large systems and treating complex geometries, and is particularly attractive for multiscale problems with complex microstructure geometry. While consistency is traditionally obtained in finite element methods via quasi-optimality results and the Bramble-Hilbert lemma as the local element diameter $h\rightarrow0$, our analysis establishes notions of accuracy and stability for finite h with accuracy coming from matching data. Numerical experiments and analysis establish properties for $H(\operatorname{div})$ problems in small data limits ($\mathcal{O}(1)$ reference solutions).

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Structure-Preserving Learning Improves Geometry Generalization in Neural PDEs

    cs.LG 2026-02 conditional novelty 6.0 of 10

    A geometry-conditioned Whitney-form neural network that solves a learned discrete conservation law improves out-of-distribution geometry generalization for steady-state PDEs compared with regression-based neural operators.

  2. Physics-informed sensor coverage through structure preserving machine learning

    cs.LG 2025-09 conditional novelty 6.0 of 10

    A structure-preserving neural PDE surrogate, conditioned on sparse sensor readings, locates sources in advection-diffusion fields and guides adaptive sensor placement through a geodesic Lloyd algorithm.

  3. Structure-Preserving Digital Twins via Conditional Neural Whitney Forms

    cs.LG 2025-08 unverdicted novelty 6.0 of 10

    A transformer-based architecture learns a structure-preserving reduced finite element model, with conservation laws held exactly by the finite element exterior calculus construction, for data-calibrated real-time digi...

Pith tools