Related papers: Multigrid Iterative Algorithm based on Compact Fin…
This paper deals with a high-order accurate implicit finite-difference approach to the pricing of barrier options. In this way various types of barrier options are priced, including barrier options paying rebates, and options on…
We introduce a near-linear complexity (geometric and meshless/algebraic) multigrid/multiresolution method for PDEs with rough ($L^\infty$) coefficients with rigorous a-priori accuracy and performance estimates. The method is discovered…
In this paper we introduce a deep learning method for pricing and hedging American-style options. It first computes a candidate optimal stopping policy. From there it derives a lower bound for the price. Then it calculates an upper bound, a…
This paper presents a novel approach to pricing American options using piecewise diffusion Markov processes (PDifMPs), a type of generalised stochastic hybrid system that integrates continuous dynamics with discrete jump processes. Standard…
A self-learning algebraic multigrid method for dominant and minimal singular triplets and eigenpairs is described. The method consists of two multilevel phases. In the first, multiplicative phase (setup phase), tentative singular triplets…
Standard gradient-based iteration algorithms for optimization, such as gradient descent and its various proximal-based extensions to nonsmooth problems, are known to converge slowly for ill-conditioned problems, sometimes requiring many…
We propose a stable sixth-order compact finite difference scheme with a dynamic fifth-order staggered boundary scheme and 3(2) R-K Bogacki and Shampine adaptive time stepping for pricing American style options. To locate, fix and compute…
Due to the lack of corresponding analysis on appropriate mapping operator between two grids, high-order two-grid difference algorithms are rarely studied. In this paper, we firstly discuss the boundedness of a local bi-cubic Lagrange…
We continue a series of papers devoted to construction of semi-analytic solutions for barrier options. These options are written on underlying following some simple one-factor diffusion model, but all the parameters of the model as well as…
This paper introduces a discretization-accurate stopping criterion of symmetric iterative methods for solving systems of algebraic equations resulting from the finite element approximation. The stopping criterion consists of the evaluations…
In this note we present an alternative way to obtain optimal interpolation operators for two-grid methods applied to Hermitian positive definite linear systems. Falgout and Vassilevski in [SIAM J. Numer. Anal, 42 (2004), pp. 1669-1693] and…
In this paper we present a MATLAB version of a non-standard finite difference scheme for the numerical solution of the perpetual American put option models of financial markets. These models can be derived from the celebrated Black-Scholes…
In this paper, a new iterative two-level algorithm is presented for solving the finite element discretization for nonsymmetric or indefinite elliptic problems. The iterative two-level algorithm uses the same coarse space as the traditional…
In this work, we propose an algorithm to price American options by directly solving the dual minimization problem introduced by Rogers. Our approach relies on approximating the set of uniformly square integrable martingales by a finite…
We present multigrid methods for solving elliptic partial differential equations on arbitrary domains using the nodal ghost finite element method, an unfitted boundary approach where the domain is implicitly defined by a level-set function.…
In this paper we describe in detail the computational algorithm used by our parallel multigrid elliptic equation solver with adaptive mesh refinement. Our code uses truncation error estimates to adaptively refine the grid as part of the…
We propose a two-level nested preconditioned iterative scheme for solving sparse linear systems of equations in which the coefficient matrix is symmetric and indefinite with relatively small number of negative eigenvalues. The proposed…
American options are studied in a general discrete market in the presence of proportional transaction costs, modelled as bid-ask spreads. Pricing algorithms and constructions of hedging strategies, stopping times and martingale…
We present a parallel algorithm that computes the ask and bid prices of an American option when proportional transaction costs apply to the trading of the underlying asset. The algorithm computes the prices on recombining binomial trees,…
To numerically solve a generic elliptic equation on two-dimensional domains with rectangular Cartesian grids, we propose a cut-cell geometric multigrid method that features (1) general algorithmic steps that apply to two-dimensional…