2 search results - page 1 / 1 » The Asymptotics of Wilkinson's Shift: Loss of Cubic Converge... |
FOCM
2010
13 years 3 months ago
2010
One of the most widely used methods for eigenvalue computation is the QR iteration with Wilkinson’s shift: here the shift s is the eigenvalue of the bottom 2 × 2 principal mino...
MOC
2002
13 years 4 months ago
2002
This paper shows that for unitary Hessenberg matrices the QR algorithm, with (an exceptional initial-value modification of) the Wilkinson shift, gives global convergence; moreover,...