References
- V. Barthelmann, E. Novak, and K. Ritter, High dimensional polynomial interpolation on sparse grids, Adv. Comput. Math. 12 (2000), pp. 273–288. doi: 10.1023/A:1018977404843
- S.N. Bernstein, Sur l'ordre de la meilleure approximation des fonctions continues par des polynomes de degré donné, mimoires acad. Académie Royale de Belgique. Classe des Sciences. Mémoires 4, 1912.
- S. Börm, Efficient Numerical Methods for Non-Local Operators: H2-matrix Compression, Algorithms and Analysis, vol. 14. European Mathematical Society, Zurich, 2010.
- P.J. Davis, Interpolation and Approximation, Courier Corporation, New York, 1975.
- M. Gaß, K. Glau, M. Mahlstedt, and M. Mair, Chebyshev interpolation for parametric option pricing. Accepted for publication in Finance and Stochastics, former version available on https://arxiv.org/abs/1505.04648v2, 2017.
- K. Glau, P. Herold, D.B. Madan, and C. Pötz, The Chebyshev method for the implied volatility. arXiv:1710.01797, 2017.
- K. Glau, D. Kressner, and F. Statti, Low rank tensor approximation for Chebyshev interpolation in parametric option pricing. Work in progress, 2018.
- K. Glau, M. Mahlstedt, and C. Pötz, A new approach for American option pricing: The Dynamic Chebyshev method. arXiv:1806.05579, 2018.
- M. Mahlstedt, Complexity reduction for option pricing. Ph.D. thesis, Technische Universität München, Munich, 2017.
- S. Sauter and C. Schwab., Randelementmethoden: Analyse, Numerik und Implementierung Schneller Algorithmen, Vieweg+ Teubner Verlag, Berlin Heidelberg, 2004.
- A. Townsend and L.N. Trefethen, An extension of chebfun to two dimensions, SIAM J. Sci. Comput. 35(6) (2013), pp. C495–C518. doi: 10.1137/130908002
- L.N. Trefethen, Approximation Theory and Approximation Practice, SIAM books, New York, 2013.
- D Xiu, Fast numerical methods for stochastic computations: A review, Commun. Comput. Phys. 5(2–4) (2009), pp. 242–272.
- D. Xiu, Numerical Methods for Stochastic Computations: A Spectral Method Approach, Princeton University Press, Princeton, NJ, 2010.