Neural PDE Solvers

PDE: Partial Differential Equation

Follow this topic Ask about this topic

Neural PDE solvers approximate fields, time evolution, or mappings from equation inputs to solutions, with potential benefits for repeated simulations, inverse problems, and high-dimensional settings. Physics-informed neural networks (PINNs) train on equation residuals, while weak-form and variational methods use integral or energy principles; neural operators learn mappings across families of PDE instances. Other approaches use randomized or separable features, and hybridize learned models with finite-element, finite-volume, or multigrid solvers. The central tension is achieving reliable accuracy, conservation, and long-term stability while reducing total computational cost; generalization beyond training conditions and rigorous error guarantees remain important challenges.

Latest papers

272 papers47 papers in the last four weeks, up 74% on the four weeks before. 0.3% of all new papers.

Mar 4, 2026

Improving the accuracy of physics-informed neural networks via last-layer retraining

Physics-informed neural networks (PINNs) are a versatile tool in the burgeoning field of scientific machine learning for solving partial differential equations (PDEs). However, determining suitable training strategies for them is not obvious, with the result that they typically yield moderately accurate solutions. In this article, we propose a method for improving the accuracy of PINNs by coupling them with a post-processing step that seeks the best approximation in a function space associated with the network. We find that our method yields errors four to five orders of magnitude lower than those of the parent PINNs across architectures and dimensions. Moreover, we can reuse the basis functions for the linear space in more complex settings, such as time-dependent and nonlinear problems, allowing for transfer learning. Our approach also provides a residual-based metric that allows us to optimally choose the number of basis functions employed.

Saad Qadeer, Panos Stinis

Advanced Computing, Mathematics and Data Division, Pacific Northwest National Laboratory, Richland, WA

Neural PDE Solvers Physics-Informed ML Fine-Tuning

Mar 4, 2026

Jacobian-Adaptive Weighting for Stability: Enhancing Long-term Rollout of Neural Partial Differential Equation Solvers via Spatially-Adaptive Regularization

Data-driven surrogate models can significantly accelerate the simulation of continuous dynamical systems, yet the step-wise accumulation of errors during autoregressive time-stepping often leads to spectral blow-up and unphysical divergence. Existing global regularization techniques can enforce contractive dynamics but uniformly damp high-frequency features, causing over-smoothing; meanwhile, long-horizon trajectory optimization methods are severely constrained by memory bottlenecks. This paper proposes Jacobian-Adaptive Weighting for Stability (JAWS), which reformulates operator learning as a Maximum A Posteriori (MAP) estimation problem with spatially heteroscedastic uncertainty, enabling the regularization strength to adapt automatically based on local physical complexity: enforcing contraction in smooth regions to suppress noise while relaxing constraints near singular features such as shocks to preserve gradient information. Experiments demonstrate that JAWS serves as an effective spectral pre-conditioner for trajectory optimization, allowing short-horizon, memory-efficient training to match the accuracy of long-horizon baselines. Validations on the 1D viscous Burgers' equation and 2D flow past a cylinder (

\text{Re}=400

out-of-distribution generalization) confirm the method's advantages in long-term stability, preservation of physical conservation properties, and computational efficiency. This significant reduction in memory usage makes the method particularly well-suited for stable and efficient long-term simulation of large-scale flow fields in practical engineering applications.

Fengxiang Nie, Yasuhiro Suzuki

University of Hiroshima

Neural PDE Solvers Algorithmic Stability PDE Operator Learning Computational Fluid Dynamics

Mar 2, 2026

DGNet: Discrete Green Networks for Data-Efficient Learning of Spatiotemporal PDEs

Spatiotemporal partial differential equations (PDEs) underpin a wide range of scientific and engineering applications. Neural PDE solvers offer a promising alternative to classical numerical methods. However, existing approaches typically require large numbers of training trajectories, while high-fidelity PDE data are expensive to generate. Under limited data, their performance degrades substantially, highlighting their low data efficiency. A key reason is that PDE dynamics embody strong structural inductive biases that are not explicitly encoded in neural architectures, forcing models to learn fundamental physical structure from data. A particularly salient manifestation of this inefficiency is poor generalization to unseen source terms. In this work, we revisit Green's function theory-a cornerstone of PDE theory-as a principled source of structural inductive bias for PDE learning. Based on this insight, we propose DGNet, a discrete Green network for data-efficient learning of spatiotemporal PDEs. The key idea is to transform the Green's function into a graph-based discrete formulation, and embed the superposition principle into the hybrid physics-neural architecture, which reduces the burden of learning physical priors from data, thereby improving sample efficiency. Across diverse spatiotemporal PDE scenarios, DGNet consistently achieves state-of-the-art accuracy using only tens of training trajectories. Moreover, it exhibits robust zero-shot generalization to unseen source terms, serving as a stress test that highlights its data-efficient structural design.

Yingjie Tan, Quanming Yao, Yaqing Wang

Qiuzhen College, Tsinghua University · Department of Electronic Engineering, Tsinghua University · Beijing Institute of Mathematical Sciences and Applications

Neural PDE Solvers PDE Surrogate Modeling Data-Efficient Learning

Mar 2, 2026

Randomized Neural Networks for Partial Differential Equation on Static and Evolving Surfaces

