Inserting or Stretching Points in Finite Difference Discretizations

2025-05-05 0 0 515.26KB 13 页 10玖币
侵权投诉
Article
Inserting or Stretching Points in Finite Difference
Discretizations
Jherek Healy
*Correspondence: jherekhealy@protonmail.com
Abstract:
Partial differential equations sometimes have critical points where the solution or some of its
derivatives are discontinuous. The simplest example is a discontinuity in the initial condition. It is well known
that those decrease the accuracy of finite difference methods. A common remedy is to stretch the grid, such
that many more grid points are present near the critical points, and fewer where the solution is deemed smooth.
An alternative solution is to insert points such that the discontinuities fall in the middle of two grid points.
This paper compares the accuracy of both approaches in the context of the pricing of financial derivative
contracts in the Black-Scholes model and proposes a new fast and simple stretching function.
Keywords: finite difference method, grid stretching, Black-Scholes
1. Introduction
Partial differential equations (PDEs) sometimes have critical points where the solution or some of its
derivatives are discontinuous. The simplest example is a discontinuity in the initial condition. This situation
arises in the pricing of nearly all financial derivative contracts. The vanilla European option of given maturity
and strike price, the simplest non-linear contract, has indeed a discontinuous first derivative at the strike price.
It is well known that such critical points decrease the accuracy of finite difference methods. A common
remedy, detailed in [Tavella and Randall 2000, p. 167], is to stretch the grid such that many more grid points are
present near the critical points, and fewer where the solution is deemed smooth. The stretching transformation
for a single point reads
S(u)=B+αsinh(c2u+c1(1 u)),(1)
where
c1=asinh SminB
α
,
c2=asinh SmaxB
α
, and
α
controls the density of points near the critical point
B
. For
u[0,1], we have S(u)[Smin,Smax].
Independently of such a stretching, Giles and Carter [2005], Tavella and Randall [2000] also show that the
error in the solution is significantly decreased when the critical points are located in the middle of two grid
points. There are several ways to place the critical points in such manner. A first approach is to move the grid.
This is applicable only for a single critical point, and if the boundaries can be moved. A second approach is to
simply insert a point in the grid, around the critical point such that the critical point is exactly in the middle of
two grid points. A third approach is to use a smooth deformation, typically a monotonic cubic spline, to place
the critical point approximately (but not exactly) in the middle of two grid points [Tavella and Randall 2000, p.
171].
The advantage of the cubic spline smooth deformation is to preserve the second-order convergence. A
robust implementation is however more involved than the insertion approach. The insertion approach, due to
its lack of smoothness, will a priori not preserve the second-order convergence, but this does not mean that its
accuracy is worse.
arXiv:2210.02541v4 [math.NA] 20 Dec 2022
2 of 13
In this paper, we compare the accuracy of the two approaches, using concrete examples of options in the
Black-Scholes model, on nearly uniform grids, as well as on stretched grids. We also propose a faster stretching
transformation, similar to the sinh transformation and give a simple extension to multiple critical points.
2. Cubic stretching
2.1. Single critical point
According to Noye [1983, p. 307], a stretching function should have the following properties:
(i) dS/du
should be finite over the whole interval - if it becomes infinite at some point, then there is poor
resolution near that point;
(ii) dS/du
must be smaller near at critical point than elsewhere in the interval, which ensures high resolution
near the critical point, but dS/ dushould be non zero at the critical point.
An intuitive candidate would be a function based on a probability density function. A mixture distribution
makes it easy to ensure a higher density around the critical points. A numerical inversion of the mixture
distribution, for example via a monotonic interpolation scheme, leads to the desired stretching function.
Unfortunately, such a stretching will typically have very large derivatives near the boundaries (corresponding to
the inverse of the cumulative density tails) and thus does not obey property (i).
For a single critical point, an interesting stretching function candidate is the cubic based on the Taylor
series of the sinh function:
S(u)=B+α·1
χ(c2u+c1(1 u))3+c2u+c1(1 u)¸,(2)
where
c1
is the solution of the depressed cubic equation
1
χc3
1+c1+BSmin
α=0
and
c2
is the solution of
1
χc3
2+c2+
BSmax
α=0. The value χ=6matches the sinh expansion, other positive values are also possible.
Figure 1shows the cubic transformation to be close to the sinh transformation in practice. As expected, it
is not exponential and thus closer to linear, far away from the critical point. For the same value of
α
, the slope
is slightly different at the critical point. The slope is matched using a lower
α=0.9
for the cubic stretching.
One main advantage of the cubic stretching is performance, as the transformation doesnt involve any costly
function at all. In practice, the cubic stretching is around five times faster.
2.2. Many critical points
Tavella and Randall [2000] propose to use the following jacobian for multiple critical points (Bk):
J(u,S)=S
u=AÃX
k
1
α2
k+(S(u)Bk)2!1
2
,(3)
where
A
is a normalizing constant used to ensure that
S(1) =Smax
with initial condition
S(0) =Smin
. The Jacobian
is nearly constant for
SBk
which corresponds to a uniform discretization and is nearly linear for
SÀBk
or
S¿Bkwhich corresponds to a exponential grid.
Equation 3is an ordinary differential equation (ODE) whose initial condition consists in the function
values at two end-points: it is a two-points boundary problem. A standard method to solve this kind of problem
is the shooting method: we are shooting a projectile from point
S(0) =Smin
so that it lands at point
S(1) =Smax
.
Any solver can be used so solve for
A
. The ODE can be solved with the fourth-order Runge-Kutta method for a
given guess A.
3 of 13
Figure 1. Stretching around the point B=125 using 63 points in the interval [0,150] with α=1.50.
Similarly, the derivative of Equation 2provides a candidate stretching for multiple points:
dS
du=αA
n
Y
i=1
(ubi)2+α.
The solution
(A,b1,...,bn)
such that
S(0) =Smin
,
S(1) =Smax
and
S(bi)=Bi
involves a
n
-dimensional non-linear
optimization and may not be practical for large n.
Solving such non-linear problems makes the overall technique much slower than the single critical point
case, and more challenging to implement in a robust fashion. We thus describe below simpler, better performing
and more robust techniques below.
2.2.1. Direct piecewise-cubic representation
Based on Equation 2, we consider a piecewise-cubic representation of class
C1
. Let
(Bi)i=1,...,m
be the
ordered
m
critical points in the interval
(Smin,Smax)
. Let
Di=Bi+Bi+1
2
be the corresponding mid-points for
i=1,...,m1
, and
D0=Smin,Dm=Smax
for notation convenience. The piecewise cubic interpolant on the
interval [di1,di)reads
pi(u)=Bi+αi·1
χ(c2i(udi1)+c2i1(diu))3+c2i(udi1)+c2i1(diu)¸,(4a)
where diis such that
pi(di)=Di,pi(di1)=Di1.(4b)
摘要:

ArticleInsertingorStretchingPointsinFiniteDierenceDiscretizationsJherekHealy*Correspondence:jherekhealy@protonmail.comAbstract:Partialdierentialequationssometimeshavecriticalpointswherethesolutionorsomeofitsderivativesarediscontinuous.Thesimplestexampleisadiscontinuityintheinitialcondition.Itiswel...

展开>> 收起<<
Inserting or Stretching Points in Finite Difference Discretizations.pdf

共13页,预览3页

还剩页未读, 继续阅读

声明:本站为文档C2C交易模式,即用户上传的文档直接被用户下载,本站只是中间服务平台,本站所有文档下载所得的收益归上传人(含作者)所有。玖贝云文库仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对上载内容本身不做任何修改或编辑。若文档所含内容侵犯了您的版权或隐私,请立即通知玖贝云文库,我们立即给予删除!
分类:图书资源 价格:10玖币 属性:13 页 大小:515.26KB 格式:PDF 时间:2025-05-05

开通VIP享超值会员特权

  • 多端同步记录
  • 高速下载文档
  • 免费文档工具
  • 分享文档赚钱
  • 每日登录抽奖
  • 优质衍生服务
/ 13
客服
关注