J. Garcke, M. Hegland, and O. Nielsen.
Parallelisation of sparse grids for large scale data analysis.
In P. Sloot, D. Abramson, A. Bogdanov, J. Dongarra, A. Zomaya, and
Y. Gorbachev, editors, Proceedings of the International Conference on
Computational Science 2003 (ICCS 2003) Melbourne, Australia, volume 2659 of
Lecture Notes in Computer Science, pages 683-692. Springer, 2003.
also as SFB 611 preprint 65, Universität Bonn, 2003.
[ bib | .pdf 1 ]
Sparse Grids (SG), due to Zenger, are the basis for efficient high dimensional approximation and have recently been applied successfully to predictive modelling. They are spanned by a collection of simpler function spaces represented by regular grids. The combination technique prescribes how approximations on simple grids can be combined to approximate the high dimensional functions. It can be improved by iterative refinement. Fitting sparse grids admits the exploitation of parallelism at various stages. The fit can be done entirely by fitting partial models on regular grids. This allows parallelism over the partial grids. In addition, each of the partial grid fits can be parallelised as well, both in the assembly phase where parallelism is done over the data and in the solution stage using traditional parallel solvers for the resulting PDEs. A simple timing model confirms that the most effective methods are obtained when both types of parallelism are used.