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,695 papers · 148 categories

Trend · papers per month

85169254338 · May 202619922001200920172026
48 results for finite element scheme

The paper solves a complex option pricing model using finite elements.

problem Risk-Adjusted Pricing Methodology (RAPM) Black-Scholes model with transaction costs.
method Spatial finite element models based on P1 and/or P2 elements, combined with a Crank-Nicolson-type temporal scheme.
result Results compare favorably with finite difference methods in the literature.

Finite element method applied to Leland's model for option pricing with transaction costs.

problem Option pricing with transaction costs using Leland's model.
method Spatial finite element models based on P1 and/or P2 elements combined with a Crank-Nicolson-type temporal scheme.
result Results compare favorably with finite difference methods in the literature.

Variational approximations for curve flows on Riemannian manifolds.

problem Approximating solutions to curvature and elastic flow problems on Riemannian manifolds.
method Variational formulations, finite element approximations, piecewise linear elements, stability analysis.
result Derived schemes can compute rotationally symmetric self-shrinkers and geodesics.

Study uses FEM for HJB in option pricing with borrowing fees, improving accuracy and efficiency.

problem Optimal control problems in financial markets with frictions.
method Finite element method with non-uniform mesh, theta-scheme time integration, Newton-type algorithm.
result Efficient and accurate solution to HJB equation for option pricing with borrowing fees.

Study finds minimal length networks connecting three points in Heisenberg group.

problem Finding minimal length networks connecting three points in the Heisenberg group.
method Proved existence of minimal horizontal triods, formulated curve shortening flow, used numerical experiments.
result Characterized and deformed minimal horizontal triods into critical points for length functional.

A new method for pricing options with stochastic volatility and jumps.

problem Pricing options under stochastic volatility and jumps.
method Fourth-order compact finite-difference scheme with implicit-explicit Crank-Nicolson framework.
result The method achieves near-fourth-order spatial accuracy and up to two orders of magnitude lower runtime than quadratic finite elements.

We discuss some differential geometry pertaining to continuum mechanics and the route recently taken by D.N. Arnold, R.S. Falk, and R. Winther in deriving new improved finite element schemes in linear elasticity from constructions in projective geometry.

2010-05-12abs ↗pdf ↗

We propose a deterministic numerical method for pricing vanilla options under the SABR stochastic volatility model, based on a finite element discretization of the Kolmogorov pricing equations via non-symmetric Dirichlet forms. Our pricing method is valid under mild assumptions on parameter configurations of the proces…

2018-01-08abs ↗pdf ↗

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.

The signed volume function for polyhedra can be generalized to a mean volume function for volume elements by averaging over the triangulations of the underlying polyhedron. If we consider these up to translation and scaling, the resulting quotient space is diffeomorphic to a sphere. The mean volume function restricted …

2013-02-25abs ↗pdf ↗

The paper approximates Levi-Civita connection and curvature on 2D manifolds using finite elements.

problem Approximating Levi-Civita connection and curvature on 2D manifolds with finite elements.
method Using Regge finite elements, piecewise polynomial symmetric (0,2)-tensor fields, and distributional sense for non-regular tensors.
result Distributional quantities converge to their smooth counterparts under refinement of triangulation.

The paper improves convergence rates of curvature approximations using Regge elements.

problem Improving convergence rates of curvature approximations using Regge elements.
method Investigates the interplay between polynomial degree of curvature lifting and metric tensor degree in Regge finite element space.
result Higher convergence rates are achieved by reducing the polynomial degree of curvature lifting and using linear Regge elements.

Constructs finite element spaces for (p,q)(p,q)-forms, excluding one subspace.

problem Constructing finite element spaces for (p,q)(p,q)-forms.
method Piecewise polynomial finite element spaces for all natural subspaces of (p,q)(p,q)-forms, excluding one subspace.
result Recovers known finite element spaces and introduces new ones.

Systems of partial differential equations lie at the heart of physics. Despite this, the general theory of these systems has remained rather obscure in comparison to numerical approaches such as finite element models and various other discretisation schemes. There are, however, several theoretical approaches to systems…

2001-06-12abs ↗pdf ↗

A positive integer mm will be called a {\it finitistic order} for an element γγ of a group ΓΓ if there exist a finite group GG and a homomorphism h:ΓGh:Γ\to G such that h(γ)h(γ) has order mm in GG. It is shown that up to conjugacy, all but finitely many elements of a given finitely generated, torsion-free Kleinian gr…

2011-04-03abs ↗pdf ↗

Develops a new solver for path-dependent PDEs using signature kernels.

