A new algorithm for the symmetric tridiagonal eigenvalue problem
From MaRDI portal
Publication:1311389
DOI10.1006/JCOM.1993.1025zbMATH Open0794.65036OpenAlexW2033178154MaRDI QIDQ1311389
Publication date: 31 August 1994
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcom.1993.1025
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Complexity and performance of numerical algorithms (65Y20)
Related Items (7)
A new numerical procedure for symmetric eigen value problems ⋮ Using the discriminant in a numerically stable symmetric 3 × 3 direct eigenvalue solver ⋮ Exploiting the Laguerre iteration for solving the symmetric tridiagonal eigenproblem ⋮ A Quasi-Separable Approach to Solve the Symmetric Definite Tridiagonal Generalized Eigenvalue Problem ⋮ Title not available (Why is that?) ⋮ Quasi-Laguerre Iteration in Solving Symmetric Tridiagonal Eigenvalue Problems ⋮ Title not available (Why is that?)
This page was built for publication: A new algorithm 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 Q1311389)