DeepAI AI Chat
Log In Sign Up

Deterministic computation of the characteristic polynomial in the time of matrix multiplication

by   Vincent Neiger, et al.

This paper describes an algorithm which computes the characteristic polynomial of a matrix over a field within the same asymptotic complexity, up to constant factors, as the multiplication of two square matrices. Previously, this was only achieved by resorting to genericity assumptions or randomization techniques, while the best known complexity bound with a general deterministic algorithm was obtained by Keller-Gehrig in 1985 and involves logarithmic factors. Our algorithm computes more generally the determinant of a univariate polynomial matrix in reduced form, and relies on new subroutines for transforming shifted reduced matrices into shifted weak Popov matrices, and shifted weak Popov matrices into shifted Popov matrices.


page 1

page 2

page 3

page 4


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

New algorithms are presented for computing annihilating polynomials of T...

Computing Permanents on a Trellis

The problem of computing the permanent of a matrix has attracted interes...

Computing Popov and Hermite forms of rectangular polynomial matrices

We consider the computation of two normal forms for matrices over the un...

Stability and complexity of mixed discriminants

We show that the mixed discriminant of n positive semidefinite n × n rea...

Computing Canonical Bases of Modules of Univariate Relations

We study the computation of canonical bases of sets of univariate relati...

Linear Computation Coding: Exponential Search and Reduced-State Algorithms

Linear computation coding is concerned with the compression of multidime...

An exponent one-fifth algorithm for deterministic integer factorisation

Hittmeir recently presented a deterministic algorithm that provably comp...