This paper establishes an improvement on the QL algorithm for a symmetric tridiagonal matrix T so that we can work out the eigenvalues of T faster. Meanwhile, the new algorithm don’t worsen the stability and precisio...This paper establishes an improvement on the QL algorithm for a symmetric tridiagonal matrix T so that we can work out the eigenvalues of T faster. Meanwhile, the new algorithm don’t worsen the stability and precision of the former algorithm.展开更多
In this paper,we demonstrate that the double-shift QL algorithm for an irreducible anti-symmetric iridiagonal matrix with the shifts being two eigenvalues of the 2×2 matrix in the left upper corner of this matrix...In this paper,we demonstrate that the double-shift QL algorithm for an irreducible anti-symmetric iridiagonal matrix with the shifts being two eigenvalues of the 2×2 matrix in the left upper corner of this matrix is convergent and the convergence rale of Ms kind of algorithm is generally cubic.展开更多
文摘This paper establishes an improvement on the QL algorithm for a symmetric tridiagonal matrix T so that we can work out the eigenvalues of T faster. Meanwhile, the new algorithm don’t worsen the stability and precision of the former algorithm.
基金The author is supported by the State Major Key Project for Basic Researches of China the National Science Ponndation of China
文摘In this paper,we demonstrate that the double-shift QL algorithm for an irreducible anti-symmetric iridiagonal matrix with the shifts being two eigenvalues of the 2×2 matrix in the left upper corner of this matrix is convergent and the convergence rale of Ms kind of algorithm is generally cubic.