A Parallel Algorithm for the Nonsymmetric Eigenvalue Problem

DOI10.1137/0914035zbMath0774.65015OpenAlexW2100087963MaRDI QIDQ4693191

Majed Sidani, Jack J. Dongarra

Publication date: 11 November 1993

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://digital.library.unt.edu/ark:/67531/metadc1101433/

zbMATH Keywords

convergenceiterationnumerical resultsNewton's methodeigenvalueseigenvectorsdeflationparallel algorithmdivide-and-conquer algorithmnonsymmetric matrix

Mathematics Subject Classification ID

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

Related Items (4)

Evaluating products of matrix pencils and collapsing matrix products ⋮ 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 ⋮ Continuation methods for the computation of zeros of Szegő polynomials

Uses Software

• EISPACK

This page was built for publication: A Parallel Algorithm for the Nonsymmetric Eigenvalue Problem