How are we gonna do for n×n matrix if this shifting operation works same as inverse power method giving the least eigenvalue. How are we going to calculate the middle eigenvalues ( lets say 5×5 the middle three eigenvalues).
find the shifted matrix first (you may want to search for this procedure), but it involves lotsss of work. Better way is to use different method such as QR method to find all eigenvalues. Hope this at least give u idea..
