Randomized Compression of Rank-Structured Matrices Accelerated with Graph Coloring

05/06/2022
by   James Levitt, et al.
0

A randomized algorithm for computing a data sparse representation of a given rank structured matrix A (a.k.a. an ℋ-matrix) is presented. The algorithm draws on the randomized singular value decomposition (RSVD), and operates under the assumption that algorithms for rapidly applying A and A^* to vectors are available. The algorithm analyzes the hierarchical tree that defines the rank structure using graph coloring algorithms to generate a set of random test vectors. The matrix is then applied to the test vectors, and in a final step the matrix itself is reconstructed by the observed input-output pairs. The method presented is an evolution of the "peeling algorithm" of L. Lin, J. Lu, and L. Ying, "Fast construction of hierarchical matrix representation from matrix-vector multiplication," JCP, 230(10), 2011. For the case of uniform trees, the new method substantially reduces the pre-factor of the original peeling algorithm. More significantly, the new technique leads to dramatic acceleration for many non-uniform trees since it constructs sample vectors that are optimized for a given tree. The algorithm is particularly effective for kernel matrices involving a set of points restricted to a lower dimensional object than the ambient space, such as a boundary integral equation defined on a surface in three dimensions.

READ FULL TEXT
research
05/06/2022

Linear-Complexity Black-Box Randomized Compression of Hierarchically Block Separable Matrices

A randomized algorithm for computing a compressed representation of a gi...
research
05/27/2021

A generalization of the randomized singular value decomposition

The randomized singular value decomposition (SVD) is a popular and effec...
research
12/14/2018

The PowerURV algorithm for computing rank-revealing full factorizations

Many applications in scientific computing and data science require the c...
research
02/09/2020

Butterfly factorization via randomized matrix-vector multiplications

This paper presents an adaptive randomized algorithm for computing the b...
research
09/16/2023

Adaptive multiplication of rank-structured matrices in linear complexity

Hierarchical matrices approximate a given matrix by a decomposition into...
research
10/09/2018

Matrix-free construction of HSS representation using adaptive randomized sampling

We present new algorithms for the randomized construction of hierarchica...
research
07/15/2019

A Recursive Algebraic Coloring Technique for Hardware-Efficient Symmetric Sparse Matrix-Vector Multiplication

The symmetric sparse matrix-vector multiplication (SymmSpMV) is an impor...

Please sign up or login with your details

Forgot password? Click here to reset