Completing a Matrix so as to Minimize the Rank
Chandler Davis · Birkhäuser Basel eBooks · 1988
The problem of choosing the missing entry in the partial matrix \(\begin{bmatrix}\text{A} & \text{C} \\\text{B} & ? \end{bmatrix}\) so as to minimize the rank, which had earlier been solved only under a somewhat restrictive hypothesis, is here given a general solution, with description of the full solution set. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.