Bisection acceleration for the symmetric tridiagonal eigenvalue problem (Q1964055)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Bisection acceleration for the symmetric tridiagonal eigenvalue problem |
scientific article; zbMATH DE number 1398777
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bisection acceleration for the symmetric tridiagonal eigenvalue problem |
scientific article; zbMATH DE number 1398777 |
Statements
Bisection acceleration for the symmetric tridiagonal eigenvalue problem (English)
0 references
22 October 2000
0 references
Eigenvalues in an interval for a symmetric tridiagonal matrix are computed. The interval is divided using a double exponential sieve, giving one very short interval and one with a good isolation ratio, which guarantees a rapid convergence of a Newton iteration. A complexity analysis is given, which shows that this improves on the traditional bisection algorithm, and this is illustrated on numerical examples.
0 references
convergence acceleration
0 references
eigenvalues
0 references
symmetric tridiagonal matrix
0 references
convergence
0 references
Newton iteration
0 references
complexity
0 references
bisection algorithm
0 references
numerical examples
0 references
