Eigenvalues of a symmetric tridiagonal matrix: A divide-and-conquer approach

DOI10.1007/BF01389480zbMath0595.65035OpenAlexW1963692564MaRDI QIDQ1077870

A. S. Krishnakumar, Martin Morf

Publication date: 1986

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/133074

zbMATH Keywords

bisection methoddivide-and-conquertree algorithmsrecursive doublingsymmetric tridiagonal eigenvalue problems

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items

Restricted rank modification of the symmetric eigenvalue problem: Theoretical considerations, MONITORING THE CONVERGENCE OF THE LANCZOS ALGORITHM IN PARALLEL COMPUTING ENVIRONMENTS, Efficient computation of tridiagonal matrices largest eigenvalue, A Parallel Algorithm for Computing the Eigenvalues of a Symmetric Tridiagonal Matrix, A divide and conquer method for polynomial zeros, An analytical approach to solutions of master equations for stochastic nonlinear reactions, A divide and conquer method for unitary and orthogonal eigenproblems, Practical improvement of the divide-and-conquer eigenvalue algorithms, Location of the eigenvalues of weighted graphs with a cut edge, Efficient parallel factorization and solution of structured and unstructured linear systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Error analysis of floating-point computation
• A Divide and Conquer method for the symmetric tridiagonal eigenproblem
• Some Modified Matrix Eigenvalue Problems
• Calculation of the eigenvalues of a symmetric tridiagonal matrix by the method of bisection