Finding eigenvalues and eigenvectors of unsymmetric matrices using a distributed-memory multiprocessor

DOI10.1016/0167-8191(90)90147-2zbMath0696.65037OpenAlexW2144988975MaRDI QIDQ911226

N. E. Zubov

Publication date: 1990

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(90)90147-2

zbMATH Keywords

eigenvaluesparallel computationeigenvectorsQR algorithmtiming resultsdistributed-memory multiprocessorINTEL iPSC/2 hypercubeunsymmetric matrix

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05)

Related Items (5)

PARALLEL SPECTRAL DIVISION USING THE MATRIX SIGN FUNCTION FOR THE GENERALIZED EIGENPROBLEM ⋮ A case against a divide and conquer approach to the nonsymmetric eigenvalue problem ⋮ Parallel algorithms for reduction of a general matrix to upper Hessenberg form on a shared memory multiprocessor ⋮ An approach for computing the exact stability domain for a class of LTI parameter dependent systems ⋮ Parallel algorithms for reduction of a symmetric matrix to tridiagonal form on a shared memory multiprocessor

Uses Software

• EISPACK

This page was built for publication: Finding eigenvalues and eigenvectors of unsymmetric matrices using a distributed-memory multiprocessor