Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
eigenvalues of matrices or operators
22
votes
0
answers
391
views
Why does the random shift in the QR eigenvalue algorithm work in the non-symmetric case over...
Now, if you do it without shifts, it will never converge if two eigenvalues have equal absolute values (which is not such an exceptional case: most real-valued matrices have conjugate pairs, the companion … However, in this case, one can start with small eigenvalues and have quite large below diagonal entries, so at least in the beginning I do not see why it is any better than shifting by a totally random …