||April 8, 2013 12:25
Originally Posted by TheRenegade
Isn't this equivalent to solving
? This is just a linear system that can be solved a number of ways.
But this linear system is still a little special. There are n+1 unknowns (n = size
and "+ 1" is
) while you will only find n unknowns (e.g.
) by solving the linear system. In other words, there is one
you can think of.
Anyway, there are n
for which you will not only find one but infinitely many solutions. These are the Eigenvalues and these are the same as in
because Eigenvalue only means "the value of
linearly dependent". You will find a linearly dependent matrix by setting its determinant to 0, which is the "characteristic equation" you might have heard of. In that case, an Eigenvector is one of these infinitely many solutions (e.g. if the Eigenvector for a 2x2 matrix is [1;2] it could also be [2;4] and so on).
Back to your question: You could find some kind of Eigenvector and Eigenvalue, which is the same as in the original Eigenvalueproblem and additionally you will find infinitely many other solutions for infinitely many other
. In the real Eigenvalueproblem, these infinitely many solutions are all 0, which is why you search for the only non-zero solution. But in your case most of them will be non-zero solutions and only you are able to know what this might mean.
My hones advice: You should check if this equation is really what you want/need to solve!