Space Filling Curve sparse matrix reordering implementations


Contact
Stephan.Frickenhaus [ at ] awi.de

Abstract

This is a collection of codes for Space Filling Curve renumbering of sparse matrices. Main code of SFC-renumbering is based on a work by Rakowsky and Fuchs (2011) (http://hdl.handle.net/10013/epic.39576.d001). There is a C++-interface to R, and a demontrator of improved cache-efficiency for Matrix Vector product (SparseM, CSR-fornmat) with a pseudo FE-matrix created on the fly from a FE-like 2D-mesh. We include an R-script applying SFC on the matrix structure, depicted in a 2D-graph representation, rather than on a FE-like mesh. This is achieved by a very fast graph-layout in 2D by pivotMDS on the matrix adjacency structure.



Item Type
Software
Authors
Divisions
Primary Division
Programs
Primary Topic
Helmholtz Cross Cutting Activity (2021-2027)
Publication Status
Published
Eprint ID
56760
DOI 10.5281/zenodo.6962154

Cite as
Frickenhaus, S. and Rakowsky, N. (2022): Space Filling Curve sparse matrix reordering implementations , [Software] doi: 10.5281/zenodo.6962154


Share
Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email


Citation

Research Platforms
N/A

Campaigns
N/A


Actions
Edit Item Edit Item