The convergence of multi-shift QR algorithm for symmetric matrices
In this paper, we discuss the convergence of the double-shift and multi-shift QR algorithms for symmetric tridiagonal matrices. We analyze how to choose multi-shifts by comparing the relationships between the number of iterations, CPU time and the number of multi-shifts. Numerical tests and figures are performed.