A Hilbert-order multiplication scheme for unstructured sparse matrices

DOI10.1080/17445760601122084zbMath1122.65037OpenAlexW2057542391WikidataQ61919851 ScholiaQ61919851MaRDI QIDQ5758155

Gernot Plank, Gundolf Haase, Manfred Liebmann

Publication date: 3 September 2007

Published in: International Journal of Parallel, Emergent and Distributed Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/17445760601122084

zbMATH Keywords

numerical examplesmatrix-vector multiplicationsunstructured sparse matricescompressed row storagefractal storagespace-filling Hilbert curve

Mathematics Subject Classification ID

Related Items (2)

A Cache-Oblivious Sparse Matrix–Vector Multiplication Scheme Based on the Hilbert Curve ⋮ Efficient Mesh Management in Firedrake Using PETSc DMPlex

Cites Work

• Space-filling curves
• Cache-aware multigrid methods for solving Poisson's equation in two dimensions
• Algebraic multigrid methods based on element preconditioning
• A cache‐oblivious self‐adaptive full multigrid method
• A Tutorial on Elliptic PDE Solvers and Their Parallelization
• A Multigrid Tutorial, Second Edition
• Cache Issues of Algebraic Multigrid Methods for Linear Systems with Multiple Right-Hand Sides

This page was built for publication: A Hilbert-order multiplication scheme for unstructured sparse matrices