Surface partial differential equations arise in numerous scientific and engineering applications. Their numerical solution on static and evolving surfaces remains challenging due to geometric complexity and, for evolving geometries, the need for repeated mesh updates and geometry or solution transfer. While neural-network-based methods offer mesh-free discretizations, approaches based on nonconvex training can be costly and may fail to deliver high accuracy in practice. In this work, we develop a randomized neural network (RaNN) method for solving PDEs on both static and evolving surfaces: the hidden-layer parameters are randomly generated and kept fixed, and the output-layer coefficients are determined efficiently by solving a least-squares problem. For static surfaces, we present formulations for parametrized surfaces, implicit level-set surfaces, and point-cloud geometries, and provide a corresponding theoretical analysis for the parametrization-based formulation with interface compatibility. For evolving surfaces with topology preserved over time, we introduce a RaNN-based strategy that learns the surface evolution through a flow-map representation and then solves the surface PDE on a space--time collocation set, avoiding remeshing. Extensive numerical experiments demonstrate broad applicability and favorable accuracy--efficiency performance on representative benchmarks.

Jingbo Sun, Fei Wang

School of Mathematics and Statistics, Xi’an Jiaotong University, Xi’an, Shaanxi 710049, P.R. China. · School of Mathematics and Statistics & State Key Laboratory of Multiphase Flow in Power Engineering, Xi’an Jiaotong University, Xi’an, Shaanxi 710049, China.

Neural PDE Solvers PDE Solving

Mar 1, 2026

Structure-preserving Randomized Neural Networks for Incompressible Magnetohydrodynamics Equations

The incompressible magnetohydrodynamic (MHD) equations are fundamental in many scientific and engineering applications. However, their strong nonlinearity and dual divergence-free constraints make them highly challenging for conventional numerical solvers. To overcome these difficulties, we propose a Structure-Preserving Randomized Neural Network (SP-RaNN) that automatically and exactly satisfies the divergence-free conditions. Unlike deep neural network (DNN) approaches that rely on expensive nonlinear and nonconvex optimization, SP-RaNN reformulates the training process into a linear least-squares system, thereby eliminating nonconvex optimization. The method linearizes the governing equations through Picard or Newton iterations, discretizes them at collocation points within the domain and on the boundaries using finite-difference schemes, and solves the resulting linear system via a linear least-squares procedure. By design, SP-RaNN preserves the intrinsic mathematical structure of the equations within a unified space-time framework, ensuring both stability and accuracy. Numerical experiments on the Navier-Stokes, Maxwell, and MHD equations demonstrate that SP-RaNN achieves higher accuracy, faster convergence, and exact enforcement of divergence-free constraints compared with both traditional numerical methods and DNN-based approaches. This structure-preserving framework provides an efficient and reliable tool for solving complex PDE systems while rigorously maintaining their underlying physical laws.

Yunlong Li, Fei Wang, Lingxiao Li

School of Mathematics and Statistics, Xi’an Jiaotong University, Xi’an, Shaanxi 710049, P.R. China. · School of Mathematics and Statistics & State Key Laboratory of Multiphase Flow in Power Engineering, Xi’an Jiaotong University, Xi’an, Shaanxi 710049, China. · School of Mathematics and Statistics, Henan University, Kaifeng, Henan 475004, China. +1

Structure-Preserving Neural Networks Magnetohydrodynamics Neural PDE Solvers Computational Fluid Dynamics

Mar 1, 2026

Adaptive-Growth Randomized Neural Networks for Level-Set Computation of Multivalued Nonlinear First-Order PDEs with Hyperbolic Characteristics

This paper proposes an Adaptive-Growth Randomized Neural Network (AG-RaNN) method for computing multivalued solutions of nonlinear first-order PDEs with hyperbolic characteristics, including quasilinear hyperbolic balance laws and Hamilton--Jacobi equations. Such solutions arise in geometric optics, seismic waves, semiclassical limit of quantum dynamics and high frequency limit of linear waves, and differ markedly from the viscosity or entropic solutions. The main computational challenges lie in that the solutions are no longer functions, and become union of multiple branches, after the formation of singularities. Level-set formulations offer a systematic alternative by embedding the nonlinear dynamics into linear transport equations posed in an augmented phase space, at the price of substantially increased dimensionality. To alleviate this computational burden, we combine AG-RaNN with an adaptive collocation strategy that concentrates samples in a tubular neighborhood of the zero level set, together with a layer-growth mechanism that progressively enriches the randomized feature space. Under standard regularity assumptions on the transport field and the characteristic flow, we establish a convergence result for the AG-RaNN approximation of the level-set equations. Numerical experiments demonstrate that the proposed method can efficiently recover multivalued structures and resolve nonsmooth features in high-dimensional settings.

Haoning Dang, Shi Jin, Fei Wang

School of Mathematics and Statistics, Xi’an Jiaotong University, Xi’an, Shaanxi 710049, China. · School of Mathematical Sciences & Institute of Natural Sciences, Shanghai Jiao Tong University, Shanghai 200240, China. · School of Mathematics and Statistics & State Key Laboratory of Multiphase Flow in Power Engineering, Xi’an Jiaotong University, Xi’an, Shaanxi 710049, China.

PDE Solving Neural PDE Solvers

Mar 1, 2026

A level-wise training scheme for learning neural multigrid smoothers with application to integral equations

Convolution-type integral equations commonly occur in signal processing and image processing. Discretizing these equations yields large and ill-conditioned linear systems. While the classic multigrid method is effective for solving linear systems derived from partial differential equations (PDE) problems, it fails to solve integral equations because its smoothers, which are implemented as conventional relaxation methods, are ineffective in reducing high-frequency components in the errors. We propose a novel neural multigrid scheme where learned neural operators replace classical smoothers. Unlike classical smoothers, these operators are trained offline. Once trained, the neural smoothers generalize to new right-hand-side vectors without retraining, making it an efficient solver. We design level-wise loss functions incorporating spectral filtering to emulate the multigrid frequency decomposition principle, ensuring each operator focuses on solving distinct high-frequency spectral bands. Although we focus on integral equations, the framework is generalizable to all kinds of problems, including PDE problems. Our experiments demonstrate superior efficiency over classical solvers and robust convergence across varying problem sizes and regularization weights.

