The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
2009
DOI: 10.1007/s11075-009-9316-x
|View full text |Cite
|
Sign up to set email alerts
|

A robust finite difference scheme for pricing American put options with Singularity-Separating method

Abstract: In this paper we present a stable numerical method for the linear complementary problem arising from American put option pricing. The numerical method is based on a hybrid finite difference spatial discretization on a piecewise uniform mesh and an implicit time stepping technique. The scheme is stable for arbitrary volatility and arbitrary interest rate. We apply some tricks to derive the error estimates for the direct application of finite difference method to the linear complementary problem. We use the Sing… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
18
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 17 publications
(18 citation statements)
references
References 23 publications
0
18
0
Order By: Relevance
“…Further, we compare the presented l 1 FVM with a more straightforward approach to the original penalized problem on the truncated domain [0, 4E] by centred-space discretization of the first derivative away from the degeneration and one-sided discretization in the degeneration region to ensure the M-matrix property [5] on uniform grid. Again, the l 1 penalization and fully implicit time discretization are used as for the Crank-Nicolson time stepping one may observe oscillations when using centred-space discretization.…”
Section: Numerical Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Further, we compare the presented l 1 FVM with a more straightforward approach to the original penalized problem on the truncated domain [0, 4E] by centred-space discretization of the first derivative away from the degeneration and one-sided discretization in the degeneration region to ensure the M-matrix property [5] on uniform grid. Again, the l 1 penalization and fully implicit time discretization are used as for the Crank-Nicolson time stepping one may observe oscillations when using centred-space discretization.…”
Section: Numerical Resultsmentioning
confidence: 99%
“…The known function σ (t) characterizes the volatility of the asset, r(t) is the interest rate, d(S, t) is the dividend function and V * is the payoff, given by V (S, T ) = V * (S) = max(S − E, 0) for call option (V * (S) = max(E − S, 0) for put option). Various numerical methods are developed for the LCP (1) [4][5][6]16,18]. Introduced in computational finance by Zvan et al [25], the penalty method is regarded as solid alternative to these popular algorithms.…”
Section: Introductionmentioning
confidence: 99%
“…Here, we apply the central difference scheme on a piecewise uniform mesh [16,17] to discrete problem (13) and apply the implicit Euler scheme to discrete problem (14). The matrices associated with discrete operators are M-matrices, which ensure that the scheme is stable for arbitrary volatility and arbitrary interest rate without any extra conditions.…”
Section: The Spatial Discretizationmentioning
confidence: 99%
“…Furthermore, the uniform mesh on the transformed interval will lead to the originally grid points concentrating around = 0 inappropriately. We have proposed robust difference schemes for the BlackScholes equation, which is based on a central difference spatial discretization on a piecewise uniform mesh and an implicit time stepping technique [16,17].…”
Section: Introductionmentioning
confidence: 99%
“…Since the option pricing in a market is dependent on other markets, the multidimensional Black Scholes equation is more efficient than the one dimensional version. There are various methods to find the solution of multidimensional Black Scholes model; for example, a radical basic function (RBF) method [2][3][4][5][6], the Mellin transform method [7], finite different method [8][9][10][11][12], a collection method with the quantic B-spline function [13], and homotopy perturbation method (HPM) [14,15].…”
Section: Introductionmentioning
confidence: 99%