Bisection acceleration for the symmetric tridiagonal eigenvalue problem

DOI10.1023/A:1019146505291zbMath0947.65043OpenAlexW1651652452MaRDI QIDQ1964055

Elliot Linzer, Pan, Victor Y.

Publication date: 22 October 2000

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1019146505291

zbMATH Keywords

complexityconvergencenumerical exampleseigenvaluesconvergence accelerationNewton iterationsymmetric tridiagonal matrixbisection algorithm

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Complexity and performance of numerical algorithms (65Y20)

Related Items (2)

Nearly optimal refinement of real roots of a univariate polynomial ⋮ Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.

This page was built for publication: Bisection acceleration for the symmetric tridiagonal eigenvalue problem