If we know all the eigenvalues of a matrix A except the largest one. We want to apply shifted power iteration to get the largest eigenvalue. Something like $(A-\alpha I)$ . Then what should be the value of shift ($\alpha$) to make it converge as fast as possible ?
Shifter Power Method
0
$\begingroup$
linear-algebra
numerical-linear-algebra