On the enhanced convergence of standard lattice methods for option pricing
✍ Scribed by Martin Widdicks; Ari D. Andricopoulos; David P. Newton; Peter W. Duck
- Publisher
- John Wiley and Sons
- Year
- 2002
- Tongue
- English
- Weight
- 200 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0270-7314
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
For derivative securities that must be valued by numerical techniques, the trade‐off between accuracy
and computation time can be a severe limitation. For standard lattice methods, improvements are achievable by
modifying the underlying structure of these lattices; however, convergence usually remains
non‐monotonic. In an alternative approach of general application, it is shown how to use standard
methods, such as Cox, Ross, and Rubinstein (CRR), trinomial trees, or finite differences, to produce
uniformly converging numerical results suitable for straightforward extrapolation. The concept of Λ, a
normalized distance between the strike price and the node above, is introduced, which has wide ranging
significance. Accuracy is improved enormously with computation times reduced, often by orders of magnitude.
© 2002 Wiley Periodicals, Inc. Jrl Fut Mark 22:315–338, 2002
📜 SIMILAR VOLUMES
In this paper we analyze convergence of basic iterative Jacobi and Gauss-Seidel type methods for solving linear systems which result from finite element or finite volume discretization of convection-diffusion equations on unstructured meshes. In general the resulting stiffness matrices are neither M
## Abstract We consider the approximate solution of Wiener‐Hopf integral equations by Galerkin, collocation and Nyström methods based on piecewise polynomials where accuracy is achieved by increasing simultaneously the number of mesh points and the degree of the polynomials. We look for the stabili
## Abstract This paper applies the technique of the __h__–__p__ version to the boundary element method for boundary value problems on non‐smooth, plane domains with piecewise analytic boundary and data. The exponential rate of convergence of the boundary element Galerkin solution is proved when a g
## Abstract General stationary iterative methods with a singular matrix __M__ for solving range‐Hermitian singular linear systems are presented, some convergence conditions and the representation of the solution are also given. It can be verified that the general Ortega–Plemmons theorem and Keller