Name
Abstract | ||
|---|---|---|
Structured low-rank approximation is the problem of minimizing a weighted Frobenius distance to a given matrix among all matrices of fixed rank in a linear space of matrices. We study exact solutions to this problem by way of computational algebraic geometry. A particular focus lies on Hankel matrices, Sylvester matrices and generic linear spaces. |
Year | Venue | Keywords |
|---|---|---|
2014 | SIAM J. Matrix Analysis Applications | low rank approximation |
Field | DocType | Volume |
Discrete mathematics,Matrix analysis,Mathematical optimization,Algebraic geometry,Algebra,Matrix (mathematics),Linear space,Low-rank approximation,Matrix multiplication,Mathematics | Journal | 35 |
Issue | Citations | PageRank |
4 | 11 | 0.88 |
References | Authors | |
4 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Giorgio Ottaviani | 1 | 138 | 11.93 |
| Pierre-Jean Spaenlehauer | 2 | 129 | 12.08 |
| Bernd Sturmfels | 3 | 926 | 136.85 |