Author
Listed:
- Conall O’Sullivan
- Stephen O’Sullivan
Abstract
ABSTRACT The accelerated trinomial tree (ATT) is a derivatives pricing lattice method that circumvents the restrictive time step condition inherent in standard trinomial trees and explicit finite difference methods (FDMs), in which the time step must scale with the square of the spatial step. ATTs consist of L uniform supersteps, each of which contains an inner lattice/trinomial tree with N nonuniform subtime steps. Similarly to implicit FDMs, the size of the superstep in ATTs, a function of N, is constrained primarily by accuracy demands.ATTs can price options up toN times faster than standard trinomial trees (explicit FDMs). ATTs can be interpreted as using risk-neutral extended probabilities: extended in the sense that values can lie outside the range OE0; 1 on the substep scale but aggregate to probabilities within the range OE0; 1 on the superstep scale. Hence, it is only strictly at the end of each superstep that a practically meaningful solution may be extracted from the tree.We demonstrate that ATTs with L supersteps are more efficient or have comparable efficiency to competing implicit methods that use L time steps in pricing Black-Scholes American put options and two-dimensional American basket options. Crucially, this performance is achieved using an algorithm that requires only a modest modification of a standard trinomial tree. This is in contrast to implicit FDMs, which may be relatively complex in their implementation. We also extend ATTs to the pricing of American options under the Heston model and the Bates model in order to demonstrate the general applicability of the approach.
Suggested Citation
Handle:
RePEc:rsk:journ0:2447114
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:rsk:journ0:2447114. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Thomas Paine (email available below). General contact details of provider: https://www.risk.net/journal-of-computational-finance .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.