AbstractA new shift in the QL algorithm for symmetric tridiagonal matrices is described. The shift is a combination of the Rayleigh quotient shift and Wilkinson's shift. It is shown that QL is globally convergent with this shift and that the asymptotic rate is always cubic
AbstractWe present a new, fast, and practical parallel algorithm for computing a few eigenvalues of ...
A common algorithm for the computation of eigenvalues of real symmetric tridiagonal matrices is the ...
Convergence $th\infty rems $ are established with mathematical rigour for two algo-rithms for the co...
AbstractA new shift in the QL algorithm for symmetric tridiagonal matrices is described. The shift i...
AbstractBy use of the three-term recurrence relation, an elementary and constructive proof is given ...
Abstract. The convergence results obtained by J. H. Wilkinson [Linear Algebra Appl. 1 (1968) 409420]...
AbstractIn 1989, Bai and Demmel proposed the multishift QR algorithm for eigenvalue problems. Althou...
Numerous routines are available to find the eigenvalues of a real symmetric tridiagonal matrix. Sinc...
We present new algorithms for refining the estimates of the eigenvectors of a real symmetric matrix....
AbstractIn 1989, Bai and Demmel proposed the multishift QR algorithm for eigenvalue problems. Althou...
In this paper we present a new algorithm for solving the symmetric tridiagonal eigenvalue problem th...
在計算矩陣的特徵值(eigenvalues)中,QR演算法是一種常見的技巧. 尤其如果使用適當的移位,將可以較快得到特徵值. 在本文中提出一種新的移位策略, 我們證明這各方法是可行的,而且可適用於任何...
One of the most widely used methods for eigenvalue computation is the QR iteration with Wilkinson’s ...
AbstractBy use of the three-term recurrence relation, an elementary and constructive proof is given ...
AbstractW. Hoffmann and B.N. Parlett have mentioned that in the usual case the convergence rate of t...
AbstractWe present a new, fast, and practical parallel algorithm for computing a few eigenvalues of ...
A common algorithm for the computation of eigenvalues of real symmetric tridiagonal matrices is the ...
Convergence $th\infty rems $ are established with mathematical rigour for two algo-rithms for the co...
AbstractA new shift in the QL algorithm for symmetric tridiagonal matrices is described. The shift i...
AbstractBy use of the three-term recurrence relation, an elementary and constructive proof is given ...
Abstract. The convergence results obtained by J. H. Wilkinson [Linear Algebra Appl. 1 (1968) 409420]...
AbstractIn 1989, Bai and Demmel proposed the multishift QR algorithm for eigenvalue problems. Althou...
Numerous routines are available to find the eigenvalues of a real symmetric tridiagonal matrix. Sinc...
We present new algorithms for refining the estimates of the eigenvectors of a real symmetric matrix....
AbstractIn 1989, Bai and Demmel proposed the multishift QR algorithm for eigenvalue problems. Althou...
In this paper we present a new algorithm for solving the symmetric tridiagonal eigenvalue problem th...
在計算矩陣的特徵值(eigenvalues)中,QR演算法是一種常見的技巧. 尤其如果使用適當的移位,將可以較快得到特徵值. 在本文中提出一種新的移位策略, 我們證明這各方法是可行的,而且可適用於任何...
One of the most widely used methods for eigenvalue computation is the QR iteration with Wilkinson’s ...
AbstractBy use of the three-term recurrence relation, an elementary and constructive proof is given ...
AbstractW. Hoffmann and B.N. Parlett have mentioned that in the usual case the convergence rate of t...
AbstractWe present a new, fast, and practical parallel algorithm for computing a few eigenvalues of ...
A common algorithm for the computation of eigenvalues of real symmetric tridiagonal matrices is the ...
Convergence $th\infty rems $ are established with mathematical rigour for two algo-rithms for the co...
DOI
Add to ORKG