We study the eigenvalue perturbations of an n x n real unreduced symmetric tridiagonal matrix T when one of the off-diagonal element is replaced by zero. We provide both the lower and upper perturbation bounds for eve...
详细信息
We study the eigenvalue perturbations of an n x n real unreduced symmetric tridiagonal matrix T when one of the off-diagonal element is replaced by zero. We provide both the lower and upper perturbation bounds for every eigenvalue of T. The bounds are described by the jth off-diagonal element (the one that is replaced), and the eigenvalues and eigenvectors of the leading j x j and trailing (n - j) x (n - j) principal submatrices of T. We also provide several simpler perturbation bounds that are easy to estimate in practice. Numerical examples show that the bounds predict the perturbations well. They are sharper than whose classical results only related to the off-diagonal element, especially for extreme eigenvalues. The bounds can also be incorporated with numerical methods, such as the ql(QR) algorithm and the divide-conquer algorithm, to estimates the errors of computed eigenvalues, (c) 2004 Elsevier Inc. All rights reserved.
We study the eigenvalue perturbations of an n x n real unreduced symmetric tridiagonal matrix T when one of the off-diagonal element is replaced by zero. We provide both the lower and upper perturbation bounds for eve...
详细信息
We study the eigenvalue perturbations of an n x n real unreduced symmetric tridiagonal matrix T when one of the off-diagonal element is replaced by zero. We provide both the lower and upper perturbation bounds for every eigenvalue of T. The bounds are described by the jth off-diagonal element (the one that is replaced), and the eigenvalues and eigenvectors of the leading j x j and trailing (n - j) x (n - j) principal submatrices of T. We also provide several simpler perturbation bounds that are easy to estimate in practice. Numerical examples show that the bounds predict the perturbations well. They are sharper than whose classical results only related to the off-diagonal element, especially for extreme eigenvalues. The bounds can also be incorporated with numerical methods, such as the ql(QR) algorithm and the divide-conquer algorithm, to estimates the errors of computed eigenvalues, (c) 2004 Elsevier Inc. All rights reserved.
In this paper we put forward two kinds of shift using β2 , for symmetric tridiagonal matrix ql algorithm. Both not only preserves global convergence, but also their asymptotic convergence. A method which possesses ab...
详细信息
In this paper we put forward two kinds of shift using β2 , for symmetric tridiagonal matrix ql algorithm. Both not only preserves global convergence, but also their asymptotic convergence. A method which possesses above two properties rale is cubic or almost cubic.
暂无评论