Lingfeng Li, Yin King Chu, Raymond Chan +1

Hetao Institute of Mathematics and Interdisciplinary Sciences, Shenzhen, Guangdong, China. · Department of Mathematics, Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong, China. · Department of Data Science, Department of Operations and Risk Management,Lingnan University, Tuen Mun, Hong Kong, China. +1

Neural Operators Neural PDE Solvers

Mar 1, 2026

Data-Free Finite-Volume Convolutional Neural Networks for Steady Compressible Euler Flow around a Circular Cylinder

A data-free finite-volume convolutional neural network (FV-CNN) is formulated for steady Euler flow around a cylinder at eight Mach numbers, 2--15. Shared-face fluxes define conservative spatial balances, while automatic differentiation supplies parameter gradients. The derivative mismatch in the earlier automatic-differentiation-based convolutional neural network (AD-CNN) is derived. No computational fluid dynamics (CFD) or experimental field targets enter training; reference-independent selection of coefficients, seeds, and checkpoints is not established. Billig-based upstream fixing conditions shock-location agreement.For eight adopted fields, density and pressure relative

L_2

discrepancies from finite-resolution CFD are

5.43

--

18.69\%

and

6.25

--

19.70\%

. Closed-band defects are smaller than AD-CNN in 32/32 self-centered and 22--31/32 CFD-centered comparisons over seven half-widths, 0.06--0.12 cylinder diameters. AD-CNN retains smaller enthalpy root-mean-square (RMS) discrepancies in 7/8 cases, shock-position RMS at Mach 11 and 15, and temperature and transverse-velocity discrepancies at Mach 3.Ten new Mach-15 initializations and adopted seed 42 yield density discrepancies of

12.04

--

43.70\%

(mean

24.34\%

, sample standard deviation

11.78

percentage points); the new ten alone give

25.04\%

and

12.17

points. Dispersion exceeds the historical adopted-field gap of

3.40

points; six of eleven outcomes are below AD-CNN. Transition-width ratios of AD-CNN to FV-CNN remain

4.07

--

4.66

, and all 44 self-centered seed--component balances at half-width 0.10 cylinder diameters are smaller for FV-CNN. Local sharpness and this balance metric persist, while initialization-robust accuracy superiority is not established.Component interventions remain one-seed conditional responses; Mach 2 uses a separate budget-limited protocol.

Ryosuke Yano

Tokio Marine dR Co., Ltd., 1-5-1, Otemachi, Chiyoda-ku, Tokyo, 100-0004, Japan.

Neural PDE Solvers Physics-Informed ML Computational Fluid Dynamics

Feb 28, 2026

TENG-BC: Unified Time-Evolving Natural Gradient for Neural PDE Solvers with General Boundary Conditions

Accurately solving time-dependent partial differential equations (PDEs) with neural networks remains challenging due to long-time error accumulation and the difficulty of enforcing general boundary conditions. We introduce TENG-BC, a high-precision neural PDE solver based on the Time-Evolving Natural Gradient, designed to perform under general boundary constraints. At each time step, TENG-BC performs a boundary-aware optimization that jointly enforces interior dynamics and boundary conditions, accommodating Dirichlet, Neumann, Robin, and mixed types within a unified framework. This formulation admits a natural-gradient interpretation, enabling stable time evolution without delicate penalty tuning. Across benchmarks over diffusion, transport, and nonlinear PDEs with various boundary conditions, TENG-BC achieves solver-level accuracy under comparable sampling budgets, outperforming conventional solvers and physics-informed neural network (PINN) baselines.

Hongjie Jiang, Di Luo

School of Mathematical Sciences, Peking University, Beijing, China · Department of Physics, Tsinghua University, Beijing, China · Institute of Advanced Study, Tsinghua University, Beijing, China

Neural PDE Solvers PDE Solving Natural Gradient Methods

Feb 27, 2026

A Stability-Aware Frozen Euler Autoencoder for Physics-Informed Tracking in Continuum Mechanics (SAFE-PIT-CM)

Material parameters such as thermal diffusivity govern how microstructural fields evolve during processing, but difficult to measure directly. The Stability-Aware Frozen Euler Physics-Informed Tracking for Continuum Mechanics (SAFE-PIT-CM), is an autoencoder that embeds a frozen convolutional layer as a differentiable PDE solver in its latent-space transition to jointly recover diffusion coefficients and the underlying physical field from temporal observations. When temporal snapshots are saved at intervals coarser than the simulation time step, a single forward Euler step violates the von Neumann stability condition, forcing the learned coefficient to collapse to an unphysical value. Sub-stepping with SAFE restores stability at negligible cost each sub-step is a single frozen convolution, far cheaper than processing more frames with recovery error converging monotonically with substep count. Validated on thermal diffusion in metals, the method recovers both the diffusion coefficient and the physical field with near-perfect accuracy, both with and yet without pre-training. Backpropagation through the frozen operator supervises an attention-based parameter estimator without labelled data. The architecture generalises to any PDE with a convolutional finite-difference discretisation.

Emil Hovad

Section for Statistics and Data Analysis, DTU Compute, Technical University of Denmark, Kgs. Lyngby, Denmark

Physics-Informed ML PDE Inverse Problems Neural PDE Solvers Materials Property Prediction

Feb 25, 2026

Deep Accurate Solver for the Geodesic Problem

