Real root finding for determinants of linear matrices - Archive ouverte HAL Access content directly
Journal Articles Journal of Symbolic Computation Year : 2016

Real root finding for determinants of linear matrices


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.
Fichier principal
Vignette du fichier
determinant2.pdf (622.34 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01077888 , version 1 (27-10-2014)
hal-01077888 , version 2 (19-12-2014)
hal-01077888 , version 3 (22-05-2015)



Didier Henrion, Simone Naldi, Mohab Safey El Din. Real root finding for determinants of linear matrices. Journal of Symbolic Computation, 2016, 74, pp.205-238. ⟨10.1016/j.jsc.2015.06.010⟩. ⟨hal-01077888v3⟩
567 View
562 Download



Gmail Mastodon Facebook X LinkedIn More