Scalable two-level domain decomposition methods for the physics and equality constrained artificial neural networks

A family of scalable two-level methods, using both overlapping and non-overlapping domain decomposition, is proposed for the physics and equality constrained artificial neural networks (PECANN) to approximate solutions to partial differential equations. Various coarse components are constructed using a smaller neural network with carefully designed loss functions. By applying the coarse components to the domain decomposition-based PECANN algorithms, the number of outer iterations remains stable even as the number of subdomains increases. Extensive numerical experiments demonstrate the efficiency and scalability of the algorithms, with their performance especially notable when handling a large number of subdomains.

Authors

Publication Details

Journal
Computer Methods in Applied Mechanics and Engineering
Published
2025-10-15
DOI
https://doi.org/10.1016/j.cma.2025.118437
Citations
1
Primary Topic
Model Reduction and Neural Networks
Type
article
Field-Weighted Citation Impact
1.32
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Scalable two-level domain decomposition methods for the physics and equality constrained artificial neural networks

Xuemin Tu, Sungmin Won, Evan Olson
1 citations
Computer Methods in Applied Mechanics and Engineering
Model Reduction and Neural Networks
1.32
article

Scalable two-level domain decomposition methods for the physics and equality constrained artificial neural networks

Xuemin Tu, Sungmin Won, Evan Olson
article en
1 citations

Abstract

A family of scalable two-level methods, using both overlapping and non-overlapping domain decomposition, is proposed for the physics and equality constrained artificial neural networks (PECANN) to approximate solutions to partial differential equations. Various coarse components are constructed using a smaller neural network with carefully designed loss functions. By applying the coarse components to the domain decomposition-based PECANN algorithms, the number of outer iterations remains stable even as the number of subdomains increases. Extensive numerical experiments demonstrate the efficiency and scalability of the algorithms, with their performance especially notable when handling a large number of subdomains.

Computer Methods in Applied Mechanics and EngineeringVol. 448
Openalex Percentile: Top 15%
Model Reduction and Neural Networks
1.32
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.