Ramage, Alison and von Sydow, L. (2011) A multigrid preconditioner for an adaptive Black-Scholes solver. BIT Numerical Mathematics, 51 (1). pp. 217-233. ISSN 0006-3835Full text not available in this repository. (Request a copy from the Strathclyde author)
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.
|Keywords:||mathematics, Black-Scholes , equations , preconditioning, option pricing, multigrid, Probabilities. Mathematical statistics|
|Subjects:||Science > Mathematics > Probabilities. Mathematical statistics|
|Department:||Faculty of Science > Mathematics and Statistics|
|Depositing user:||Pure Administrator|
|Date Deposited:||07 Mar 2011 23:26|
|Last modified:||22 Mar 2017 11:18|