On matrices with displacement structure: generalized operators and faster algorithms

03/10/2017
by   Alin Bostan, et al.
0

For matrices with displacement structure, basic operations like multiplication, inversion, and linear system solving can all be expressed in terms of the following task: evaluate the product AB, where A is a structured n × n matrix of displacement rank α, and B is an arbitrary n×α matrix. Given B and a so-called "generator" of A, this product is classically computed with a cost ranging from O(α^2 M(n)) to O(α^2 M(n)(n)) arithmetic operations, depending on the type of structure of A; here, M is a cost function for polynomial multiplication. In this paper, we first generalize classical displacement operators, based on block diagonal matrices with companion diagonal blocks, and then design fast algorithms to perform the task above for this extended class of structured matrices. The cost of these algorithms ranges from O(α^ω-1M(n)) to O(α^ω-1M(n)(n)), with ω such that two n × n matrices over a field can be multiplied using O(n^ω) field operations. By combining this result with classical randomized regularization techniques, we obtain faster Las Vegas algorithms for structured inversion and linear system solving.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/17/2021

Faster Sparse Matrix Inversion and Rank Computation in Finite Fields

We improve the current best running time value to invert sparse matrices...
research
12/21/2022

Fast multiplication, determinants, and inverses of arrowhead and diagonal-plus-rank-one matrices over associative fields

The article considers arrowhead and diagonal-plus-rank-one matrices in F...
research
04/06/2021

Computing the Characteristic Polynomial of Generic Toeplitz-like and Hankel-like Matrices

New algorithms are presented for computing annihilating polynomials of T...
research
05/10/2019

Implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants

Complexity bounds for many problems on matrices with univariate polynomi...
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
09/04/2019

A Non-commutative Bilinear Model for Answering Path Queries in Knowledge Graphs

Bilinear diagonal models for knowledge graph embedding (KGE), such as Di...

Please sign up or login with your details

Forgot password? Click here to reset