Solving the Symmetric Tridiagonal Eigenvalue Problem on the Hypercube
From MaRDI portal
Recommendations
- Solving the symmetric tridiagonal eigenvalue problem on hypercubes
- Publication:4935904
- The symmetric tridiagonal eigenvalue problem on a transputer network
- A Multiprocessor Algorithm for the Symmetric Tridiagonal Eigenvalue Problem
- A parallel algorithm for determining all eigenvalues of large real symmetric tridiagonal matrices
Cited in
(16)- Parallel implementation of bisection for the calculation of eigenvalues of tridiagonal symmetric matrices
- A parallel algorithm for determining all eigenvalues of large real symmetric tridiagonal matrices
- Solving the symmetric tridiagonal eigenvalue problem on hypercubes
- The orthogonal Rayleigh quotient iteration (ORQI) method
- A fast and stable parallel QR algorithm for symmetric tridiagonal matrices
- Inverse iteration method with multiple cyclotomically shifted parameters
- An O(N^2 ) Method for Computing the Eigensystem of N \times N Symmetric Tridiagonal Matrices by the Divide and Conquer Approach
- Eigenvalue computation of large symmetric tridiagonal matrices on concurrent processors
- A Multiprocessor Algorithm for the Symmetric Tridiagonal Eigenvalue Problem
- Homotopy-Determinant Algorithm for Solving Nonsymmetric Eigenvalue Problems
- PARALLEL ALGORITHMS TO COMPUTE THE EIGENVALUES AND EIGENVECTORS OFSYMMETRIC TOEPLITZ MATRICES∗
- A Parallel Algorithm for Computing the Eigenvalues of a Symmetric Tridiagonal Matrix
- The symmetric tridiagonal eigenvalue problem: a heterogeneous parallel approach
- A scalable eigenvalue solver for symmetric tridiagonal matrices
- A case against a divide and conquer approach to the nonsymmetric eigenvalue problem
- An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures
This page was built for publication: Solving the Symmetric Tridiagonal Eigenvalue Problem on the Hypercube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3485794)