Fast ultrametric matrix-vector multiplication

12/31/2021
by   Tobias Hofmann, et al.
0

We study the properties of ultrametric matrices aiming to design methods for fast ultrametric matrix-vector multiplication. We show how to encode such a matrix as a tree structure in quadratic time and demonstrate how to use the resulting representation to perform matrix-vector multiplications in linear time. Accompanying this article, we provide an implementation of the proposed algorithms and present empirical results on their practical performance.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/03/2021

On Fast Computation of a Circulant Matrix-Vector Product

This paper deals with circulant matrices. It is shown that a circulant m...
research
09/12/2023

Ensemble Mask Networks

Can an ℝ^n→ℝ^n feedforward network learn matrix-vector multiplication? T...
research
02/02/2022

Giga-scale Kernel Matrix Vector Multiplication on GPU

Kernel matrix-vector multiplication (KMVM) is a foundational operation i...
research
04/24/2020

An extra-components method for evaluating fast matrix-vector multiplication with special functions

In calculating integral or discrete transforms, fast algorithms for mult...
research
10/30/2019

Effect of Mixed Precision Computing on H-Matrix Vector Multiplication in BEM Analysis

Hierarchical Matrix (H-matrix) is an approximation technique which split...
research
07/19/2012

The Fast Cauchy Transform and Faster Robust Linear Regression

We provide fast algorithms for overconstrained ℓ_p regression and relate...
research
04/29/2020

Complexity Analysis of a Fast Directional Matrix-Vector Multiplication

We consider a fast, data-sparse directional method to realize matrix-vec...

Please sign up or login with your details

Forgot password? Click here to reset