Combining the bisection method and Newton's method to compute eigenvalues of a real symmetric tridiagonal matrix.

MaRDI QIDQ5477274zbMATH OpenFDO

Authors Huu Hung Do

Publication date 3 July 2006

zbMATH Keywords

complexityeigenvalue problembisection methodNewton's methodtype-2 theory of effectivityreal symmetric tridiagonal matrixalgorith

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)

Recommendations

• Publication:4935904
• Bisection acceleration for the symmetric tridiagonal eigenvalue problem
• An $O(N^2 )$ Method for Computing the Eigensystem of $N \times N$ Symmetric Tridiagonal Matrices by the Divide and Conquer Approach
• scientific article; zbMATH DE number 741157
• A new algorithm for the symmetric tridiagonal eigenvalue problem

Cited in

(1)

• Bisection acceleration for the symmetric tridiagonal eigenvalue problem

This page was built for publication: Combining the bisection method and Newton's method to compute eigenvalues of a real symmetric tridiagonal matrix.

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