Geometry-Oblivious FMM for Compressing Dense SPD Matrices

07/01/2017
by   Chenhan D. Yu, et al.
0

We present GOFMM (geometry-oblivious FMM), a novel method that creates a hierarchical low-rank approximation, "compression," of an arbitrary dense symmetric positive definite (SPD) matrix. For many applications, GOFMM enables an approximate matrix-vector multiplication in N N or even N time, where N is the matrix size. Compression requires N N storage and work. In general, our scheme belongs to the family of hierarchical matrix approximation methods. In particular, it generalizes the fast multipole method (FMM) to a purely algebraic setting by only requiring the ability to sample matrix entries. Neither geometric information (i.e., point coordinates) nor knowledge of how the matrix entries have been generated is required, thus the term "geometry-oblivious." Also, we introduce a shared-memory parallel scheme for hierarchical matrix computations that reduces synchronization barriers. We present results on the Intel Knights Landing and Haswell architectures, and on the NVIDIA Pascal architecture for a variety of matrices.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/05/2019

Hierarchical Matrix Operations on GPUs: Matrix-Vector Multiplication and Compression

Hierarchical matrices are space and time efficient representations of de...
research
07/22/2022

Ladder Matrix Recovery from Permutations

We give unique recovery guarantees for matrices of bounded rank that hav...
research
05/07/2020

Delayed approximate matrix assembly in multigrid with dynamic precisions

The accurate assembly of the system matrix is an important step in any c...
research
01/24/2023

Logarithmically Sparse Symmetric Matrices

A positive definite matrix is called logarithmically sparse if its matri...
research
06/22/2021

Toward a new fully algebraic preconditioner for symmetric positive definite problems

A new domain decomposition preconditioner is introduced for efficiently ...
research
06/06/2022

The structured distance to singularity of a symmetric tridiagonal Toeplitz matrix

This paper is concerned with the distance of a symmetric tridiagonal Toe...
research
10/27/2020

Matrix compression along isogenic blocks

A matrix-compression algorithm is derived from a novel isogenic block de...

Please sign up or login with your details

Forgot password? Click here to reset