A Cache-Optimal Alternative to the Unidirectional Hierarchization Algorithm

DOI10.1007/978-3-319-28262-6_5zbMATH Open1356.65275OpenAlexW2472067411MaRDI QIDQ2808020FDOQ2808020

Riko Jacob, Philipp Hupp

Publication date: 26 May 2016

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-28262-6_5

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Numerical algorithms for specific classes of architectures (65Y10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Sparse grids
• Error analysis of the combination technique
• Cache-Oblivious Algorithms
• Convergence of the Combination Technique for Second-Order Elliptic Differential Equations
• Minimizing Communication in Numerical Linear Algebra
• Analysis of linear difference schemes in the sparse grid combination technique
• Communication lower bounds for distributed-memory matrix multiplication
• The efficient solution of fluid dynamics problems by the combination technique

Cited In (4)

• An efficient cache conscious multi-dimensional index structure
• Title not available (Why is that?)
• 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

Uses Software

• Fastsg

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)