A new efficient parallelization strategy for the \(QR\) algorithm
From MaRDI portal
Publication:1315915
DOI10.1016/0167-8191(94)90112-0zbMath0792.65024OpenAlexW2015918525MaRDI QIDQ1315915
Fridolin Hofmann, Thomas Schreiber, Peter Tak-Hun 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
eigenvalueseigenvectorsparallel algorithmparallelizationdivide and conquer strategymultiprocessing systemscyclic reductions\(QR\) algorithmteam mappingtridiagonal Hermitian matrix
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05)
Related Items
Evaluating products of matrix pencils and collapsing matrix products, Gaussian quadrature for matrix valued functions on the real line, Algorithm 953