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

1.8%3.6%5.4%7.1% · Nov 199719922001200920172026
48 results for Crank-Nicolson 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.

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.

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.

The Runge-Kutta-Legendre scheme improves pricing American options and other derivatives.

problem Pricing American options and other derivatives with improved accuracy and stability.
method Runge-Kutta-Legendre finite difference scheme applied to Black-Scholes and Heston models.
result Improved convergence and stability compared to existing schemes.

The paper explores efficient sampling for Bayesian wide neural networks.

problem Sampling from posterior distributions of wide neural networks.
method Preconditioned Crank-Nicolson and Langevin algorithms for reparametrised posterior distributions.
result The preconditioned Crank-Nicolson algorithm improves sampling efficiency in wide networks.

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 ↗

SKT improves EKI for Bayesian inverse problems with non-Gaussian targets.

problem Efficiently solving Bayesian inverse problems with expensive forward models and non-Gaussian posterior distributions.
method Embedding EKI and FAKI within a Bayesian annealing scheme to adapt tpCN sampler.
result Significant improvements in convergence rate compared to standard SMC and pCN.

Efficient numerical method for time-fractional Black-Scholes model.

problem Solving time-fractional Black-Scholes equations for European options.
method Crank-Nicolson discretization for time, exponential B-spline for space.
result The proposed method is unconditionally stable and superior to existing approaches.

This paper studies the optimal VIX futures trading problems under a regime-switching model. We consider the VIX as mean reversion dynamics with dependence on the regime that switches among a finite number of states. For the trading strategies, we analyze the timings and sequences of the investor's market participation,…

2016-05-25abs ↗pdf ↗

For the first time in mathematical finance field, we propose the local weak form meshless methods for option pricing; especially in this paper we select and analysis two schemes of them named local boundary integral equation method (LBIE) based on moving least squares approximation (MLS) and local radial point interpol…

2014-10-29abs ↗pdf ↗

We introduce a new family of MCMC samplers that combine auxiliary variables, Gibbs sampling and Taylor expansions of the target density. Our approach permits the marginalisation over the auxiliary variables yielding marginal samplers, or the augmentation of the auxiliary variables, yielding auxiliary samplers. The well…

2016-10-30abs ↗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.

Bayesian method infers network topology and dynamics from noisy, sparse measurements.

problem Learning network topology and dynamics from partial, noisy data.
method Developed method uses dynamical structure functions derived from linear stochastic differential equations.
result Method outperforms state-of-the-art methods in various network types.

Bayesian imaging uses neural networks to learn prior knowledge from data.

problem Performing Bayesian inference in imaging problems with limited prior knowledge.
method Constructs a data-driven prior on a sub-manifold of the image space using neural networks, and performs Bayesian computation on this manifold.
result Established the existence and well-posedness of the posterior distribution and moments, and demonstrated superior performance compared to existing methods.

A new method for computing image curvature efficiently and accurately.

problem Low performance, low accuracy, and requirement of second order differentiability in conventional computation schemes.
method Proposes a novel discrete computation scheme for weighted Gaussian curvature.
result More accurate, computationally more efficient, and does not require second order differentiability.

Study evaluates UK CDC schemes, finding intergenerational cross-subsidies in flat-accrual schemes and dynamic-accrual schemes can reduce but not eliminate them.

problem Intergenerational cross-subsidies in UK CDC schemes, particularly in flat-accrual schemes.
method Comparison of flat-accrual and dynamic-accrual CDC schemes, analysis of performance and level of cross-subsidies.
result Dynamic-accrual schemes can reduce but not eliminate intergenerational cross-subsidies, while flat-accrual schemes often have significant cross-subsidies.

AES scheme improves Bermudan and American option pricing for Heston models.

problem Pricing Bermudan and American options under Heston models efficiently.
method AES scheme using non-central chi-square distribution for variance process.
result AES achieves higher accuracy and computational efficiency for Bermudan options.

Characterizes Hilbert schemes and their geometric properties.

problem Understanding transverse Hilbert schemes and their geometric properties.
method Characterization through bi-Poisson structures and hyperkähler geometry.
result Characterization of transverse Hilbert schemes and description of their hyperkähler geometry.

New methods combine MALA and mGRAD for scalable Bayesian inference in high-dimensional state-space models.

problem Bayesian inference in high-dimensional state-space models with limited scalability.
method Combines gradient-based MALA and prior-informed mGRAD for scalable inference.
result Extends classical MCMC methods to handle multiple time steps and particles.

Extends JKO scheme for iterative algorithms with unknown parameters.

problem Computational and statistical analysis of iterative algorithms with unknown parameters.
method Develops statistical methods to estimate unknown parameters and adapts JKO scheme.
result Establishes asymptotic theory for the statistical JKO scheme.

Efficient simulation scheme for rough Heston model reduces computational cost.

problem Accurate and efficient simulation of the rough Heston model for option pricing.
method Weak simulation scheme based on Markovian approximations of the rough Heston process.
result The new scheme exhibits second order weak convergence with linear computational cost.

Study finds risk management significantly improves pension scheme efficiency in Kenya.

problem Improving efficiency of pension schemes in Kenya.
method Panel data analysis of 128 pension schemes from 2015-2021.
result Risk management significantly mediates the relationship between corporate governance and pension scheme efficiency.

In this paper, we propose an acceleration scheme for online memory-limited PCA methods. Our scheme converges to the first k>1k>1 eigenvectors in a single data pass. We provide empirical convergence results of our scheme based on the spiked covariance model. Our scheme does not require any predefined parameters such as t…

2018-07-17abs ↗pdf ↗