The symmetric tridiagonal eigenproblem on a shared memory multiprocessor. II

DOI10.1016/j.amc.2004.01.026zbMath1068.65047OpenAlexW4242323764MaRDI QIDQ1774934

Doǧan Kaya

Publication date: 4 May 2005

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2004.01.026

zbMATH Keywords

algorithmsnumerical examplesC++Parallel computationdivide-and-conquer methodsymmetric tridiagonal eigenproblemCuppen's methodshared memory Encore Multimax multiprocessorTHREADS package

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05) Packaged methods for numerical algorithms (65Y15)

Cites Work

• A Divide and Conquer method for the symmetric tridiagonal eigenproblem
• Rank-one modification of the symmetric eigenproblem
• A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
• On the Orthogonality of Eigenvectors Computed by Divide-and-Conquer Techniques
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The symmetric tridiagonal eigenproblem on a shared memory multiprocessor. II