Chebyshev polynomial approximation to approximate partial differential equations
This pa per suggests a simple method based on Chebyshev approximation at Chebyshev nodes to approximate partial differential equations. The methodology simply consists in determining the value function by using a set of nodes and basis functions. We provide two examples. Pricing an European option and determining the best policy for chatting down a machinery. The suggested method is flexible, easy to program and efficient. It is also applicable in other fields, providing efficient solutions to complex systems of partial differential equations.
|Date of creation:||Mar 2008|
|Date of revision:|
|Contact details of provider:|| Postal: Adam Smith Building, Glasgow G12 8RT|
Phone: 0141 330 4618
Fax: 0141 330 4940
Web page: http://www.gla.ac.uk/schools/business/research/
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Lars Stentoft, 2004. "Assessing the Least Squares Monte-Carlo Approach to American Option Valuation," Review of Derivatives Research, Springer, vol. 7(2), pages 129-168, 08.
- Abadir, Karim M. & Rockinger, Michael, 2003. "Density Functionals, With An Option-Pricing Application," Econometric Theory, Cambridge University Press, vol. 19(05), pages 778-811, October.
When requesting a correction, please mention this item's handle: RePEc:gla:glaewp:2008_16. 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: (Jeanette Findlay)
If references are entirely missing, you can add them using this form.