Real root finding for low rank linear matrices - Archive ouverte HAL Access content directly
Journal Articles Applicable Algebra in Engineering, Communication and Computing Year : 2020

Real root finding for low rank linear matrices

Abstract

The problem of finding m × s matrices (with m ≥ s) of rank r in a real affine subspace of dimension n has many applications in information and systems theory, where low rank is synonymous of structure and parsimony. We design computer algebra algorithms to solve this problem efficiently and exactly: the input are the rational coefficients of the matrices spanning the affine subspace as well as the expected maximum rank, and the output is a rational parametrization encoding a finite set of points that intersects each connected component of the low rank real algebraic set. The complexity of our algorithm is studied thoroughly. It is essentially polynomial in n+m(s−r) ; it improves on the state-of-the-art in the field. Moreover, computer experiments show the practical efficiency of our approach.
newlowrank.pdf (809.05 Ko) Télécharger le fichier
Loading...

Dates and versions

hal-01159210 , version 1 (02-06-2015)
hal-01159210 , version 2 (25-10-2017)

Identifiers

Cite

Didier Henrion, Simone Naldi, Mohab Safey El Din. Real root finding for low rank linear matrices. Applicable Algebra in Engineering, Communication and Computing, 2020, 31, pp.101-133. ⟨10.1007/s00200-019-00396-w⟩. ⟨hal-01159210v2⟩
544 View
124 Download

Altmetric

Share

Gmail Facebook X LinkedIn More