Related papers: Fast polynomial transforms based on Toeplitz and H…
We present the first systematic extension of the classical Hermite-Laguerre quadratic correspondence to the matrix-valued setting. Starting from a Hermite-type weight matrix W(x) = exp(-x^2) Z(x) with W(x) = W(-x), the change of variables y…
The idea of decomposing a matrix into a product of structured matrices such as triangular, orthogonal, diagonal matrices is a milestone of numerical computations. In this paper, we describe six new classes of matrix decompositions,…
The fast Fourier transform (FFT) is one of the most successful numerical algorithms of the 20th century and has found numerous applications in many branches of computational science and engineering. The FFT algorithm can be derived from a…
We present a non-commutative algorithm for the multiplication of a 2 x 2 block-matrix by its adjoint, defined by a matrix ring anti-homomorphism. This algorithm uses 5 block products (3 recursive calls and 2 general products)over C or in…
Polynomial system solving is a classical problem in mathematics with a wide range of applications. This makes its complexity a fundamental problem in computer science. Depending on the context, solving has different meanings. In order to…
We present a new algorithm for fast matrix multiplication using tensor decompositions which have special features. Thanks to these features we obtain exponents lower than what the rank of the tensor decomposition suggests. In particular for…
We study the Hankel transforms of sequences related to the central coefficients of a family of Pascal-like triangles. The mechanism of Riordan arrays is used to elucidate the structure of these transforms.
We propose an algorithm for quickly evaluating polynomials. It pre-conditions a complex polynomial $P$ of degree $d$ in time $O(d\log d)$, with a low multiplicative constant independent of the precision. Subsequent evaluations of $P$…
Factorization machines and polynomial networks are supervised polynomial models based on an efficient low-rank decomposition. We extend these models to the multi-output setting, i.e., for learning vector-valued functions, with application…
Matrix multiplication (MatMul) is the computational backbone of modern machine learning, yet its classical complexity remains a bottleneck for large-scale data processing. We propose a hybrid quantum-classical algorithm for matrix…
It is well known that, using fast algorithms for polynomial multiplication and division, evaluation of a polynomial $F \in \mathbb{C}[x]$ of degree $n$ at $n$ complex-valued points can be done with $\tilde{O}(n)$ exact field operations in…
We consider the quantum complexity of estimating matrix elements of unitary irreducible representations of groups. For several finite groups including the symmetric group, quantum Fourier transforms yield efficient solutions to this…
We investigate the joint convergence of independent random Toeplitz matrices with complex input entries that have a pair-correlation structure, along with deterministic Toeplitz matrices and the backward identity permutation matrix.…
Fast Fourier transform (FFT) based methods have turned out to be an effective computational approach for numerical homogenisation. In particular, Fourier-Galerkin methods are computational methods for partial differential equations that are…
A new O(N) algorithm based on a recursion method, in which the computational effort is proportional to the number of atoms N, is presented for calculating the inverse of an overlap matrix which is needed in electronic structure calculations…
We propose an algebraic framework generalizing several variants of Prony's method and explaining their relations. This includes Hankel and Toeplitz variants of Prony's method for the decomposition of multivariate exponential sums,…
A fast Fourier transform method for computing the weight enumerator polynomial and trigonometric degree of lattice rules is introduced.
We show that Boolean matrix multiplication, computed as a sum of products of column vectors with row vectors, is essentially the same as Warshall's algorithm for computing the transitive closure matrix of a graph from its adjacency matrix.…
We present a method for the explicit diagonalization of some Hankel operators. This method allows us to recover classical results on the diagonalization of Hankel operators with the absolutely continuous spectrum. It leads also to new…
We present a novel algorithm for calculating the discrete fractional Hadamard transform for data vectors whose size N is a power of two. A direct method for calculation of the discrete fractional Hadamard transform requires $N^2$…