Larson, Jay; Strazdins, Peter; Hegland, Markus; Harding, Brendan; Roberts, Stephen; Stals, Linda; Rendell, Alistair; Ali, Muhammad; Southern, J.
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.
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.