New boundary treatment improves accuracy for complex PDEs.
problem Order reduction in high-order IMEX schemes for multidimensional PDEs.
method Novel boundary treatment algorithms for Cartesian meshes, treating implicit-explicit stages similarly to interior points.
result Recovery of designed order of convergence by numerical verification.
DINo forecasts PDEs with flexible extrapolation and adaptability.
problem Fixed discretizations limit real-world PDE forecasting.
method DINo uses implicit neural representations for continuous-time dynamics.
result DINo outperforms other neural PDE forecasters.
In recent years, data-driven methods have been developed to learn dynamical systems and partial differential equations (PDE). The goal of such work is discovering unknown physics and the corresponding equations. However, prior to achieving this goal, major challenges remain to be resolved, including learning PDE under …
This paper solves PDEs for embedding discrete lattices into smooth manifolds.
problem Embedding discrete lattices into smooth manifolds while preserving geometric and topological properties.
method Rigorous mathematical framework and analysis of partial differential equations (PDEs).
result Existence and regularity of solutions to PDEs under initial boundary conditions.
Physics-informed deep learning for PDEs solves forward and inverse problems efficiently.
problem Solving forward and inverse problems in parametric PDEs efficiently and accurately.
method Physics-informed deep latent variable model (PDDLVM) combining deep neural networks, probabilistic modelling, and variational inference.
result Achieves up to three orders of magnitude speed-up compared to traditional FEM while providing coherent uncertainty estimates.
The stability and robustness of compact schemes for parabolic PDEs are analyzed.
problem Stability and robustness of compact schemes for solving parabolic PDEs.
method Compact spatial discretization, Crank-Nicolson temporal discretization, eigenvalue analysis of amplification matrix.
result An upper bound on the condition number of the amplification matrix is derived, showing stability.
This paper presents a geometric-variational approach to continuous and discrete mechanics and field theories. Using multisymplectic geometry, we show that the existence of the fundamental geometric structures as well as their preservation along solutions can be obtained directly from the variational principle. In parti…
Graph neural networks learn PDEs from sparse, irregular data.
problem Learning PDEs from irregularly spaced data.
method Continuous-time differential model with graph neural networks for arbitrary discretizations.
result Efficient inference with continuous-time adjoint method.
PAGP uses physics-assisted Gaussian processes to solve and learn PDEs.
problem Solving and discovering unknown coefficients in PDEs with initial and boundary conditions.
method Physics-assisted Gaussian processes with continuous, discrete, and hybrid models.
result Effective in solving and discovering unknown coefficients in PDEs.
Constructs minimal surfaces in a 3-ball using PDE gluing.
problem Finding minimal surfaces in a 3-ball with boundary constraints.
method PDE gluing construction of discrete free boundary minimal annuli.
result Discrete family of non-rotational free boundary minimal annuli in a unit 3-ball.
Develops numerical methods for PDEs on hypergraphs and networks.
problem Solving PDEs on complex geometric structures like hypergraphs and networks.
method Hybrid finite element methods, focusing on hybrid discontinuous Galerkin methods.
result Derives numerical approximations for PDEs on hypergraphs and networks.
This article presents a new methodology called deep Theory of Functional Connections (TFC) that estimates the solutions of partial differential equations (PDEs) by combining neural networks with TFC. TFC is used to transform PDEs with boundary conditions into unconstrained optimization problems by embedding the boundar…
Flow Annealing Posterior Sampling unifies stochastic-process regression and PDE inverse problems.
problem Function-space posterior sampling for stochastic processes and inverse problems.
method Flow Annealing Posterior Sampling (FAPS) using pretrained function-space flow-matching priors.
result Coherent posterior samples with accurate uncertainty quantification.
FunDPS improves PDE solution recovery from sparse data.
problem Recovering whole solutions from sparse or noisy measurements in PDEs.
method Function-space diffusion model with gradient-based guidance.
result FunDPS achieves 32% accuracy improvement over state-of-the-art methods.
Implicit schemes are popular methods for the integration of time dependent PDEs such as hyperbolic and parabolic PDEs. However the necessity to solve corresponding linear systems at each time step constitutes a complexity bottleneck in their application to PDEs with rough coefficients. We present a generalization of ga…
The comparison principle for scalar second order parabolic PDEs on functions u(t,x) admits a topological interpretation: pairs of solutions, u1(t,⋅) and u2(t,⋅), evolve so as to not increase the intersection number of their graphs. We generalize to the case of multiple solutions $\{u^α(t,\cdot)\}_{α=1}^…
New method uses Gaussian processes to improve PDE solver accuracy.
problem Uncertainty in PDE solver parameters and measurements.
method Physics-informed Gaussian process regression.
result Strictly generalizes weighted residual methods.
Study improves sampling efficiency of diffusion models using RL and PDEs.
problem Training neural stochastic differential equations without access to target samples.
method Proves equivalences between RL methods and PDEs, uses coarse time discretization.
result Improves sample efficiency and reduces computational cost.
GRAND treats GNNs as PDE discretizations, addressing graph learning issues.
problem Graph learning issues like depth, oversmoothing, and bottlenecks.
method Models GNNs as a continuous diffusion process, treating them as PDE discretizations.
result Linear and nonlinear versions of GRAND achieve competitive results on graph benchmarks.
Simplicial, piecewise-flat discretizations of manifolds provide a clear path towards curvature analysis on discrete geometries and for solutions of PDE's on manifolds of complex topologies. In this manuscript we review and expand on discrete exterior calculus methods using hybrid domains. We then analyze the geometric …
Machine learning for scientific applications faces the challenge of limited data. We propose a framework that leverages a priori known physics to reduce overfitting when training on relatively small datasets. A deep neural network is embedded in a partial differential equation (PDE) that expresses the known physics and…
This research analyzes deep PDE solvers for option pricing accuracy.
problem Understanding the accuracy of deep learning methods for solving PDEs in option pricing.
method Comparative experiments with two neural network algorithms in Black--Scholes and Heston models.
result Empirical convergence rates and training times of TDGF method determined.
Develops a numerical scheme for solving path-dependent FBSDEs and PDEs.
problem Solving path-dependent FBSDEs and PDEs numerically.
method Picard iteration method for FBSDEs, concentration inequality for estimator, supervised learning with neural networks for PDEs.
result Proves convergence and rate of convergence for the Picard iteration method.
GIT-Net uses neural networks to approximate PDE operators efficiently.
problem Approximating PDE operators for complex geometries.
method Parametrizes adaptive generalized integral transforms with deep neural networks.
result GIT-Net outperforms existing neural network operators in multiple areas.
Space mapping speeds up shape optimization for PDEs.
problem Efficiently solving shape optimization problems constrained by PDEs.
method Combines fine and coarse model optimizations using Riemannian metrics.
result Space mapping methods are highly efficient for complex shape optimization problems.
A new machine learning method solves high-dimensional Kolmogorov PDEs efficiently.
problem Solving high-dimensional Kolmogorov PDEs and SDEs.
method Stochastic weighted minimization and stochastic gradient descent with Malliavin weights.
result Accurate approximation of high-dimensional Kolmogorov PDEs and SDEs without curse of dimensionality.
AAS optimizes neural network PDE approximations by adaptively sampling.
problem Statistical errors from random samples in neural network PDE approximations.
method Minmax formulation to optimize neural network and training set samples.
result Reduces Monte Carlo approximation error for a given sample size.
In this paper we propose a new model-based unsupervised learning method, called VarNet, for the solution of partial differential equations (PDEs) using deep neural networks (NNs). Particularly, we propose a novel loss function that relies on the variational (integral) form of PDEs as apposed to their differential form …
Unified framework for forward and inverse PDE problems in multiphase media.
problem Non-differentiable inverse problems in discrete-valued material fields.
method GenPANIS: Latent-variable generative framework preserving discrete microstructures.
result Unified bidirectional inference with minimal labeled pairs and physics-aware decoder.
We consider a two-factor model for the valuation of a non callable defaultable bond which pays coupons at certain given dates. The model under consideration is the Jump to Default Constant Elasticity of Variance (JDCEV) model. The JDCEV model is an improvement of the reduced form approach, which unifies credit and equi…
D2SRM solves complex PDEs using deep learning.
problem High-dimensional, Hessian-dependent fully nonlinear parabolic PDEs.
method Single scalar space-time network generating derivative-consistent approximations trained through residuals and penalties.
result Well-posedness and convergence theory established for globally Lipschitz equations.
Efficiently values and computes sensitivities of Bermudan options using Method of Lines.
problem Valuation and sensitivities of Bermudan options.
method Method of Lines converting Black Scholes PDE to ODEs, spatial discretization, exponential matrix operation for efficiency.
result Computational efficiency and straightforward implementation for computing sensitivities.
PANIS learns PDE surrogates for heterogeneous materials without solving the PDE.
problem Learning surrogates for parametrized PDEs in heterogeneous media.
method Physics-aware neural implicit solvers combining probabilistic learning and physics-informed discretization.
result Learned surrogates for effective solutions in heterogeneous materials without solving the reference problem.
PILNO uses neural operators to solve PDEs efficiently on point clouds.
problem Solving partial differential equations (PDEs) on point cloud data efficiently.
method Physics-informed low-rank neural operator framework combining low-rank kernel approximations and an encoder-decoder architecture.
result PILNO efficiently approximates solution operators of PDEs on point cloud data, satisfying PDE constraints and boundary conditions.
Applications in quantitative finance such as optimal trade execution, risk management of options, and optimal asset allocation involve the solution of high dimensional and nonlinear Partial Differential Equations (PDEs). The connection between PDEs and systems of Forward-Backward Stochastic Differential Equations (FBSD…
Novel approach ensures stability of compact schemes for variable PDEs.
problem Ensuring stability of compact schemes for variable coefficient PDEs.
method Difference equation approach to derive stability conditions.
result Derives sufficient condition for unconditional stability.
Calibration of stochastic local volatility (SLV) models to their underlying local volatility model is often performed by numerically solving a two-dimensional non-linear forward Kolmogorov equation. We propose a novel finite volume (FV) discretization in the numerical solution of general 1D and 2D forward Kolmogorov eq…
New framework uses PDE for no-regret generative modeling.
problem Developing efficient generative models for complex distributions.
method Iterative refinement of Brenier maps using mirror gradient descent.
result Converges to optimal Brenier map under various step-size schedules.
Given a data set and a subset of labels the problem of semi-supervised learning on point clouds is to extend the labels to the entire data set. In this paper we extend the labels by minimising the constrained discrete p-Dirichlet energy. Under suitable conditions the discrete problem can be connected, in the large da…
This paper deals with stability in the numerical solution of the prominent Heston partial differential equation from mathematical finance. We study the well-known central second-order finite difference discretization, which leads to large semi-discrete systems with non-normal matrices A. By employing the logarithmic sp…
A new method solves complex financial equations efficiently.
problem Solving worst-case and best-case prices for two-factor uncertain volatility models.
method Decompose and integrate, then optimize; piecewise constant control; closed-form Green's functions; 2D convolution integrals; monotone numerical integration; Fast Fourier Transforms.
result The method efficiently computes the value function and optimal control, converging to the viscosity solution of the HJB equation.
A contour integral method recently proposed by Weideman [IMA J. Numer. Anal., to appear] for integrating semi-discrete advection-diffusion PDEs, is extended for application to some of the important equations of mathematical finance. Using estimates for the numerical range of the spatial operator, optimal contour parame…
Generative network integrates into ROM for PDEs, matching measurements and estimating uncertainties.
problem Predicting and quantifying uncertainties in numerical simulations of PDEs.
method Generative network (GN) integrated into a reduced-order model (ROM) framework for inverse problems.
result GN-based ROM efficiently quantifies uncertainty and matches measurements with high accuracy.
Mixed finite element methods solve a PDE using two or more variables. The theory of Discrete Exterior Calculus explains why the degrees of freedom associated to the different variables should be stored on both primal and dual domain meshes with a discrete Hodge star used to transfer information between the meshes. We s…
A new graph neural network framework captures long-range interactions efficiently.
problem Efficiently modeling long-range interactions in graph neural networks for PDEs.
method Proposes a multi-level graph neural network framework using multipole methods.
result Captures interaction at all ranges with only linear complexity, learning discretization-invariant solution operators.
Unified framework for sampling from complex densities using PDEs and neural networks.
problem Sampling from complicated probability densities.
method Dynamical measure transport via PDEs and physics-informed neural networks (PINNs).
result Significantly better mode coverage and high accuracy in sampling.
New method uses tensor trains for efficient PDE approximation.
problem High-dimensional PDEs and the curse of dimensionality.
method Tensor trains and backward stochastic differential equations for parabolic PDEs.
result Achieves a favorable trade-off between accuracy and computational efficiency.
Scalable solver reduces PDE uncertainty with active learning.
problem High computational cost in solving PDEs.
method Stochastic dual descent and clustering-based active learning.
result Solver scales to large number of collocation points.