A. Klimke and B. Wohlmuth, “Algorithm 847: Spinterp: Piecewise Multilinear Hierarchical Sparse Grid Interpolation in Matlab,” ACM Transactions on Mathematical Software, Vol. 31, No. 4, 2005, pp. 561-579.
http://dx.doi.org/10.1145/1114268.1114275

has been cited by the following article:

• TITLE: High-Dimensional Regression on Sparse Grids Applied to Pricing Moving Window Asian Options

  AUTHORS: Stefan Dirnstorfer, Andreas J. Grau, Rudi Zagst

  KEYWORDS: Sparse Grid; Regression; Least-Squares Monte Carlo; Moving Window Asian Option

  JOURNAL NAME: Open Journal of Statistics, Vol.3 No.6, December 31, 2013

  ABSTRACT: The pricing of moving window Asian option with an early exercise feature is considered a challenging problem in option pricing. The computational challenge lies in the unknown optimal exercise strategy and in the high dimensionality required for approximating the early exercise boundary. We use sparse grid basis functions in the Least Squares Monte Carlo approach to solve this “curse of dimensionality” problem. The resulting algorithm provides a general and convergent method for pricing moving window Asian options. The sparse grid technique presented in this paper can be generalized to pricing other high-dimensional, early-exercisable derivatives.