Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

11223243 · May 202619922001200920172026
48 results for Time-dependent PDEs

Probabilistic method combines space and time uncertainties in PDEs.

problem Separate treatment of space and time in PDE solvers obscures interactions and error quantification.
method Gaussian process interpretation of finite difference methods interacting with probabilistic ODE solvers.
result Joint quantification of space- and time-uncertainty possible without sacrificing ODE solver performance.

New quantum algorithm simplifies complex financial derivatives pricing.

problem Complex financial derivatives pricing with high dimensionality.
method Quantum-inspired variational algorithms combined with neural-network quantum states.
result Simplified pricing of European options with many correlated assets.

GrADE uses graph neural networks and Neural ODE for solving time-dependent nonlinear PDEs efficiently.

problem Solving time-dependent nonlinear PDEs is computationally challenging and time-consuming.
method GrADE combines graph neural networks for spatial modeling and Neural ODE for temporal modeling, using attention mechanisms.
result GrADE efficiently solves PDEs, demonstrating scalability and better accuracy compared to existing methods.

LR-EDNN reduces PDE solver complexity by limiting network weights to low-rank subspace.

problem Efficiently solving time-dependent PDEs with deep neural networks.
method Low-rank constraint on network weights using SVD for efficient parameter updates.
result LR-EDNN achieves comparable accuracy to full EDNN with fewer parameters and lower cost.

A new method uses deep learning to efficiently solve complex physics equations in high dimensions.

problem Efficiently solving high-dimensional time-dependent PDEs with dynamic solutions.
method Deep adaptive sampling framework for PINNs extended to spacetime domains using normalizing flows.
result The method effectively identifies and tracks high-residual regions in both space and time.

Temporal Normalizing Flows enhance density estimation of time-dependent data.

problem Accurate and robust density estimation of time-dependent stochastic data.
method Leveraging normalizing flows for temporal data, tNFs estimate multi-scale distributions without prior scale knowledge.
result Temporal Normalizing Flows improve density estimation of time-dependent data, including multi-scale distributions.

Graph Neural Simulators improve data efficiency for PDE surrogates.

problem Lack of data efficiency in neural operators for PDE systems.
method Graph Neural Simulators (GNS) leverage message-passing and numerical time-stepping to learn PDE dynamics efficiently.
result GNS achieves less than 1% relative L2 error using only 3% of available trajectories.

The paper develops methods to derive mixed superposition rules for Lie systems and applies them to various physical systems.

problem Finding general solutions for Lie systems.
method Develops mixed superposition rules for Lie systems with imprimitive Lie algebras and semidirect sums.
result Extends coalgebra method to Lie systems of partial differential equations.

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.

Study methods to recover unknown processes in PDEs from data.

problem Identifying unknown processes in time-dependent PDEs using observational data.
method Theoretical analysis and numerical approaches including Galerkin and collocation algorithms.
result The Galerkin algorithm is more suitable for practical situations with noisy data.

FM4PDE learns PDE solutions from sparse data.

problem Reconstructing PDE solutions from limited observations.
method Flow-matching generative framework that learns PDE coefficients and solutions.
result Error guarantees for guided procedures, including deterministic and stochastic samplers.

In this paper we study a flow by minkowskian curvature where we have a different Minkowski plane at each time. We derive some evolution formulas, present sufficient hypotesis for the short time existence and convexity of solutions and study the motion considering a particular type of families of Minkowski norms. Also, …

2014-10-14abs ↗pdf ↗

Study optimal consumption with drawdown limits over a fixed time frame.

problem Maximizing utility with consumption limits during a fixed period.
method Extended utility maximization problem with drawdown constraint, using PDE arguments and dual transform.
result Existence and uniqueness of classical solution to HJB variational inequality, with explicit free boundaries.

Paper proposes an analytical pricing model for puttable bonds with credit risk.

problem Analytical pricing of puttable bonds with credit risk.
method Developed a 2-factor structural PDE model and derived analytical pricing formula under specific conditions.
result Derived analytical pricing formula for puttable bonds with credit risk.

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.

G-FuNK learns solutions for nonlinear PDEs on multiple domains and parameters.

problem Predicting time-dependent dynamics of complex systems governed by nonlinear PDEs with varying parameters and domains.
method Graph Fourier Neural Kernels combining domain-adapted and transferable components for non-diffusive and diffusive terms.
result G-FuNK achieves low relative errors on unseen domains and fiber fields, significantly accelerating predictions.