A common approach to compute distances on continuous surfaces is by considering a discretized polygonal mesh approximating the surface and estimating distances on the polygon. We show that exact geodesic distances restricted to the polygon are at most second-order accurate with respect to the distances on the corresponding continuous surface. By order of accuracy we refer to the convergence rate as a function of the average distance between sampled points. Next, a higher-order accurate deep learning method for computing geodesic distances on surfaces is introduced. Traditionally, one considers two main components when computing distances on surfaces: a numerical solver that locally approximates the distance function, and an efficient causal ordering scheme by which surface points are updated. Classical minimal path methods often exploit a dynamic programming principle with quasi-linear computational complexity in the number of sampled points. The quality of the distance approximation is determined by the local solver that is revisited in this paper. To improve state of the art accuracy, we consider a neural network-based local solver which implicitly approximates the structure of the continuous surface. We supply numerical evidence that the proposed learned update scheme provides better accuracy compared to the best possible polyhedral approximations and previous learning-based methods. The result is a third-order accurate solver with a bootstrapping-recipe for further improvement.

Saar Huberman, Amit Bracha, Ron Kimmel

Technion - Israel Institute of Technology, Haifa, Israel

Neural PDE Solvers Riemannian Geometry

Feb 23, 2026

Scale-PINN: Learning Efficient Physics-Informed Neural Networks Through Sequential Correction

Physics-informed neural networks (PINNs) have emerged as a promising mesh-free paradigm for solving partial differential equations, yet adoption in science and engineering is limited by slow training and modest accuracy relative to modern numerical solvers. We introduce the Sequential Correction Algorithm for Learning Efficient PINN (Scale-PINN), a learning strategy that bridges modern physics-informed learning with numerical algorithms. Scale-PINN incorporates the iterative residual-correction principle, a cornerstone of numerical solvers, directly into the loss formulation, marking a paradigm shift in how PINN losses can be conceived and constructed. This integration enables Scale-PINN to achieve unprecedented convergence speed across PDE problems from different physics domain, including reducing training time on a challenging fluid-dynamics problem for state-of-the-art PINN from hours to sub-2 minutes while maintaining superior accuracy, and enabling application to representative problems in aerodynamics and urban science. By uniting the rigor of numerical methods with the flexibility of deep learning, Scale-PINN marks a significant leap toward the practical adoption of PINNs in science and engineering through scalable, physics-informed learning. Codes are available at https://github.com/chiuph/SCALE-PINN.

Pao-Hsiung Chiu, Jian Cheng Wong, Chin Chun Ooi +3

Institute of High Performance Computing, A*STAR, Singapore. · Centre for Frontier AI Research, A*STAR, Singapore. · School of Mechanical Engineering, Tianjin University, China. +1

Neural PDE Solvers Physics-Informed ML Neural Network Optimization

Feb 20, 2026

Neural-HSS: Hierarchical Semi-Separable Neural PDE Solver

Deep learning-based methods have shown remarkable effectiveness in solving PDEs, largely due to their ability to enable fast simulations once trained. However, despite the availability of high-performance computing infrastructure, many critical applications remain constrained by the substantial computational costs associated with generating large-scale, high-quality datasets and training models. In this work, inspired by studies on the structure of Green's functions for elliptic PDEs, we introduce Neural-HSS, a parameter-efficient architecture built upon the Hierarchical Semi-Separable (HSS) matrix structure that is provably data-efficient for a broad class of PDEs. We theoretically analyze the proposed architecture, proving that it satisfies exactness properties even in very low-data regimes. We also investigate its connections with other architectural primitives, such as the Fourier neural operator layer and convolutional layers. We experimentally validate the data efficiency of Neural-HSS on the three-dimensional Poisson equation over a grid of two million points, demonstrating its superior ability to learn from data generated by elliptic PDEs in the low-data regime while outperforming baseline methods. Finally, we demonstrate its capability to learn from data arising from a broad class of PDEs in diverse domains, including electromagnetism, fluid dynamics, and biology.

Pietro Sittoni, Emanuele Zangrando, Angelo A. Casulli +2

Gran Sasso Science Institute, L’Aquila, Italy · University of Edinburgh, UK

Neural PDE Solvers PDE Operator Learning Data-Efficient Learning

Feb 19, 2026

Weak-Form Evolutionary Kolmogorov-Arnold Networks for Solving Partial Differential Equations

Partial differential equations (PDEs) form a central component of scientific computing. Among recent advances in deep learning, evolutionary neural networks have been developed to successively capture the temporal dynamics of time-dependent PDEs via parameter evolution. The parameter updates are obtained by solving a linear system derived from the governing equation residuals at each time step. However, strong-form evolutionary approaches can yield ill-conditioned linear systems due to pointwise residual discretization, and their computational cost scales unfavorably with the number of training samples. To address these limitations, we propose a weak-form evolutionary Kolmogorov-Arnold Network (KAN) for the scalable and accurate prediction of PDE solutions. We decouple the linear system size from the number of training samples through the weak formulation, leading to improved scalability compared to strong-form approaches. We also rigorously enforce boundary conditions by constructing the trial space with boundary-constrained KANs to satisfy Dirichlet and periodic conditions, and by incorporating derivative boundary conditions directly into the weak formulation for Neumann conditions. In conclusion, the proposed weak-form evolutionary KAN framework provides a stable and scalable approach for PDEs and contributes to scientific machine learning with potential relevance to future engineering applications.

Bongseok Kim, Jiahao Zhang, Guang Lin

Neural PDE Solvers PDE Solving Kolmogorov-Arnold Networks Neuroevolution

Feb 19, 2026

Solving and learning advective multiscale Darcian dynamics with the Neural Basis Method

