Real root finding for low rank linear matrices

We consider m × s matrices (with m ≥ s ) in a real affine subspace of dimension n . The problem of finding elements of low rank in such spaces finds many applications in information and systems theory, where low rank is synonymous of structure and parsimony. We design computer algebra algorithms, ba...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Applicable algebra in engineering, communication and computing Jg. 31; H. 2; S. 101 - 133
Hauptverfasser: Henrion, Didier, Naldi, Simone, Din, Mohab Safey El
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2020
Springer Nature B.V
Springer Verlag
Schlagworte:
Algebraic Geometry
Algorithms
Artificial Intelligence
Computer algebra
Computer Hardware
Computer Science
Mathematical analysis
Mathematics
Matrix methods
Original Paper
Parameterization
Polynomials
Symbolic and Algebraic Manipulation
Symbolic Computation
System theory
Systems theory
Theory of Computation
13-XX
68W30
Polynomial system solving
14Q20
12Y05
Low rank matrices
Real algebraic geometry
Symbolic computation
ISSN:0938-1279, 1432-0622
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We consider m × s matrices (with m ≥ s ) in a real affine subspace of dimension n . The problem of finding elements of low rank in such spaces finds many applications in information and systems theory, where low rank is synonymous of structure and parsimony. We design computer algebra algorithms, based on advanced methods for polynomial system solving, 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 polynomial in n + m ( s - r ) n . It improves on the state-of-the-art in computer algebra and effective real algebraic geometry. Moreover, computer experiments show the practical efficiency of our approach.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0938-1279
1432-0622
DOI:10.1007/s00200-019-00396-w