High performance solution of the complex symmetric eigenproblem
From MaRDI portal
The emphasis of the paper is on the computation of the eigenvalues and eigenvectors of full symmetric, but non-Hermitian matrices if only a part of the eiqenspectrum, e.g. \(20\%\) is needed. A sketch of the theory is presented with reference to preceding publications. Interesting numerical experiments are carried out for a comparison of the new algorithm and the LAPACK routines on a single processor of a Cray J90, a DEC Alpha 8400 server and SGI Power Challenge 8000 and 10.000.
Recommendations
Cited in
(9)- High-performance implementation of Chebyshev filter diagonalization for interior eigenvalue computations
- A uniform object-oriented solution to the eigenvalue problem for real symmetric and Hermitian matrices
- Fast direct solvers for some complex symmetric block Toeplitz linear systems
- High relative accuracy algorithms for the symmetric eigenproblem
- scientific article; zbMATH DE number 1497149 (Why is no real title available?)
- scientific article; zbMATH DE number 1384329 (Why is no real title available?)
- scientific article; zbMATH DE number 4182697 (Why is no real title available?)
- Fast eigensolver for dense real-symmetric matrices
- On tridiagonal matrices unitarily equivalent to normal matrices
This page was built for publication: High performance solution of the complex symmetric eigenproblem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1275444)