Neural-Schwarz Tiling for Geometry-Universal PDE Solving at Scale

• URL: http://arxiv.org/abs/2605.12343v1
• Date: Tue, 12 May 2026 16:20:26 GMT
• Title: Neural-Schwarz Tiling for Geometry-Universal PDE Solving at Scale
• Abstract summary: We introduce $textbfNEST$ ($textbfS$chwarz $textbfT$iling), a local-to-global framework that shifts learning from full-domain solution operators to reusable local physical solvers.<n>NEST learns a neural operator on minimal voxel patches with diverse local geometries and boundary/interface data.<n>Our results show that local neural building blocks, coupled through Schwarz iteration, offer a reusable local-training path toward scalable learned PDE solvers.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Most learned PDE solvers follow a global-surrogate paradigm: a neural operator is trained to map full problem descriptions to full solution fields for a prescribed distribution of geometries, boundary conditions, and coefficients. This has enabled fast inference within fixed problem families, but limits reuse across new domains and makes large-scale deployment dependent on expensive problem-specific data generation. We introduce $\textbf{NEST}$ ($\textbf{Ne}$ural-$\textbf{S}$chwarz $\textbf{T}$iling), a local-to-global framework that shifts learning from full-domain solution operators to reusable local physical solvers. The central premise is that, although global PDE solutions depend on geometry, scale, and boundary conditions, the physical response on small neighborhoods can be learned locally and composed into global solutions through classical domain decomposition. NEST learns a neural operator on minimal voxel patches ($3 \times 3 \times 3$) with diverse local geometries and boundary/interface data. At inference time, an unseen voxelized domain is tiled into overlapping patches, the learned local solver is applied patchwise, and global consistency is enforced through iterative Schwarz coupling with partition-of-unity assembly. In this way, generalization is shifted from a monolithic neural model to the combination of local physics learning and algorithmic global assembly. We instantiate NEST on nonlinear static equilibrium in compressible neo-Hookean solids and evaluate it on large, geometrically complex 3D domains far outside the scale of the training patches. Our results show that local neural building blocks, coupled through Schwarz iteration, offer a reusable local-training path toward scalable learned PDE solvers that generalize across domain size, shape, and boundary-condition configurations.

Related papers

• EqGINO: Equivariant Geometry-Informed Fourier Neural Operators for 3D PDEs [12.013314817711054]
  We introduce EqGINO, a geometrically robust framework that enforces isotropy in the spectral domain.<n>Our method robustly models coordinate-invariant physical laws on complex irregular 3D geometries.
  arXiv  Detail & Related papers  (2026-06-02T07:23:06Z)
• Scale-Consistent Learning for Partial Differential Equations [79.48661503591943]
  We propose a data augmentation scheme based on scale-consistency properties of PDEs.<n>We then design a scale-informed neural operator that can model a wide range of scales.<n>With scale-consistency, the model trained on $Re$ of 1000 can generalize to $Re$ ranging from 250 to 10000.
  arXiv  Detail & Related papers  (2025-07-24T21:29:52Z)
• Convergence of Adam in Deep ReLU Networks via Directional Complexity and Kakeya Bounds [49.1574468325115]
  First-order adaptive optimization methods like Adam are the default choices for training modern deep neural networks.<n>We develop a multi-layer refinement framework that progressively tightens bounds on region crossings.<n>We prove that the number of region crossings collapses from exponential to near-linear in the effective dimension.
  arXiv  Detail & Related papers  (2025-05-21T01:34:16Z)
• Decentralized Nonconvex Composite Federated Learning with Gradient Tracking and Momentum [78.27945336558987]
  Decentralized server (DFL) eliminates reliance on client-client architecture.<n>Non-smooth regularization is often incorporated into machine learning tasks.<n>We propose a novel novel DNCFL algorithm to solve these problems.
  arXiv  Detail & Related papers  (2025-04-17T08:32:25Z)
• Operator Learning with Domain Decomposition for Geometry Generalization in PDE Solving [3.011852751337123]
  We propose operator learning with domain decomposition, a local-to-global framework to solve PDEs on arbitrary geometries.<n>Under this framework, we devise an iterative scheme textitSchwarz Inference (SNI)<n>This scheme allows for partitioning of the problem domain into smaller geometries, on which local problems can be solved with neural operators.<n>We conduct extensive experiments on several representative PDEs with diverse boundary conditions and achieve remarkable geometry generalization.
  arXiv  Detail & Related papers  (2025-04-01T08:00:43Z)
• BENO: Boundary-embedded Neural Operators for Elliptic PDEs [15.18712698704595]
  We introduce Boundary-Embedded Neural Operators (BENO) for solving elliptic PDEs. BENO embeds the complex geometries and inhomogeneous boundary values into the solving of elliptic PDEs. Our model outperforms state-of-the-art neural operators and strong baselines by an average of 60.96%.
  arXiv  Detail & Related papers  (2024-01-17T16:47:39Z)
• Multi-Grid Tensorized Fourier Neural Operator for High-Resolution PDEs [93.82811501035569]
  We introduce a new data efficient and highly parallelizable operator learning approach with reduced memory requirement and better generalization. MG-TFNO scales to large resolutions by leveraging local and global structures of full-scale, real-world phenomena. We demonstrate superior performance on the turbulent Navier-Stokes equations where we achieve less than half the error with over 150x compression.
  arXiv  Detail & Related papers  (2023-09-29T20:18:52Z)
• Operator Learning with Neural Fields: Tackling PDEs on General Geometries [15.65577053925333]
  Machine learning approaches for solving partial differential equations require learning mappings between function spaces. New CORAL method leverages coordinate-based networks for PDEs on some general constraints.
  arXiv  Detail & Related papers  (2023-06-12T17:52:39Z)
• Message Passing Neural PDE Solvers [60.77761603258397]
  We build a neural message passing solver, replacing allally designed components in the graph with backprop-optimized neural function approximators. We show that neural message passing solvers representationally contain some classical methods, such as finite differences, finite volumes, and WENO schemes. We validate our method on various fluid-like flow problems, demonstrating fast, stable, and accurate performance across different domain topologies, equation parameters, discretizations, etc., in 1D and 2D.
  arXiv  Detail & Related papers  (2022-02-07T17:47:46Z)
• Clustered Federated Learning via Generalized Total Variation Minimization [83.26141667853057]
  We study optimization methods to train local (or personalized) models for local datasets with a decentralized network structure. Our main conceptual contribution is to formulate federated learning as total variation minimization (GTV) Our main algorithmic contribution is a fully decentralized federated learning algorithm.
  arXiv  Detail & Related papers  (2021-05-26T18:07:19Z)
• Train Once and Use Forever: Solving Boundary Value Problems in Unseen Domains with Pre-trained Deep Learning Models [0.20999222360659606]
  This paper introduces a transferable framework for solving boundary value problems (BVPs) via deep neural networks. First, we introduce emphgenomic flow network (GFNet), a neural network that can infer the solution of a BVP across arbitrary boundary conditions. Then, we propose emphmosaic flow (MF) predictor, a novel iterative algorithm that assembles or stitches the GFNet's inferences.
  arXiv  Detail & Related papers  (2021-04-22T05:20:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.