A new efficient parallelization strategy for the QR algorithm

DOI10.1016/0167-8191(94)90112-0MaRDI QIDQ1315915zbMATH OpenOpenAlexFDO

Authors Thomas Schreiber, Fridolin Hofmann, Peter T. Otto

Publication date 31 July 1994

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(94)90112-0

zbMATH Keywords

eigenvaluesparallel algorithmeigenvectorsparallelizationdivide and conquer strategymultiprocessing systemscyclic reductions\(QR\) algorithmteam mappingtridiagonal Hermitian matrix

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 27309
• scientific article; zbMATH DE number 833714
• scientific article; zbMATH DE number 1330403
• A fast and stable parallel QR algorithm for symmetric tridiagonal matrices
• Parallelizing the QR Algorithm for the Unsymmetric Algebraic Eigenvalue Problem: Myths and Reality

Cited in

(6)

• Gaussian quadrature for matrix valued functions on the real line
• scientific article; zbMATH DE number 1304344 (Why is no real title available?)
• A parallel implementation of the QR-algorithm
• Algorithm 953: Parallel library software for the multishift QR algorithm with aggressive early deflation
• Evaluating products of matrix pencils and collapsing matrix products
• Improved QMRCGSTAB method in distributed parallel environments

This page was built for publication: A new efficient parallelization strategy for the \(QR\) algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1315915)