New method uses randomized sparse neural networks to solve time-dependent PDEs more accurately and efficiently.

problem Numerical challenges in training neural networks sequentially in time to solve time-dependent PDEs.
method Introduces Neural Galerkin schemes that update randomized sparse subsets of network parameters at each time step.
result Up to two orders of magnitude more accurate and two orders of magnitude faster than dense update schemes.

Physics-informed DeepONets solve PDEs without paired data, predicting solutions quickly.

problem Lack of paired input-output data for solving PDEs.
method Physics-informed DeepONets use automatic differentiation to enforce physical laws as soft penalty constraints.
result Physics-informed DeepONets can solve PDEs without paired data, predicting solutions up to 3 orders of magnitude faster.

Wave propagation framework using cone structures and observers' vector fields.

problem Describing classic wave propagation in anisotropic media.
method Introduces a cone structure CC and an observers' vector field t\partial_t to describe wave propagation.
result Reduces the PDE for wavefronts to ODE for cone geodesics of CC.

We study the geometry of a codimension-one foliation with a time-dependent Riemannian metric. The work begins with formulae concerning deformations of geometric quantities as the Riemannian metric varies along the leaves of the foliation. Then the Extrinsic Geometric Flow depending on the second fundamental form of the…

2011-08-25abs ↗pdf ↗

Study shows neural operators can efficiently solve complex reaction-diffusion systems.

problem Efficiently solving nonlinear reaction-diffusion systems using neural operators.
method Laplacian-based neural operators applied to a generalized Gierer-Meinhardt system.
result Explicit approximation error bounds established for neural operators in terms of network parameters.

A neural network approach to compute stable metrics for numerical simulation data.

problem Computing stable and generalizing metrics for diverse numerical simulation data.
method A Siamese neural network architecture with a specialized loss function trained on a controlled data generation setup.
result LSiM outperforms existing metrics for vector spaces and image-based metrics.

In this paper we investigate the effectiveness of Alternating Direction Implicit (ADI) time discretization schemes in the numerical solution of the three-dimensional Heston-Hull-White partial differential equation, which is semidiscretized by applying finite difference schemes on nonuniform spatial grids. We consider t…

2011-11-17abs ↗pdf ↗

LFlows model fluid densities and velocities using invertible maps that satisfy the continuity equation.

problem Modeling fluid densities and velocities continuously in space and time.
method LFlows are based on invertible maps that satisfy the continuity equation, derived from classical theory of Lagrangian flows for smooth vector fields.
result LFlows show higher predictive accuracy in density modeling tasks compared to competing models in 2D and 3D.

LUNO linearizes neural operators to quantify their predictive uncertainty.

problem Quantifying the predictive error of neural operators for high-stakes simulations.
method Model linearization to push weight-space uncertainty forward to predictions.
result LUNO provides a practical and theoretically sound way to apply Bayesian methods to neural operators.

Probabilistic proof of smooth boundaries in optimal stopping problems.

problem Continuous differentiability of time-dependent optimal boundaries in optimal stopping problems.
method Local probabilistic arguments for a wider range of conditions.
result First probabilistic proof of continuous differentiability under general conditions.

Bayesian framework calibrates imperfect models using physics-informed priors and Hamiltonian Monte Carlo.

problem Quantifying uncertainty in imperfect computer models described by differential equations.
method Physics-informed Gaussian process priors, discrepancy function, Hamiltonian Monte Carlo, data approximations.
result Framework accurately recovers true parameters and produces accurate predictions.

HS-FNO models non-Markovian PDEs by learning history and future states.

problem Non-Markovian dynamics where future states depend on past history.
method History-Space Fourier Neural Operator (HS-FNO) for delay and memory-driven PDEs.
result HS-FNO achieves lowest aggregate errors across various PDE families.

Study on relativistic nonholonomic mechanics with time-dependent constraints.

problem Formulating classical time-dependent nonholonomic mechanics.
method Invariant formulation using moving frames and Chaplygin systems.
result Hamiltonization of time-dependent constraints achieved.

The aim of this paper is to geometrize time dependent Lagrangian mechanics in a way that the framework of second order tangent bundles plays an essential role. To this end, we first introduce the concepts of time dependent connections and time dependent semisprays on a manifold MM and their induced vector bundle struc…

2016-07-08abs ↗pdf ↗