Computing with quasiseparable matrices

02/03/2016
by   Clement Pernet, et al.
0

The class of quasiseparable matrices is defined by a pair of bounds, called the quasiseparable orders, on the ranks of the maximal sub-matrices entirely located in their strictly lower and upper triangular parts. These arise naturally in applications, as e.g. the inverse of band matrices, and are widely used for they admit structured representations allowing to compute with them in time linear in the dimension and quadratic with the quasiseparable order. We show, in this paper, the connection between the notion of quasisepa-rability and the rank profile matrix invariant, presented in [Dumas & al. ISSAC'15]. This allows us to propose an algorithm computing the quasiseparable orders (rL, rU) in time O(n^2 s^(ω--2)) where s = max(rL, rU) and ω the exponent of matrix multiplication. We then present two new structured representations, a binary tree of PLUQ decompositions, and the Bruhat generator, using respectively O(ns log n/s) and O(ns) field elements instead of O(ns^2) for the previously known generators. We present algorithms computing these representations in time O(n^2 s^(ω--2)). These representations allow a matrix-vector product in time linear in the size of their representation. Lastly we show how to multiply two such structured matrices in time O(n^2 s^(ω--2)).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/02/2017

Time and space efficient generators for quasiseparable matrices

The class of quasiseparable matrices is defined by the property that any...
research
01/01/2018

Computation of Maximal Determinants of Binary Circulant Matrices

We describe algorithms for computing maximal determinants of binary circ...
research
03/14/2022

Fast Regression for Structured Inputs

We study the ℓ_p regression problem, which requires finding 𝐱∈ℝ^d that m...
research
08/04/2023

Computation of quasiseparable representations of Green matrices

The well-known Asplund theorem states that the inverse of a (possibly on...
research
07/10/2018

Computing Height Persistence and Homology Generators in R^3 Efficiently

Recently it has been shown that computing the dimension of the first hom...
research
05/17/2018

Systematic encoders for generalized Gabidulin codes and the q-analogue of Cauchy matrices

We characterize the generator matrix in standard form of generalized Gab...
research
05/24/2019

New ways to multiply 3 x 3-matrices

It is known since the 1970s that no more than 23 multiplications are req...

Please sign up or login with your details

Forgot password? Click here to reset