Real root finding for rank defects in linear Hankel matrices

Didier Henrion 1, 2 Simone Naldi 1, 3 Mohab Safey El Din 3
1 LAAS-MAC - Équipe Méthodes et Algorithmes en Commande
LAAS - Laboratoire d'analyse et d'architecture des systèmes [Toulouse]
3 PolSys - Polynomial Systems
LIP6 - Laboratoire d'Informatique de Paris 6, Inria Paris-Rocquencourt
Abstract : Let $H_0, \ldots, H_n$ be $m \times m$matrices with entries in $\QQ$ and Hankel structure, i.e. constant skew diagonals.We consider the linear Hankel matrix $H(\vecx)=H_0+\X_1H_1+\cdots+\X_nH_n$ and the problem of computing sample points in each connected component of the real algebraic set defined by the rank constraint ${\sf rank}(H(\vecx))\leq r$, for a given integer $r \leq m-1$. Computing sample points in real algebraic sets defined by rank defects in linear matrices is a general problem that finds applications in many areas such as control theory, computational geometry, optimization, etc. Moreover, Hankel matrices appear in many areas of engineering sciences. Also, since Hankel matrices are symmetric, any algorithmic development for this problem can be seen as a first step towards a dedicated exact algorithm for solving semi-definite programming problems, i.e. linear matrix inequalities. Under some genericity assumptions on the input (such as smoothness of an incidence variety), we design a probabilistic algorithm for tackling this problem. It is an adaptation of the so-called critical point method that takes advantage of the special structure of the problem. Its complexity reflects this: it is essentially quadratic in specific degree bounds on an incidence variety. We report on practical experiments and analyze how the algorithm takes advantage of this special structure. A first implementation outperforms existing implementations for computing sample points in general real algebraic sets: it tackles examples that are out of reach of the state-of-the-art.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01114378
Contributor : Didier Henrion <>
Submitted on : Monday, February 9, 2015 - 12:41:01 PM
Last modification on : Tuesday, June 25, 2019 - 1:26:23 AM
Long-term archiving on : Saturday, September 12, 2015 - 9:56:42 AM

Files

hankel.pdf
Files produced by the author(s)

Identifiers

Citation

Didier Henrion, Simone Naldi, Mohab Safey El Din. Real root finding for rank defects in linear Hankel matrices. International Symposium on Symbolic and Algebraic Computation (ISSAC), Jul 2015, Bath, United Kingdom. pp.221-228, ⟨10.1145/2755996.2756667⟩. ⟨hal-01114378⟩

Share

Metrics

Record views

544

Files downloads

185