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.

169,051 papers · 148 categories

Trend · papers per month

16314762 · May 202619922001200920182026
48 results for higher-order PDEs

Develops methods for conditional symmetries of higher-order PDEs, removing unnecessary assumptions.

problem Formulating conditional symmetries for higher-order PDEs with unnecessary assumptions.
method Geometrical formulation and Lie systems approach to derive Lie algebras of conditional symmetries.
result New insights and methods for solving higher-order PDEs.

In this paper, a standard PDE for the pricing of arithmetic average strike Asian call option is presented. A Crank-Nicolson Implicit Method and a Higher Order Compact finite difference scheme for this pricing problem is derived. Both these schemes were implemented for various values of risk free rate and volatility. Th…

2011-06-10abs ↗pdf ↗

Paper tackles stochastic control with mean and higher-order moments, finding Nash equilibria.

problem Time-inconsistent stochastic control problems with mean and higher-order moments.
method Developed closed-loop and open-loop Nash equilibrium controls using PDEs and maximum principles.
result Identical closed-loop and open-loop Nash equilibria controls, independent of state value and random path.

In this paper we derive the symplectic framework for field theories defined by higher-order Lagrangians. The construction is based on the symplectic reduction of suitable spaces of iterated jets. The possibility of reducing a higher-order system of PDEs to a constrained first-order one, the symplectic structures natura…

2014-08-09abs ↗pdf ↗

First-order jet bundles can be put at the foundations of the modern geometric approach to nonlinear PDEs, since higher-order jet bundles can be seen as constrained iterated jet bundles. The definition of first-order jet bundles can be given in many equivalent ways - for instance, by means of Grassmann bundles. In this …

2012-07-26abs ↗pdf ↗

In this paper we extend Buchen's method to develop a new technique for pricing of some exotic options with several expiry dates(more than 3 expiry dates) using a concept of higher order binary option. At first we introduce the concept of higher order binary option and then provide the pricing formulae of nn-th order b…

2013-02-14abs ↗pdf ↗

In this work, we have presented a simple analytical approximation scheme for generic non-linear FBSDEs. By treating the interested system as the linear decoupled FBSDE perturbed with non-linear generator and feedback terms, we have shown that it is possible to carry out a recursive approximation to an arbitrarily highe…

2011-06-01abs ↗pdf ↗

We study higher-order conservation laws of the non-linearizable elliptic Poisson equation 2uzzˉ=f(u) \frac{{\partial}^2 u}{\partial z \partial \bar{z}} = -f(u) as elements of the characteristic cohomology of the associated exterior differential system. The theory of characteristic cohomology determines a normal form for diffe…

2009-06-17abs ↗pdf ↗

Characterizes surfaces enveloped by rotating cones for CNC machining.

problem Characterizing surfaces enveloped by rotating cones for CNC machining.
method Derives higher-order nonlinear PDEs for enveloping surfaces, including local approximations.
result Characterizations generalize previous work on developable and ruled surfaces.

HTE improves PINNs for high-dimensional, high-order PDEs by reducing computational cost and memory usage.

problem Challenges in solving high-dimensional, high-order PDEs with PINNs due to computational cost and memory constraints.
method Introduces Hutchinson Trace Estimation (HTE) to transform Hessian matrix calculations into Hessian vector products (HVP), reducing computational cost and memory usage.
result HTE significantly reduces memory consumption and computational cost, enabling faster and more efficient solution of high-dimensional and high-order PDEs.

DeepSVM learns SVMs without PDE solving, achieving high pricing accuracy.

problem Computational bottleneck in real-time calibration of stochastic volatility models.
method Physics-informed Deep Operator Network (PI-DeepONet) that enforces terminal payoffs and no-arbitrage conditions.
result DeepSVM achieves high pricing accuracy across various market dynamics.

