Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Real root finding for determinants of linear matrices

Abstract : Let A_0 , A_1 , . . . , A_n be given square matrices of size m with rational coefficients. The paper focuses on the exact computation of one point in each connected component of the real determinantal variety {x ∈ R^n : det(A_0 + x_1 A_1 + · · · + x_n A_n) = 0}. Such a problem finds applications in many areas such as control theory, computational geometry, optimization, etc. Using standard complexity results this problem can be solved using m^{O(n)} arithmetic operations. Under some genericity assumptions on the coefficients of the matrices, we provide an algorithm solving this problem whose runtime is essentially quadratic in {{n+m}\choose{n}}^{3} . We also report on experiments with a computer implementation of this algorithm. Its practical performance illustrates the complexity estimates. In particular, we emphasize that for subfamilies of this problem where m is fixed, the complexity is polynomial in n.
Complete list of metadatas
Contributor : Didier Henrion <>
Submitted on : Monday, October 27, 2014 - 2:27:28 PM
Last modification on : Sunday, January 12, 2020 - 5:28:02 PM
Document(s) archivé(s) le : Wednesday, January 28, 2015 - 11:11:41 AM


Files produced by the author(s)


  • HAL Id : hal-01077888, version 1


Didier Henrion, Simone Naldi, Mohab Safey El Din. Real root finding for determinants of linear matrices. 2014. ⟨hal-01077888v1⟩



Record views


Files downloads