DeepAI AI Chat
Log In Sign Up

On Fast Computation of a Circulant Matrix-Vector Product

03/03/2021
by   Andreas Rosowski, et al.
WEB.DE
0

This paper deals with circulant matrices. It is shown that a circulant matrix can be multiplied by a vector in time O(n log(n)) in a ring with roots of unity without making use of an FFT algorithm. With our algorithm we achieve a speedup of a factor of about 2.25 for the multiplication of two polynomials with integer coefficients compared to multiplication by an FFT algorithm. Moreover this paper discusses multiplication of large integers as further application.

READ FULL TEXT

page 1

page 2

page 3

page 4

12/31/2021

Fast ultrametric matrix-vector multiplication

We study the properties of ultrametric matrices aiming to design methods...
12/17/2016

Parallel Integer Polynomial Multiplication

We propose a new algorithm for multiplying dense polynomials with intege...
09/26/2017

PMV: Pre-partitioned Generalized Matrix-Vector Multiplication for Scalable Graph Mining

How can we analyze enormous networks including the Web and social networ...
01/04/2021

Some fast algorithms multiplying a matrix by its adjoint

We present a non-commutative algorithm for the multiplication of a 2 x 2...
01/13/2020

On fast multiplication of a matrix by its transpose

We present a non-commutative algorithm for the multiplication of a 2x2-b...
02/10/2020

Efficient Matrix Multiplication: The Sparse Power-of-2 Factorization

We present an algorithm to reduce the computational effort for the multi...
08/30/2021

MultPIM: Fast Stateful Multiplication for Processing-in-Memory

Processing-in-memory (PIM) seeks to eliminate computation/memory data tr...

Code Repositories