A weak law of large numbers is established for a sequence of systems of N classical point particles with logarithmic pair potential in $\bbR^n$, or $\bbS^n$, $n\in \bbN$, which are distributed according to the configurational microcanonical measure δ(EH)δ(E-H), or rather some regularization thereof, where H is the configu…

2000-02-22abs ↗pdf ↗

The paper develops a new approach to solve vector-valued PDEs on manifolds with minimal regularity.

problem Well-posedness and LpL^p-based Sobolev regularity of vector-valued PDEs on compact manifolds.
method Develops a parametrization-free variational approach using classical results in reflexive Banach spaces.
result Establishes higher-order Wm,pW^{m,p} regularity for vector-valued PDEs on manifolds of minimal regularity.

This thesis advances algorithms and software for QMC, GP, and sciML.

problem Efficient high-dimensional integration, interpolation, and PDE modeling.
method Developed new algorithms and software for QMC, GP, and sciML.
result Efficient and accurate methods for high-dimensional problems.

Study heat content in sub-Riemannian structures, proving asymptotic series existence and coefficients.

problem Analyzing heat content in sub-Riemannian manifolds.
method Adapting Savo's technique to sub-Riemannian structures, computing coefficients up to order 5.
result Existence of full asymptotic series and explicit computation of coefficients up to order 5.

PDE-Net 2.0 learns PDEs from data without prior knowledge.

problem Discovering PDEs from empirical data without detailed prior knowledge.
method Numeric-symbolic hybrid deep network combining numerical approximations and symbolic neural networks.
result PDE-Net 2.0 can uncover hidden PDEs and predict dynamics in noisy environments.

Solves second-order PDEs using quotients and differential invariants.

problem Solving second-order PDEs with first-order quotients.
method Solve the quotient PDE using differential invariants, then add new constraints to solve the original PDE.
result New method for solving second-order scalar PDEs with infinite-dimensional symmetry algebras.

Graphs improve theorem proving in higher-order logic.

problem Challenges in converting higher-order logic formulas into graph-based representations.
method Used graph neural networks (GNNs) to represent and search higher-order logic.
result GNNs outperform state-of-the-art methods in higher-order theorem proving.

PRISMA uses PDE residuals for fast, robust, and accurate inference.

problem Slow gradient-based optimization and instability in PDE residual-based methods.
method Integrates PDE residuals directly into the model's architecture via attention mechanisms in the spectral domain.
result Competitive accuracy with significantly lower inference costs and faster speeds.

Paper introduces techniques to learn higher-order programs, improving predictive accuracy and reducing learning times.

problem Expressing and learning complex programs in ILP.
method Extending meta-interpretive learning to support higher-order definitions as background knowledge.
result Learning higher-order programs reduces hypothesis space and sample complexity, improving predictive accuracy and reducing learning times.

For certain classes of knots we define geometric invariants called higher-order genera. Each of these invariants is a refinement of the slice genus of a knot. We find lower bounds for the higher-order genera in terms of certain von Neumann ρρ-invariants, which we call higher-order signatures. The higher-order genera o…

2008-07-02abs ↗pdf ↗

A fundamental property of complex networks is the tendency for edges to cluster. The extent of the clustering is typically quantified by the clustering coefficient, which is the probability that a length-2 path is closed, i.e., induces a triangle in the network. However, higher-order cliques beyond triangles are crucia…

2017-04-12abs ↗pdf ↗

Using the theory of the symmetry group for PDEs [15, 17], we derive the symmetry group G associated to surfaces PDE. Several group invariant solutions of the surfaces PDE are given by solving a reduced system of partial differential equations.

2010-07-07abs ↗pdf ↗

Unified framework solves nonlinear PDEs and IPs using Gaussian processes.

problem Solving and identifying parameters in nonlinear PDEs and inverse problems.
method Gaussian process framework approximating solutions as MAP estimators, reducing to finite-dimensional optimization problem.
result Unified method converges in a small number of iterations for various PDEs.