A Cache-Optimal Alternative to the Unidirectional Hierarchization Algorithm
From MaRDI portal
Publication:2808020
DOI10.1007/978-3-319-28262-6_5zbMath1356.65275OpenAlexW2472067411MaRDI QIDQ2808020
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
Parallel numerical computation (65Y05) Numerical algorithms for specific classes of architectures (65Y10)
Related Items
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
Cites Work
- Unnamed Item
- Unnamed Item
- Communication lower bounds for distributed-memory matrix multiplication
- Error analysis of the combination technique
- Minimizing Communication in Numerical Linear Algebra
- Cache-Oblivious Algorithms
- Convergence of the Combination Technique for Second-Order Elliptic Differential Equations
- The efficient solution of fluid dynamics problems by the combination technique
- Analysis of linear difference schemes in the sparse grid combination technique
- Sparse grids