Do different eigenvector algorithms yield different results?

  • Thread starter Thread starter disillusioned
  • Start date Start date
  • Tags Tags
    Eigenvector
disillusioned
Messages
1
Reaction score
0
Hi,

Does different eigenvector algorithm give different result?
eg. using QL with implicit shifts frm (Numerical Recipes) vs Matlab's LAPACK routines?

or anyone knows what method Matlab's LAPACK uses & where i can find the source code in c++?

Are eigenvectors unique?

Thanks!
 
Physics news on Phys.org
I don't know what algoritms you mean and I`m not that familiar with Matlab.

Anyway, different eigenvalues always correspond to linearly independent eigenvectors.
But it is possible to have two linearly independent eigenvectors corresponding to the same eigenvalue.

Hope that helps.
 
disillusioned said:
Are eigenvectors unique?
No they're not. Depending on arbitrary choices made while using whatever algorithm you choose you can end up with a different set of eigenvectors than someone else doing the same problem. As a simple example, if [1,2,3] is your eigenvector and [2,4,6]=2[1,2,3] is your friend's, they're both right (assuming one of them is!).
 
look, take the identity map. then anything is an eigenvector (except zero). so what do you mean by unique"
 
Thread 'Determine whether ##125## is a unit in ##\mathbb{Z_471}##'
This is the question, I understand the concept, in ##\mathbb{Z_n}## an element is a is a unit if and only if gcd( a,n) =1. My understanding of backwards substitution, ... i have using Euclidean algorithm, ##471 = 3⋅121 + 108## ##121 = 1⋅108 + 13## ##108 =8⋅13+4## ##13=3⋅4+1## ##4=4⋅1+0## using back-substitution, ##1=13-3⋅4## ##=(121-1⋅108)-3(108-8⋅13)## ... ##= 121-(471-3⋅121)-3⋅471+9⋅121+24⋅121-24(471-3⋅121## ##=121-471+3⋅121-3⋅471+9⋅121+24⋅121-24⋅471+72⋅121##...
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
Back
Top