
doi: 10.1137/0910015
The bisection method for computing eigenvalues of symmetric tridiagonal matrices and its natural extension - the multisection method - are compared. A simple analysis and some numerical examples show that the bisection method is in general not optimal in the class of multisection methods for the extraction of one eigenvalue on vector processors. These statements are demonstrated on some numerical examples.
Numerical computation of eigenvalues and eigenvectors of matrices, bisection method, numerical examples, multisection method, eigenvalues, symmetric tridiagonal matrices
Numerical computation of eigenvalues and eigenvectors of matrices, bisection method, numerical examples, multisection method, eigenvalues, symmetric tridiagonal matrices
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 13 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
