1 problem

Quadratic-time algorithm for overlapping Hankel block low-rank completion
Consider the overlapping Hankel block low-rank completion problem, with matrix-size parameter $N$ , and let $\hat{X}$ denote a candidate completed matrix. Quadratic-time completion…
openalgorithms low-rank-matrix-completion structured-matrices
0 responses
06

Quadratic-time algorithm for overlapping Hankel block low-rank completion