Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Is there a transformation to decrease the dimension of a matrix so that it becomes full rank?

share|cite|improve this question
What are you actually trying to do? – J. M. May 12 '12 at 15:50
I'm playing around with power methods for solving the eigen problem. After I solve for the first eigenvector and set up the system for solving the next eigenvector I notice that the converges is much slower (empirical result), I'm wondering if that is because the matrix is no longer full rank. – csta May 12 '12 at 16:03
Well, the power method was always intended for getting just the dominant eigenpair. If you need to pick eigenpairs, look up the inverse power method. – J. M. May 12 '12 at 16:13
The inverse power method is even slower then the traditional power method, as my system is fairly large (~$10^4$). Also I believe my question is well posed in the sense of – csta May 12 '12 at 17:23
... your having a large matrix seems to have not been mentioned in your OP. Is this large matrix of yours completely and utterly random, or did it come from somewhere, and thus has attendant structure (e.g. symmetry, sparsity) to it? – J. M. May 12 '12 at 17:29

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.