A Cache‐Aware Algorithm for PDEs on Hierarchical Data Structures Based on Space‐Filling Curves

DOI10.1137/040604078zbMath1162.68406OpenAlexW2028763350MaRDI QIDQ3593026

Miriam Schulte, Markus Pögl, Christoph Zenger, Frank C. Günther

Publication date: 24 September 2007

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/040604078

zbMATH Keywords

Partial differential equationsspace-filling curvescache-awarenessspace-tree

Mathematics Subject Classification ID

Data structures (68P05) Complexity and performance of numerical algorithms (65Y20)

Related Items (12)

An Eulerian approach for partitioned fluid-structure simulations on Cartesian grids ⋮ Fluid-Structure Interaction on Cartesian Grids: Flow Simulation and Coupling Environment ⋮ A quadtree-adaptive multigrid solver for the Serre-Green-Naghdi equations ⋮ Evaluation of an Efficient Stack-RLE Clustering Concept for Dynamically Adaptive Grids ⋮ A cache-efficient reordering method for unstructured meshes with applications to wall-resolved large-eddy simulations ⋮ Towards multi-phase flow simulations in the PDE framework Peano ⋮ Computing space-filling curves ⋮ Cache efficient data structures and algorithms for adaptive multidimensional multilevel finite element solvers ⋮ Cache oblivious matrix multiplication using an element ordering based on a Peano curve ⋮ Navier-Stokes and Lattice-Boltzmann on octree-like grids in the Peano framework ⋮ Efficient Mesh Management in Firedrake Using PETSc DMPlex ⋮ An arithmetic-analytical expression of the Hilbert-type space-filling curves and its applications

This page was built for publication: A Cache‐Aware Algorithm for PDEs on Hierarchical Data Structures Based on Space‐Filling Curves