Using chebyshev polynomials to approximate partial differential equations: A reply

Computational Economics

Volumn 39, Issue 1, 2012, Pages 13-27

  Mosiño, Alejandro ^a  

^a UNIVERSITÉ DE SAVOIE   (France)

Author keywords

Chebyshev nodes; Chebyshev polynomial approximation; Optimal stopping problem

Indexed keywords

EID: 83555176469     PISSN: 09277099     EISSN: 15729974     Source Type: Journal    
DOI: 10.1007/s10614-010-9222-2     Document Type: Article

References (9)

1. Caporale G. M., Cerrato M. (2010) Using Chebyshev polynomials to approximate partial differential equations. Computational Economics 35(3): 235-244.
2. Dangl T., Wirl F. (2004) Investment under uncertainty: Calculating the value function when the Bellman equation cannot be solved analytically. Journal of Economic Dynamics and Control 28(7): 1437-1460.
3. Deuflhard P., Bornemann F. (2002) Scientific computing with ordinary differential equations. Springer, Heidelberg.
4. Dixit A., Pindyck R. S. (1994) Investment under uncertainty. Princeton University Press, Princeton.
5. He H., Pindyck R. S. (1992) Investments in flexible production capacity. Journal of Economic Dynamics and Control, Elsevier 16(3-4): 575-599.
6. Judd K. L. (1992) Projection methods for solving aggregate growth models. Journal of Economic Theory 58: 410-452.
7. Judd K. L. (1998) Numerical methods in economics. Massachusetts Institute of Technology Press, Amherst.
8. Majd S., Pindyck R. S. (1987) Time to build, option value, and investment decisions. Journal of Financial Economics, Elsevier 18(1): 7-27.
9. Sezer M., Kaynak M. (1996) Chebyshev polynomial solutions of linear differential equations. International Journal of Mathematical Education in Science and Technology 27(4): 607-618.