The symmetric tridigonal eigenproblem on a shared memory multiprocessor. I
From MaRDI portal
Publication:1886567
DOI10.1016/j.amc.2003.07.009zbMath1057.65017MaRDI QIDQ1886567
Publication date: 18 November 2004
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2003.07.009
parallel computation; object-oriented programming language; divide-and-conquer method; symmetric tridiagonal eigenproblem; C++ programming language; Cuppen's method
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
68N19: Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.)
65Y05: Parallel numerical computation
65Y15: Packaged methods for numerical algorithms
Cites Work
- A Divide and Conquer method for the symmetric tridiagonal eigenproblem
- Rank-one modification of the symmetric eigenproblem
- An $O(N^2 )$ Method for Computing the Eigensystem of $N \times N$ Symmetric Tridiagonal Matrices by the Divide and Conquer Approach
- A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
- On the Orthogonality of Eigenvectors Computed by Divide-and-Conquer Techniques
- Some Modified Matrix Eigenvalue Problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item