Physics-governed models are increasingly paired with machine learning for accelerated predictions, yet most "physics--informed" formulations treat the governing equations as a penalty loss whose scale and meaning are set by heuristic balancing. This blurs operator structure, thereby confounding solution approximation error with governing-equation enforcement error and making the solving and learning progress hard to interpret and control. Here we introduce the Neural Basis Method, a projection-based formulation that couples a predefined, physics-conforming neural basis space with an operator-induced residual metric to obtain a well-conditioned deterministic minimization. Stability and reliability then hinge on this metric: the residual is not merely an optimization objective but a computable certificate tied to approximation and enforcement, remaining stable under basis enrichment and yielding reduced coordinates that are learnable across parametric instances. We use advective multiscale Darcian dynamics as a concrete demonstration of this broader point. Our method produce accurate and robust solutions in single solves and enable fast and effective parametric inference with operator learning.

Yuhe Wang, Min Wang

Institute for Scientific Computation, Texas A&M University, College Station, TX 77843, USA · Department of Mathematics, University of Houston, Houston, TX 77204, USA

Neural PDE Solvers Physics-Informed ML PDE Operator Learning Neural Surrogate Modeling Computational Fluid Dynamics

Feb 18, 2026

Geometric Neural Operators via Lie Group-Constrained Latent Dynamics

Neural operators offer an effective framework for learning solutions of partial differential equations for many physical systems in a resolution-invariant and data-driven manner. Existing neural operators, however, often suffer from instability in multi-layer iteration and long-horizon rollout, which stems from the unconstrained Euclidean latent space updates that violate the geometric and conservation laws. To address this challenge, we propose to constrain manifolds with low-rank Lie algebra parameterization that performs group action updates on the latent representation. Our method, termed Manifold Constraining based on Lie group (MCL), acts as an efficient plug-and-play module that enforces geometric inductive bias to existing neural operators. Extensive experiments on various partial differential equations, such as 1-D Burgers and 2-D Navier-Stokes, over a wide range of parameters and steps demonstrate that our method effectively lowers the relative prediction error by 30-50% at the cost of 2.26% of parameter increase. The results show that our approach provides a scalable solution for improving long-term prediction fidelity by addressing the principled geometric constraints absent in the neural operator updates.

Jiaquan Zhang, Fachrina Dewi Puspitasari, Songbo Zhang +7

School of Information and Software Engineering, University of Electronic Science and Technology of China, Chengdu, China · Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China · Institute of Software Chinese Academy of Sciences, Beijing, China +2

Neural PDE Solvers PDE Operator Learning Neural Operators Lie Group Methods

Feb 18, 2026

Rethinking Input Domains in Physics-Informed Neural Networks via Geometric Compactification Mappings

Several complex physical systems are governed by multi-scale partial differential equations (PDEs) that exhibit both smooth low-frequency components and localized high-frequency structures. Existing physics-informed neural network (PINN) methods typically train with fixed coordinate system inputs, where geometric misalignment with these structures induces gradient stiffness and ill-conditioning that hinder convergence. To address this issue, we introduce a mapping paradigm that reshapes the input coordinates through differentiable geometric compactification mappings and couples the geometric structure of PDEs with the spectral properties of residual operators. Based on this paradigm, we propose Geometric Compactification (GC)-PINN, a framework that introduces three mapping strategies for periodic boundaries, far-field scale expansion, and localized singular structures in the input domain without modifying the underlying PINN architecture. Extensive empirical evaluation demonstrates that this approach yields more uniform residual distributions and higher solution accuracy on representative 1D and 2D PDEs, while improving training stability and convergence speed.

Zhenzhen Huang, Haoyu Bian, Jiaquan Zhang +6

School of Information and Software Engineering, University of Electronic Science and Technology of China, Chengdu, China · Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China · Institute of Software Chinese Academy of Sciences, Beijing, China +1

Neural PDE Solvers Physics-Informed ML

Feb 17, 2026

Flowers: A Warp Drive for Neural PDE Solvers

We introduce Flowers, a neural architecture for learning PDE solution operators built entirely from multihead warps. Aside from pointwise channel mixing and a multiscale scaffold, Flowers use no Fourier multipliers, no dot-product attention, and no convolutional mixing. Each head predicts a displacement field and warps the mixed input features. Motivated by physics and computational efficiency, displacements are predicted pointwise, without any spatial aggregation, and nonlocality enters only through sparse sampling at source coordinates, one per head. Stacking warps in multiscale residual blocks yields Flowers, which implement adaptive, global interactions at linear cost. We theoretically motivate this design through three complementary lenses: flow maps for conservation laws, waves in inhomogeneous media, and a kinetic-theoretic continuum limit. Flowers achieve excellent performance on a broad suite of 2D and 3D time-dependent PDE benchmarks, particularly flows and waves. A compact 17M-parameter model consistently outperforms Fourier, convolution, and attention-based baselines of similar size, while a 150M-parameter variant improves over recent transformer-based foundation models with much more parameters, data, and training compute.

Till Muser, Alexandra Spitzer, Matti Lassas +2

Department of Mathematics and Computer Science, University of Basel, Basel, Switzerland · Department of Mathematics and Statistics, University of Helsinki, Helsinki, Finland · Simons Chair in Computational and Applied Mathematics and Earth Science, Rice University, Houston, TX, USA

Neural PDE Solvers PDE Surrogate Modeling PDE Operator Learning Neural Operators

Feb 16, 2026

BEACONS: Bounded-Error, Algebraically-Composable Neural Solvers for Partial Differential Equations

