Geometric multiplicity margin for a submatrix Original Research Article

Let G be a square complex matrix with less than k nonconstant invariant factors. We find a complex matrix that gives an optimal approximation to G among all possible matrices that have more than or equal to k invariant factors, obtained by varying only the entries of a bottom right submatrix of G.