A cache‐oblivious self‐adaptive full multigrid method

DOI10.1002/nla.481zbMath1174.65550OpenAlexW2056345907MaRDI QIDQ3618037

Miriam Schulte, Tobias Weinzierl, Christoph Zenger

Publication date: 31 March 2009

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nla.481

zbMATH Keywords

space-filling curvemultigrid algorithmsspace-treeadaptively refined gridscache-efficiencydynamical adaptivitylinearly processed data structuresstorage-minimizing algorithm

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Data structures (68P05)

Related Items (8)

An Eulerian approach for partitioned fluid-structure simulations on Cartesian grids ⋮ Fluid-Structure Interaction on Cartesian Grids: Flow Simulation and Coupling Environment ⋮ Fast Mesh-to-Mesh Remaps Using Hash Algorithms ⋮ Towards multi-phase flow simulations in the PDE framework Peano ⋮ Efficiency considerations in triangular adaptive mesh refinement ⋮ A Hilbert-order multiplication scheme for unstructured sparse matrices ⋮ Partitioned Simulation of Fluid-Structure Interaction on Cartesian Grids ⋮ Navier-Stokes and Lattice-Boltzmann on octree-like grids in the Peano framework

Uses Software

• Cachegrind
• DiMEPACK

Cites Work

• Unnamed Item
• Unnamed Item
• Space-filling curves
• Performance Optimization of Numerically Intensive Codes
• CACHING IN WITH MULTIGRID ALGORITHMS: PROBLEMS IN TWO DIMENSIONS

This page was built for publication: A cache‐oblivious self‐adaptive full multigrid method