Hi,
I've got a problem with matrices. I'm working on a project and I've got the following problem:
I have 2 matrices, and I need to check if the first one is a column-permutation of the second. For example:
1 5 8 5 1 8
4 7 9 7 4 9
In this case the algorithm should return true because if I move the second column of the second matrix in first position, I obtain a matrix equals to the first one.
Since I'm working with very large matrix, I can't generate all the parmutations of the second matrix, I need to an efficient algorithm.
My teacher suggest me to study something on matrix similarity, diagonalization etc...
do you have any idea?
Thank you very much
I've got a problem with matrices. I'm working on a project and I've got the following problem:
I have 2 matrices, and I need to check if the first one is a column-permutation of the second. For example:
1 5 8 5 1 8
4 7 9 7 4 9
In this case the algorithm should return true because if I move the second column of the second matrix in first position, I obtain a matrix equals to the first one.
Since I'm working with very large matrix, I can't generate all the parmutations of the second matrix, I need to an efficient algorithm.
My teacher suggest me to study something on matrix similarity, diagonalization etc...
do you have any idea?
Thank you very much