Fast solutions of complementarity formulations in American put pricing

Artan Borici and Hans-Jakob Lüthi

Journal of Computational Finance

Abstract: ABSTRACT 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.

References: Add references at CitEc
Citations:

Downloads: (external link)
https://www.risk.net/journal-of-computational-fina ... american-put-pricing (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:rsk:journ0:2160502

Access Statistics for this article

More articles in Journal of Computational Finance from Journal of Computational Finance
Bibliographic data for series maintained by Thomas Paine ().