A multigrid preconditioner for an adaptive Black-Scholes solver
- 85 Downloads
This paper is concerned with the efficient solution of the linear systems of equations that arise from an adaptive space-implicit time discretisation of the Black-Scholes equation. These nonsymmetric systems are very large and sparse, so an iterative method will usually be the method of choice. However, such a method may require a large number of iterations to converge, particularly when the timestep used is large (which is often the case towards the end of a simulation which uses adaptive timestepping). An appropriate preconditioner is therefore desirable. In this paper we show that a very simple multigrid algorithm with standard components works well as a preconditioner for these problems. We analyse the eigenvalue spectrum of the multigrid iteration matrix for uniform grid problems and illustrate the method’s efficiency in practice by considering the results of numerical experiments on both uniform grids and those which use adaptivity in space.
KeywordsFinite differences Multigrid Preconditioning Option pricing Adaptive grids
Mathematics Subject Classification (2000)65M06 65F08 65M55
Unable to display preview. Download preview PDF.
- 1.Christara, C., Dang, D.: Adaptive and high-order methods for valuing American options. J. Comput. Financ. (2010, to appear). http://ssrn.com/abstract=1598948
- 5.Hackbusch, W.: Multi-grid Methods and Applications. Springer, New York (1980) Google Scholar
- 20.Wesseling, P.: An Introduction to Multigrid Methods. Wiley, Chichester (1991) Google Scholar