Name
Abstract | ||
|---|---|---|
We consider $$m \times s$$ matrices (with $$m\ge 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 $$\left( {\begin{array}{c}n+m(s-r)\\ n\end{array}}\right) $$. 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. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/s00200-019-00396-w | Applicable Algebra in Engineering, Communication and Computing |
Keywords | Field | DocType |
Symbolic computation, Low rank matrices, Polynomial system solving, Real algebraic geometry, 13-XX, 14Q20, 12Y05, 68W30 | Discrete mathematics,Combinatorics,Affine space,Finite set,Polynomial,Matrix (mathematics),Symbolic computation,Root-finding algorithm,Connected component,Real algebraic geometry,Mathematics | Journal |
Volume | Issue | ISSN |
31 | 2 | 0938-1279 |
Citations | PageRank | References |
2 | 0.37 | 21 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Didier Henrion | 1 | 987 | 88.48 |
| Simone Naldi | 2 | 20 | 3.09 |
| Mohab Safey El Din | 3 | 450 | 35.64 |