The traditional limitations of neural networks in reliably generalizing beyond the convex hulls of their training data present a significant problem for computational physics, in which one often wishes to solve PDEs in regimes far beyond anything which can be experimentally or analytically validated. In this paper, we show how it is possible to circumvent these limitations by constructing formally-verified neural network solvers for PDEs, with rigorous convergence, stability, and conservation properties, whose correctness can therefore be guaranteed even in extrapolatory regimes. By using the method of characteristics to predict the analytical properties of PDE solutions a priori (even in regions arbitrarily far from the training domain), we show how it is possible to construct rigorous extrapolatory bounds on the worst-case L^inf errors of shallow neural network approximations. Then, by decomposing PDE solutions into compositions of simpler functions, we show how it is possible to compose these shallow neural networks together to form deep architectures, based on ideas from compositional deep learning, in which the large L^inf errors in the approximations have been suppressed. The resulting framework, called BEACONS (Bounded-Error, Algebraically-COmposable Neural Solvers), comprises both an automatic code-generator for the neural solvers themselves, as well as a bespoke automated theorem-proving system for producing machine-checkable certificates of correctness. We apply the framework to a variety of linear and non-linear PDEs, including the linear advection and inviscid Burgers' equations, as well as the full compressible Euler equations, in both 1D and 2D, and illustrate how BEACONS architectures are able to extrapolate solutions far beyond the training data in a reliable and bounded way. Various advantages of the approach over the classical PINN approach are discussed.

Jonathan Gorard, Ammar Hakim, James Juno

Princeton University Princeton, NJ 08544, USA · Princeton Plasma Physics Laboratory Princeton, NJ 08540, USA

Neural PDE Solvers Partial Differential Equations Neural Network Generalization Neural Network Verification Neural Network Approximation Theory

Feb 16, 2026

Parameter-Minimal Neural DE Solvers via Horner Polynomials

We propose a parameter-minimal neural architecture for solving differential equations by restricting the hypothesis class to Horner-factorized polynomials, yielding an implicit, differentiable trial solution with only a small set of learnable coefficients. Initial conditions are enforced exactly by construction by fixing the low-order polynomial degrees of freedom, so training focuses solely on matching the differential-equation residual at collocation points. To reduce approximation error without abandoning the low-parameter regime, we introduce a piecewise ("spline-like") extension that trains multiple small Horner models on subintervals while enforcing continuity (and first-derivative continuity) at segment boundaries. On illustrative ODE benchmarks and a heat-equation example, Horner networks with tens (or fewer) parameters accurately match the solution and its derivatives and outperform small MLP and sinusoidal-representation baselines under the same training settings, demonstrating a practical accuracy-parameter trade-off for resource-efficient scientific modeling.

T. Matulić, D. Seršić

Dept. of Electronic Systems and Information Processing, Faculty of Electrical Engineering and Computing, University of Zagreb, Zagreb, Croatia

Neural PDE Solvers Polynomial Neural Networks Ordinary Differential Equations PDE Solving Physics-Informed ML

Feb 14, 2026

A Unified Physics-Informed Neural Network for Modeling Coupled Electro- and Elastodynamic Wave Propagation Using Three-Stage Loss Optimization

Physics-Informed Neural Networks present a novel approach in SciML that integrates physical laws in the form of partial differential equations directly into the NN through soft constraints in the loss function. This work studies the application of PINNs to solve a one dimensional coupled electro-elastodynamic system modeling linear piezoelectricity in stress-charge form, governed by elastodynamic and electrodynamic equations. Our simulation employs a feedforward architecture, mapping space-time coordinates to mechanical displacement and electric potential. Our PINN model achieved global relative L2 errors of 2.34 and 4.87 percent for displacement and electric potential respectively. The results validate PINNs as effective mesh free solvers for coupled time-dependent PDE systems, though challenges remain regarding error accumulation and stiffness in coupled eigenvalue systems.

Suhas Suresh Bharadwaj, Reuben Thomas Thovelil

Department of Electrical and Electronics Engineering, BITS Pilani, Dubai Campus, Dubai, United Arab Emirates

Neural PDE Solvers PDE Solving Physics-Informed ML Multiphysics Simulation

Feb 4, 2026

Transolver-3: Scaling Up Transformer Solvers to Industrial-Scale Geometries

Deep learning has emerged as a transformative tool for the neural surrogate modeling of partial differential equations (PDEs), known as neural PDE solvers. However, scaling these solvers to industrial-scale geometries with over

10^8

cells remains a fundamental challenge due to the prohibitive memory complexity of processing high-resolution meshes. We present Transolver-3, a new member of the Transolver family as a highly scalable framework designed for high-fidelity physics simulations. To bridge the gap between limited GPU capacity and the resolution requirements of complex engineering tasks, we introduce two key architectural optimizations: faster slice and deslice by exploiting matrix multiplication associative property and geometry slice tiling to partition the computation of physical states. Combined with an amortized training strategy by learning on random subsets of original high-resolution meshes and a physical state caching technique during inference, Transolver-3 enables high-fidelity field prediction on industrial-scale meshes. Extensive experiments demonstrate that Transolver-3 can handle meshes with over 160 million cells, achieving impressive performance across three challenging simulation benchmarks, including aircraft and automotive design tasks. Code is available at https://github.com/thuml/Transolver-3.

Hang Zhou, Haixu Wu, Haonan Shangguan +4

School of Software, BNRist, Tsinghua University, China.

Efficient Neural Network Inference Neural PDE Solvers Transformer Neural Operator PDE Surrogate Modeling PDE Operator Learning Neural Operators

Jan 1, 2026

Deep Neural Networks as Discrete Dynamical Systems: Implications for Physics-Informed Learning

