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
This paper proposes a partial refactorization for faster nonlinear analysis based on sparse matrix s...
Sparse matrix-vector multiplication (SpMxV) is one of the most important computational kernels in sc...
I create a library for storing matrices and working with matrices in this bachelor’s thesis. In this...
Space Filling Curve sparse matrix reordering implementationsif you use components of this software, ...
Thesis (B.S.) in Chemical Engineering--University of Illinois at Urbana-Champaign, 1980.Bibliography...
The paper "Bringing Order to Sparsity: A Sparse Matrix Reordering Study on Multicore CPUs" compares ...
The paper "Bringing Order to Sparsity: A Sparse Matrix Reordering Study on Multicore CPUs" compares ...
Sparse matrix-vector multiplication (shortly SpMV) is one of most common subroutines in the numerica...
Abstract. We present a recursive way to partition hypergraphs which creates and exploits hypergraph ...
When performing sparse matrix factorization, the ordering of matrix rows and columns has a dramatic ...
This work demonstrates the concept of describing adjacency relations as set-valued mappings, which h...
We present implementation details of a reordering strategy for permuting elements whose absolute val...
Abstract—Many sparse matrix computations can be speeded up if the matrix is first reordered. Reorder...
The proposed paper presents a variety novel uses of Space-Filling-Curves (SFCs) for Cartesian mesh m...
SparseM provides some basic R functionality for linear algebra with sparse matrices. Use of the pack...
This paper proposes a partial refactorization for faster nonlinear analysis based on sparse matrix s...
Sparse matrix-vector multiplication (SpMxV) is one of the most important computational kernels in sc...
I create a library for storing matrices and working with matrices in this bachelor’s thesis. In this...
Space Filling Curve sparse matrix reordering implementationsif you use components of this software, ...
Thesis (B.S.) in Chemical Engineering--University of Illinois at Urbana-Champaign, 1980.Bibliography...
The paper "Bringing Order to Sparsity: A Sparse Matrix Reordering Study on Multicore CPUs" compares ...
The paper "Bringing Order to Sparsity: A Sparse Matrix Reordering Study on Multicore CPUs" compares ...
Sparse matrix-vector multiplication (shortly SpMV) is one of most common subroutines in the numerica...
Abstract. We present a recursive way to partition hypergraphs which creates and exploits hypergraph ...
When performing sparse matrix factorization, the ordering of matrix rows and columns has a dramatic ...
This work demonstrates the concept of describing adjacency relations as set-valued mappings, which h...
We present implementation details of a reordering strategy for permuting elements whose absolute val...
Abstract—Many sparse matrix computations can be speeded up if the matrix is first reordered. Reorder...
The proposed paper presents a variety novel uses of Space-Filling-Curves (SFCs) for Cartesian mesh m...
SparseM provides some basic R functionality for linear algebra with sparse matrices. Use of the pack...
This paper proposes a partial refactorization for faster nonlinear analysis based on sparse matrix s...
Sparse matrix-vector multiplication (SpMxV) is one of the most important computational kernels in sc...
I create a library for storing matrices and working with matrices in this bachelor’s thesis. In this...