A Parallel Algorithm for Computing the Eigenvalues of a Symmetric Tridiagonal Matrix
From MaRDI portal
Publication:5288225
DOI10.2307/2153107zbMath0777.65023OpenAlexW4244166195MaRDI QIDQ5288225
Publication date: 15 August 1993
Full work available at URL: https://doi.org/10.2307/2153107
eigenvaluesnumerical experimentsparallel algorithmsymmetric tridiagonal matrixparallel bisectionpolysection
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Eigenvalues of a symmetric tridiagonal matrix: A divide-and-conquer approach
- A Divide and Conquer method for the symmetric tridiagonal eigenproblem
- A modified bisection algorithm for the determination of the eigenvalues of a symmetric tridiagonal matrix
- Matrix eigensystem routines - EISPACK guide. 2nd ed
- Rank-one modification of the symmetric eigenproblem
- On computing accurate singular values and eigenvalues of matrices with acyclic graphs
- Solving the Symmetric Tridiagonal Eigenvalue Problem on the Hypercube
- Accurate Singular Values of Bidiagonal Matrices
- A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
- A Multiprocessor Algorithm for the Symmetric Tridiagonal Eigenvalue Problem
- Parallel Prefix Computation
- On the Orthogonality of Eigenvectors Computed by Divide-and-Conquer Techniques
- Parallel Tridiagonal Equation Solvers
- A Parallel QR Algorithm for Symmetric Tridiagonal Matrices
- A Parallel Algorithm for Solving General Tridiagonal Equations
- Calculation of the eigenvalues of a symmetric tridiagonal matrix by the method of bisection
- Calculation of the eigenvalues of a symmetric tridiagonal matrix by the method of bisection
This page was built for publication: A Parallel Algorithm for Computing the Eigenvalues of a Symmetric Tridiagonal Matrix