We revisit the analogy between feed-forward deep neural networks (DNNs) and discrete dynamical systems derived from neural integral equations and their corresponding partial differential equation (PDE) forms. A comparative analysis between the numerical/exact solutions of the Burgers' and Eikonal equations, and the same obtained via PINNs is presented. We show that PINN learning provides a different computational pathway compared to standard numerical discretization in approximating essentially the same underlying dynamics of the system. Within this framework, DNNs can be interpreted as discrete dynamical systems whose layer-wise evolution approaches attractors, and multiple parameter configurations may yield comparable solutions, reflecting the degeneracy of the inverse mapping. In contrast to the structured operators associated with finite-difference (FD) procedures, PINNs learn dense parameter representations that are not directly associated with classical discretization stencils. This distributed representation generally involves a larger number of parameters, leading to reduced interpretability and increased computational cost. However, the additional flexibility of such representations may offer advantages in high-dimensional settings where classical grid-based methods become impractical.

Abhisek Ganguly, Santosh Ansumali, Sauro Succi

Engineering Mechanics Unit, Jawaharlal Nehru Centre for Advanced Scientific Research, Jakkur, Bangalore, 560064, Karnataka, India · Italian Institute of Technology, Viale Regina Elena 291, 00161 Rome, Italy · University of Roma Tre, Italy +2

Dynamical Systems Neural PDE Solvers Physics-Informed ML Neural Network Training Dynamics

Dec 29, 2025

PGOT: A Physics-Geometry Operator Transformer for Complex PDEs

While Transformers have demonstrated remarkable potential in modeling Partial Differential Equations (PDEs), modeling large-scale unstructured meshes with complex geometries remains a significant challenge. Existing efficient architectures often employ feature dimensionality reduction strategies, which inadvertently induces Geometric Aliasing, resulting in the loss of critical physical boundary information. To address this, we propose the Physics-Geometry Operator Transformer (PGOT), designed to reconstruct physical feature learning through explicit geometry awareness. Specifically, we propose Spectrum-Preserving Geometric Attention (SpecGeo-Attention). Utilizing a ``physics slicing-geometry injection" mechanism, this module incorporates multi-scale geometric encodings to explicitly preserve multi-scale geometric features while maintaining linear computational complexity

O(N)

. Furthermore, PGOT dynamically routes computations to low-order linear paths for smooth regions and high-order non-linear paths for shock waves and discontinuities based on spatial coordinates, enabling spatially adaptive and high-precision physical field modeling. PGOT achieves consistent state-of-the-art performance across four standard benchmarks and excels in large-scale industrial tasks including airfoil and car designs.

Zhuo Zhang, Xi Yang, Ying Miao +5

National University of Defense Technology · Peking University · National University of Singapore +2

Neural PDE Solvers PDE Surrogate Modeling Geometric Representation Learning PDE Operator Learning Neural Operators

Dec 22, 2025

Adaptive Probability Flow Residual Minimization for High-Dimensional Fokker-Planck Equations

Solving high-dimensional Fokker-Planck (FP) equations remains a challenging problem in computational physics and stochastic dynamics, due to the curse of dimensionality, unbounded domains, and complex probability landscapes. In this work, we propose an adaptive probability flow residual minimization (A-PFRM) method for this problem. The second-order FP equation is reformulated as an equivalent first-order continuity equation associated with the probability flow ordinary differential equation, based on which a loss function is constructed to train neural network approximations without Hessian computation. To further improve the computational efficiency, the Hutchinson trace estimator is applied to compute the divergence in the corresponding score function, such that the training time can be dimension-independent on GPUs. Adaptive sampling strategies are employed to generate the collocation points, and our analysis shows that the Kullback-Leibler divergence between our A-PFRM approximation and the exact solution is bounded by the residual loss weighted by the estimated density function. Numerical experiments are presented to demonstrate the performance of A-PFRM, which include Ornstein-Uhlenbeck (OU) processes problems, Brownian motions with time-varying diffusion, and Geometric OU processes featuring non-Gaussian solutions up to one hundred dimensions.

Xiaolong Wu, Qifeng Liao

School of Information Science and Technology, ShanghaiTech University, Shanghai, 201210, China

Neural PDE Solvers PDE Solving Adaptive Sampling Fokker–Planck Equation

Nov 19, 2025

Neural network-driven domain decomposition for efficient solutions to the Helmholtz equation

Accurately simulating wave propagation is crucial in fields such as acoustics, electromagnetism, and seismic analysis. Traditional numerical methods, like finite difference and finite element approaches, are widely used to solve governing partial differential equations (PDEs) such as the Helmholtz equation. However, these methods face significant computational challenges when applied to high-frequency wave problems in complex two-dimensional domains. This work investigates Finite Basis Physics-Informed Neural Networks (FBPINNs) and their multilevel extensions as a promising alternative. These methods leverage domain decomposition, partitioning the computational domain into overlapping sub-domains, each governed by a local neural network. We assess their accuracy and computational efficiency in solving the Helmholtz equation for the homogeneous case, demonstrating their potential to mitigate the limitations of traditional approaches.

Victorita Dolean, Daria Hrebenshchykova, Stéphane Lanteri +1

Department of Mathematics and Computer Science, Eindhoven University of Technology, The Netherlands · Atlantis project-team, Inria Research Center at Université Côte d’Azur, France · MACARON project-team, Université de Strasbourg, CNRS, Inria, IRMA, France

Neural PDE Solvers PDE Solving Domain Decomposition Methods Physics-Informed ML

Oct 29, 2025

LieSolver: PDE-Constrained Learning for IBVPs via Lie Symmetries

