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...

Full description

Saved in:

Bibliographic Details
Published in:	Applicable algebra in engineering, communication and computing Vol. 31; no. 2; pp. 101 - 133
Main Authors:	Henrion, Didier, Naldi, Simone, Din, Mohab Safey El
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2020 Springer Nature B.V Springer Verlag
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!