Bisection acceleration for the symmetric tridiagonal eigenvalue problem

DOI10.1023/A:1019146505291zbMATH Open0947.65043OpenAlexW1651652452MaRDI QIDQ1964055FDOQ1964055

Authors: Elliot Linzer, Victor Y. Pan 

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

Recommendations

• scientific article; zbMATH DE number 741157
• Publication:4935904
• scientific article; zbMATH DE number 25590
• A new algorithm for the symmetric tridiagonal eigenvalue problem
• Combining the bisection method and Newton's method to compute eigenvalues of a real symmetric tridiagonal matrix.

zbMATH Keywords

convergenceeigenvaluesnumerical examplescomplexityconvergence accelerationNewton iterationsymmetric tridiagonal matrixbisection algorithm

Mathematics Subject Classification ID

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

Cited In (10)

• Mixed precision bisection
• Accelerated bisection techniques for tri‐ and quindiagonal matrices
• Title not available (Why is that?)
• The geometric mean algorithm
• Computing all or some eigenvalues of symmetric \(\mathcal{H}_{\ell}\)-matrices
• Nearly optimal refinement of real roots of a univariate polynomial
• Title not available (Why is that?)
• Combining the bisection method and Newton's method to compute eigenvalues of a real symmetric tridiagonal matrix.
• Improving the solution of the symmetric eigenvalue problem and an extension
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1964055)