Initial-boundary value problems (IBVPs) provide the essential framework for modelling a wide range of phenomena in physics and engineering. We introduce a novel method for efficiently solving IBVPs using Lie symmetries to enforce the associated partial differential equation (PDE) exactly by construction. By leveraging symmetry transformations, our model embeds the underlying physical laws and learns the solution solely from initial and boundary data. Consequently, the boundary loss directly quantifies domain-wide error, enabling rigorous error estimation for well-posed IBVPs. We implement LieSolver and demonstrate its application to linear homogeneous PDEs, showing that it outperforms physics-informed neural networks (PINNs) in both speed and accuracy while yielding compact models. Overall, our approach significantly enhances the efficiency and reliability of predictions for PDE-constrained problems.

René P. Klausen, Ivan Timofeev, Jonas Naujoks +4

Department of Artificial Intelligence, Fraunhofer Heinrich Hertz Institute, Berlin, Germany · Department of Electrical Engineering and Computer Science, Technische Universität Berlin, Germany · BIFOLD Berlin Institute for the Foundations of Learning and Data, Berlin, Germany +1

Neural PDE Solvers PDE Solving Physics-Informed ML

Aug 29, 2025

Convergence of Stochastic Gradient Methods for Wide Two-Layer Physics-Informed Neural Networks for the Poisson Equation

Physics informed neural networks (PINNs) represent a very popular class of neural solvers for partial differential equations. In practice, one often employs stochastic gradient descent type algorithms to train the neural network. Therefore, the convergence guarantee of stochastic gradient descent is of fundamental importance. In this work, we establish the linear convergence of stochastic gradient descent / flow in training over-parameterized two layer PINNs with a general class of activation functions for solving one model second-order elliptic problem, i.e., the Poisson equation, in the sense of high probability. These results extend the existing result [20] in which gradient descent was analyzed. The challenge of the analysis lies in handling the dynamic randomness introduced by stochastic optimization methods. The key of the analysis lies in ensuring the positive definiteness of suitable Gram matrices during the training. The analysis sheds insight into the dynamics of the optimization process, and provides guarantees on physics informed neural networks trained by stochastic algorithms.

Bangti Jin, Longjun Wu

Department of Mathematics, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong, P.R. China

Neural PDE Solvers PDE Solving Stochastic Optimization Convergence Physics-Informed ML Stochastic Gradient Descent

May 16, 2025

Accelerating Natural Gradient Descent for PINNs with Randomized Numerical Linear Algebra

Natural Gradient Descent (NGD) has emerged as a promising optimization algorithm for training neural network-based solvers for partial differential equations (PDEs), such as Physics-Informed Neural Networks (PINNs). However, its practical use is often limited by the high computational cost of solving linear systems involving the Gramian matrix. While matrix-free NGD methods based on the conjugate gradient (CG) method avoid explicit matrix inversion, the ill-conditioning of the Gramian significantly slows the convergence of CG. In this work, we extend matrix-free NGD to broader classes of problems than previously considered and propose the use of Randomized Numerical Linear Algebra (RandNLA) techniques for efficient preconditioning of the inner CG solver. The resulting algorithms demonstrate substantial performance improvements over existing NGD-based methods on a range of PDE problems discretized using neural networks, and offer competitive results compared to other state-of-the-art optimizers.

Ivan Bioli, Carlo Marcati, Giancarlo Sangalli

Department of Mathematics, University of Pavia, 27100 Pavia, Italy · Department of Civil Engineering and Architecture, University of Pavia, 27100 Pavia, Italy · Institut Camille Jordan, Lyon 1 Université, 69622 Villeurbanne, France +1

Neural PDE Solvers Gradient Descent Physics-Informed ML

Feb 24, 2025

Gabor-Enhanced Physics-Informed Neural Networks for Fast Simulations of Acoustic Wavefields

Physics-Informed Neural Networks (PINNs) have gained attention for solving partial differential equations, including the scattered Helmholtz equation, due to their flexibility and mesh-free formulation. However, their performance suffers from low-frequency bias, particularly in high-frequency wavefield simulations, limiting convergence speed and accuracy. To address this, we propose a novel and simplified PINN framework that incorporates explicit, trainable Gabor basis functions to efficiently capture the localized and oscillatory nature of wavefields. Unlike previous Gabor-based PINNs that rely on multiplicative filters or auxiliary networks to learn Gabor parameters, our approach redefines the network's task as learning a nonlinear mapping from input coordinates to a custom Gabor coordinate system, where a Gabor function captures the dominant oscillatory behavior of the wavefield. This formulation absorbs the effect of two Gabor parameters into the learned mapping, reducing computational complexity and eliminating the need for manual tuning of hyperparameters. We also present an efficient formulation for incorporating a Perfectly Matched Layer (PML) into the training by deriving real-valued loss components and introducing an analytical expression for the background wavefield. Numerical experiments on various velocity models show that our Gabor-PINN achieves faster convergence, higher accuracy, and greater robustness to architectural design and initialization compared to both traditional PINNs and prior Gabor-based methods. The improvement lies not in adding architectural complexity --as is common in enhanced PINNs -- but in absorbing this complexity into the learned coordinate transformation, making the method both simpler and more effective. Our implementation is publicly available to support reproducibility and future research.

Mohammad Mahdi Abedi, David Pardo, Tariq Alkhalifah

Basque Center for Applied Mathematics, Bilbao, Spain · University of the Basque Country, Department of Mathematics, Spain · Ikerbasque, Basque Foundation for Science, Bilbao, Spain +1

Neural PDE Solvers PDE Solving Physics-Informed ML