Skip navigation
Skip navigation

Managing complexity in the Parallel Sparse Grid Combination Technique

Larson, Jay; Strazdins, Peter; Hegland, Markus; Harding, Brendan; Roberts, Stephen; Stals, Linda; Rendell, Alistair; Ali, Muhammad; Southern, J.

Description

Parallel implementation of the sparse grid combination technique in high dimensions presents many complexity challenges. We enumerate these challenges, classifying them respectively as computational, algorithmic, and software complexity. We discuss strategies for overcoming the individual complexity barriers. We describe our architecture for a software framework that will allow its users to build complex multiple grid solver applications.

CollectionsANU Research Publications
Date published: 2014
Type: Journal article
URI: http://hdl.handle.net/1885/71272
Source: Parallel Computing
DOI: 10.3233/978-1-61499-381-0-593

Download

File Description SizeFormat Image
01_Larson_Managing_complexity_in_the_2014.pdf599.87 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  12 November 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator