Recent content by Ojisan

True, but necessary for the problem that I am interested in. I should have stated my problem to include non-zero diagonal. In fact, I would like to maximize the Frobenius norm of the resultant diagonal matrix, but I was thinking that might be harder.

Thanks for your suggestion Hurkyl. Solutions do exist, although probably not unique. I can search with a brute force conditioning to find a solution, by imposing partial conditions as you suggest. The interpretation amounts to, for example, making A2x2 and A3x3 orthogonal to y1 while...

Thanks, but I'm not sure if I follow you. You should get the following with straight computation. \left( \begin{array}{lll} {y_1^H} & 0 & 0 \\ 0 & {y_2^H} & 0 \\ 0 & 0 & {y_3^H} \end{array} \right) \left( \begin{array}{lll} {A_1} & {A_2} & {A_3} \\ {A_4} & {A_5} & {A_6} \\...

I'm trying to solve the following problem (not homework :smile:) which is a strange form of diagonalization problem. Standard references and papers didn't turn up anything for me. Does anyone see possible approach for this? - Given n x n full rank random matrices A1, A2, ... A9 Find length...