A Hilbert-order multiplication scheme for unstructured sparse matrices

DOI10.1080/17445760601122084MaRDI QIDQ5758155zbMATH OpenOpenAlexWikidataFDO

Authors Gunfolf Haase, Manfred Liebmann, Gernot Plank

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

compressed row storagefractal storagematrix-vector multiplicationsnumerical examplesspace-filling Hilbert curveunstructured sparse matrices

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Information storage and retrieval of data (68P20)

Recommendations

• A Cache-Oblivious Sparse Matrix–Vector Multiplication Scheme Based on the Hilbert Curve
• SPARSE MATRIX MULTIPLICATION ON VECTOR COMPUTERS
• Compressed multirow storage format for sparse matrices on graphics processing units
• Improved row-grouped CSR format for storing of sparse matrices on GPU
• Computational Science – ICCS 2005

Cites work

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

Cited in

(2)

• Efficient mesh management in firedrake using PETSc DMPlex
• A Cache-Oblivious Sparse Matrix–Vector Multiplication Scheme Based on the Hilbert Curve

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5758155)