On computing the determinant over a ring
Gilles Villard
Abstract
An algorithm is presented for computing the determinant and the characteristic polynomial of a matrix A over an arbitrary commutative ring R. The algorithm uses O(nω) ring additions, subtractions and multiplications, where ω>2 is a feasible exponent for matrix multiplication, that is, such that two n× n matrices over R can be multiplied using O(nω) ring operations. The algorithm involves no division and no zero test, and its control depends only on n: for each n it is a straight-line program. The approach combines a polynomial matrix point of view and a block Krylov point of view on the characteristic polynomial, which makes Strassen's elimination of divisions efficient. A bivariate matrix λI-L(t), obtained from A by a homotopy, is compressed in n steps, each of which halves the dimension while only doubling the degree in λ. The cost of the homotopy is controlled by truncating the power series in t at an order that only grows with the compression steps, from a constant to n.
Create a lesson
Related papers
Partial Homogenization and the Structure of Optimal Algebraic Algorithms
Yuval Spiizer
A Survey on the Use of Machine Learning within Computer Algebra
Uzma Shafiq, Matthew England, Nayyar Zaidi
Floating-point, exact and certified computation for control: paradigms, pitfalls, and how to combine them
Christina Katsamaki, Fabrice Rouillier
Reliable Computation of the L∞-Norm of Linear Time-Invariant Systems Depending on One Parameter
Florent Corniquel, Alban Quadrat, Fabrice Rouillier et al.
Exact certification for conic optimization over quadratic modules: partitions of unity and recession directions
Didier Henrion, Alaa Ibrahim, Victor Magron
Where models of minimal height are hard to find: cubic rational maps with a multiple fixed point
Elira Shaska