problem Solving path-dependent PDEs (PPDEs) efficiently and accurately.
method Uses signature kernels to solve PPDEs by approximating the solution with minimal norm in a reproducing kernel Hilbert space.
result Proves the consistency of the numerical scheme, ensuring convergence to PPDE solutions as the number of collocation points increases.

Rust library solves complex equations on abstract simplicial complexes.

problem Solving partial differential equations on abstract simplicial complexes.
method Finite Element Exterior Calculus, intrinsic Riemannian metric, first-order Whitney basis functions.
result Verification through convergence studies on elliptic Hodge-Laplace eigenvalue and source problems.

Statistical finite elements use Langevin dynamics to efficiently handle uncertainty quantification.

problem Uncertainty quantification in finite element models with observed data.
method Langevin dynamics, unadjusted Langevin algorithm (ULA), for sampling posterior distributions.
result ULA provides a scalable and efficient method for characterizing the posterior distribution of statFEM models.

If F is a surface with boundary, then a finitely generated subgroup without peripheral elements of G = π_1(F) can be separated from finitely many other elements of G by a finite index subgroup of G corresponding to a finite cover F' with the same number of boundary components as F .

2012-04-20abs ↗pdf ↗

Within the framework of statistical learning theory we analyze in detail the so-called elastic-net regularization scheme proposed by Zou and Hastie for the selection of groups of correlated variables. To investigate on the statistical properties of this scheme and in particular on its consistency properties, we set up …

2008-07-22abs ↗pdf ↗

The paper analyzes finite element methods on manifolds with approximate metrics.

problem Analyzing finite element methods on manifolds with approximate metrics.
method Intrinsic finite element exterior calculus applied to manifolds with Regge metrics.
result Analysis and implementation of a method for computing an approximate Levi-Civita connection form.

Finite quandles with n elements can be represented as n-by-n matrices. We show how to use these matrices to distinguish all isomorphism classes of finite quandles for a given cardinality n, as well as how to compute the automorphism group of each finite quandle. As an application, we classify finite quandles with up to…

2004-12-20abs ↗pdf ↗

Given a finite set of rr points in a closed surface of genus gg, we consider the torsion elements in the mapping class group of the surface leaving the finite set invariant. We show that the torsion elements generate the mapping class group if and only if (g,r)(2,5k+4)(g, r) \neq (2, 5k+4) for some integer kk.

2000-04-08abs ↗pdf ↗

The paper constructs discrete Hessian and divdiv complexes on triangulations and proves their cohomology isomorphic to continuous versions.

problem Discrete construction of Hessian and divdiv complexes on triangulations.
method Construction of discrete Hessian and divdiv complexes using finite elements and Dirac measures on triangulations.
result The cohomology of the constructed complexes is isomorphic to the continuous de Rham cohomology.

We enhance the biquandle counting invariant using elements of truncated biquandle-labeled Polyak algebras. These finite type enhancements reduce to the finite type enhancements defined by Goussarov, Polyak and Viro for the trivial biquandle of one element and determine (but are not determined by) the biquandle counting…

2015-06-02abs ↗pdf ↗

EPGP surrogate outperforms finite elements in solving wave equations.

problem Benchmarking Gaussian Process surrogates vs. finite elements for wave equation solutions.
method EPGP uses penalized least squares and exponential-polynomial bases; CN-FEM employs Crank--Nicolson time stepping.
result EPGP achieves lower error than CN-FEM under matched degrees-of-freedom.

Extends Nielsen realization to infinite-type surfaces, classifying torsion elements and topological groups.

problem Realizing finite subgroups of mapping class groups on infinite-type surfaces.
method Extending Kerckhoff's result to infinite-type surfaces, using hyperbolic metrics and topological group properties.
result Compact subgroups of mapping class groups are finite, and locally compact subgroups are discrete.

Develops unisolvent weights for Nédélec second family finite elements in 2D.

problem Finding efficient degrees of freedom for Nédélec second family finite elements.
method Uses techniques of homological algebra to obtain degrees of freedom for differential forms.
result Provides a family of unisolvent and minimal physical degrees of freedom for Nédélec second family finite elements.

Finite element method approximates scalar curvature in arbitrary dimensions.

problem Approximating scalar curvature using finite elements in arbitrary dimensions.
method Piecewise polynomial interpolants of a smooth Riemannian metric on a triangulated polyhedral domain.
result Finite element interpolants converge to scalar curvature with rate O(hr+1)O(h^{r+1}) in H2(Ω)H^{-2}(Ω) norm.

The study optimizes Gaussian process approximations for finite-rank models.

problem Posterior behavior of finite-rank approximations differs from parent GP priors.
method Locally supported basis expansions with dependent Gaussian coefficients.
result Finite-rank expansions inherit the same posterior contraction rate as parent GP priors.