Систематический обзор современных численных методов решения уравнений в частных производных
Comparative synthesis of representative PDE solution methods
Paradigm | Core idea | Best-fit regime | Geometry / mesh handling | Key strengths | Main limitations and compute notes |
Reduced Basis Methods (RBM) , , | Projection-based reduced-order model built on a high-fidelity discretization. | Repeated queries for parametrized PDEs, optimal control, and inverse problems. | Medium; strongest when parametrization and the reference model are well defined. | Certified error estimates; offline/online split; strong classical numerical grounding. | Intrusive and less flexible for rapidly changing geometries; best when the solution manifold is smooth. |
DGM / high-dimensional deep solvers , | Train a neural ansatz on randomly sampled space-time points instead of a mesh. | High-dimensional PDEs where classical grids are infeasible, especially finance and control. | Meshfree, but typically demonstrated on simpler domains rather than irregular engineering geometries. | Avoids explicit meshes; demonstrated at very high dimension in representative studies. | Per-problem training cost is high; optimization replaces, rather than removes, heavy computation. |
PINNs , , , , | Neural solution representation constrained by PDE residuals, initial conditions, and boundary conditions. | Forward and inverse problems with sparse data or strong physics constraints. | Meshfree and flexible; can encode Dirichlet, Neumann, Robin, and periodic conditions. | Data-efficient and physically informed; natural for inverse and hybrid data-physics workflows. | Training pathologies include spectral bias, gradient imbalance, and causality issues; weak on high-frequency or multiscale solutions without advanced strategies. |
DeepONet , , | Operator learning with branch and trunk networks mapping input functions to output functions. | Many-query parametric PDE families where amortized inference matters. | Medium-high; can pair with CNN or GNN branches and is not tied to one geometry class. | Fast reuse after training; robust in noisy and complex settings. | Needs supervised training data and architecture tuning; upfront training cost can be substantial. |
FNO , , , | Neural operator with an integral kernel parameterized in Fourier space. | Structured-grid parametric PDE families needing fast inference. | Low-medium; strongest on regular domains and grid-like data. | Very fast inference and zero-shot super-resolution in benchmark settings. | Performance often degrades with noisy inputs or complex geometries; less natural for irregular domains. |
PINO , | Hybrid neural operator combining data supervision with PDE constraints, often at higher resolution. | Operator learning when physical validity and high-resolution fidelity matter. | Medium; inherits operator-learning structure while adding physics constraints. | Better generalization and physical validity than pure FNO, while retaining large speedups. | Still depends on operator-learning infrastructure and fine-tuning; not as geometry-native as graph-mesh approaches. |
MeshGraphNets , , | Graph-network simulator operating directly on meshes and allowing adaptive remeshing. | Irregular geometries, adaptive meshes, mechanics, cloth, and fluid problems. | Very high; built for unstructured irregular meshes and adaptive discretization. | Resolution-independent dynamics; adaptivity concentrates compute where gradients are strong. | Requires graph-based training data and rollout design; lacks classical certification. |
MP-PDE solvers , | Autoregressive message-passing solver with stability-oriented training. | Generalization across resolution, topology, geometry, discretization regularity, and boundary conditions. | Very high; graph representation supports irregular sampling, geometry, and topology changes. | Fast, stable, and accurate in 1D and 2D tests; explicitly connected to FDM, FVM, and WENO ideas. | Training remains nontrivial and error bounds are not certified; best viewed as a neural-numerical hybrid. |
PDEformer , | Pretrained graph-transformer plus implicit neural representation for cross-family PDE solving. | Zero-shot or few-shot transfer and inverse coefficient recovery across one-dimensional PDE families. | Currently low in geometry scope because published evidence is still largely one-dimensional. | Promising foundation-model direction with zero-shot transfer and rapid fine-tuning. | Current evidence remains mostly one-dimensional, and pretraining is heavy relative to narrower expert models. |
