### Abstract

Original language | English |
---|---|

Pages (from-to) | 217-233 |

Number of pages | 17 |

Journal | BIT Numerical Mathematics |

Volume | 51 |

Issue number | 1 |

DOIs | |

Publication status | Published - Jan 2011 |

### Fingerprint

### Keywords

- mathematics
- Black-Scholes
- equations
- preconditioning
- option pricing
- multigrid

### Cite this

*BIT Numerical Mathematics*,

*51*(1), 217-233. https://doi.org/10.1007/s10543-011-0316-6

}

*BIT Numerical Mathematics*, vol. 51, no. 1, pp. 217-233. https://doi.org/10.1007/s10543-011-0316-6

**A multigrid preconditioner for an adaptive Black-Scholes solver.** / Ramage, Alison; von Sydow, L.

Research output: Contribution to journal › Article

TY - JOUR

T1 - A multigrid preconditioner for an adaptive Black-Scholes solver

AU - Ramage, Alison

AU - von Sydow, L.

PY - 2011/1

Y1 - 2011/1

N2 - 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.

AB - 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.

KW - mathematics

KW - Black-Scholes

KW - equations

KW - preconditioning

KW - option pricing

KW - multigrid

U2 - 10.1007/s10543-011-0316-6

DO - 10.1007/s10543-011-0316-6

M3 - Article

VL - 51

SP - 217

EP - 233

JO - BIT Numerical Mathematics

JF - BIT Numerical Mathematics

SN - 0006-3835

IS - 1

ER -