Efficient Regular Sparse Grid Hierarchization by a Dynamic Memory Layout

DOI10.1007/978-3-319-04537-5_8zbMath1316.65107OpenAlexW149695381MaRDI QIDQ5254896

Riko Jacob

Publication date: 10 June 2015

Published in: Lecture Notes in Computational Science and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-04537-5_8

zbMATH Keywords

sparse gridsparse matrixhierarchization algorithm

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)

Related Items (2)

Efficient parallelization for 3d-3v sparse grid particle-in-cell: shared memory architectures ⋮ Fast sparse grid operations using the unidirectional principle: a generalized and unified framework

This page was built for publication: Efficient Regular Sparse Grid Hierarchization by a Dynamic Memory Layout