Banded Eigenvalue Solvers on Vector Machines

DOI10.1145/356068.356074zbMath0573.65024OpenAlexW2069146503MaRDI QIDQ3690956

Linda Kaufman

Publication date: 1984

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/356068.356074

zbMATH Keywords

eigenvaluesparallel algorithmsbanded matrices

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items (4)

Tridiagonalization of band symmetric matrices for vector computers ⋮ Efficient Reduction of Banded Hermitian Positive Definite Generalized Eigenvalue Problems to Banded Standard Eigenvalue Problems ⋮ Parallel implementations for solving generalized eigenvalue problems with symmetric sparse matrices ⋮ Squeezing the most out of eigenvalue solvers on high-performance computers

This page was built for publication: Banded Eigenvalue Solvers on Vector Machines