Journal of Computational Finance

Fast solutions of complementarity formulations in American put pricing

Artan Borici, Hans-Jakob Lüthi


The finite-difference value function of an American put option can be computed by solving a sequence of linear complementarity problems (LCPs). The stateof- the-art methods that solve these equations converge slowly. Recently, Borici and Lüthi have shown that in the case of the implicit discretization scheme it is possible to solve LCPs in a computer time which grows linearly with the number of spatial grid points. In this paper we show that this result can be generalized for the more accurate discretization scheme of Crank and Nicolson. We give examples that illustrate this result.

Sorry, our subscription options are not loading right now

Please try again later. Get in touch with our customer services team if this issue persists.

New to View our subscription options

You need to sign in to use this feature. If you don’t have a account, please register for a trial.

Sign in
You are currently on corporate access.

To use this feature you will need an individual account. If you have one already please sign in.

Sign in.

Alternatively you can request an individual account here