Parallelisation of sparse grids for large scale data analysis
Date
2006
Authors
Garcke, Jochen
Hegland, Markus
Nielsen, Ole
Journal Title
Journal ISSN
Volume Title
Publisher
Australian Mathematical Society
Abstract
Sparse grids 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 sparse grid combination technique prescribes how approximations on a collection of anisotropic grids can be combined to approximate high dimensional functions. In this paper we study the parallelisation of fitting data onto a sparse grid. The computation can be done entirely by fitting partial models on a collection of regular grids. This allows parallelism over the collection of 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. Using a simple timing model we confirm that the most effective methods are obtained when both types of parallelism are used.
Description
Keywords
Keywords: Numerical linear algebra; Parallelism; Predictive modelling; Sparse grids
Citation
Collections
Source
ANZIAM Journal
Type
Journal article
Book Title
Entity type
Access Statement
License Rights
Restricted until
2037-12-31
Downloads
File
Description