A cache-optimal alternative to the unidirectional hierarchization algorithm
From MaRDI portal
Recommendations
- Efficient Regular Sparse Grid Hierarchization by a Dynamic Memory Layout
- A Cache‐Aware Algorithm for PDEs on Hierarchical Data Structures Based on Space‐Filling Curves
- scientific article; zbMATH DE number 66097
- Cache optimization for structured and unstructured grid multigrid
- Cache efficient data structures and algorithms for adaptive multidimensional multilevel finite element solvers
Cites work
- scientific article; zbMATH DE number 440658 (Why is no real title available?)
- scientific article; zbMATH DE number 3321507 (Why is no real title available?)
- Analysis of linear difference schemes in the sparse grid combination technique
- Cache-oblivious algorithms
- Communication lower bounds for distributed-memory matrix multiplication
- Convergence of the Combination Technique for Second-Order Elliptic Differential Equations
- Error analysis of the combination technique
- Minimizing communication in numerical linear algebra
- Sparse grids
- The efficient solution of fluid dynamics problems by the combination technique
Cited in
(4)- An efficient cache conscious multi-dimensional index structure
- scientific article; zbMATH DE number 2086622 (Why is no real title available?)
- 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: A cache-optimal alternative to the unidirectional hierarchization algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808020)
