Truncation and acceleration of the Tian tree for the pricing of American put options
We present a new method for truncating binomial trees based on using a tolerance to control truncation errors and apply it to the Tian tree together with acceleration techniques of smoothing and Richardson extrapolation. For both the current (based on standard deviations) and the new (based on tolerance) truncation methods, we test different truncation criteria, levels and replacement values to obtain the best combination for each required level of accuracy. We also provide numerical results demonstrating that the new method can be 50% faster than previously presented methods when pricing American put options in the Black--Scholes model.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 12 (2012)
Issue (Month): 11 (November)
|Contact details of provider:|| Web page: http://www.tandfonline.com/RQUF20|
|Order Information:||Web: http://www.tandfonline.com/pricing/journal/RQUF20|
When requesting a correction, please mention this item's handle: RePEc:taf:quantf:v:12:y:2012:i:11:p:1695-1708. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Michael McNulty)
If references are entirely missing, you can add them using this form.