Peano—A Traversal and Storage Scheme for Octree-Like Adaptive Cartesian Multiscale Grids
DOI10.1137/100799071zbMath1245.65169OpenAlexW1983575728MaRDI QIDQ3116456
Miriam Schulte, Tobias Weinzierl
Publication date: 23 February 2012
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/100799071
algorithmmultiscalespace-filling curveoctreeJacobi smoothergeometric multigridcache efficiencyKrylov solveradaptive Cartesian gridmesh managementspacetree
Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Parallel algorithms in computer science (68W10) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Multigrid methods; domain decomposition for initial value and initial-boundary value problems involving PDEs (65M55) Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs (65M50)
Related Items (21)
This page was built for publication: Peano—A Traversal and Storage Scheme for Octree-Like Adaptive Cartesian Multiscale Grids