A parallel implementation of the QR-algorithm

DOI10.1016/0167-8191(87)90017-2zbMath0626.65032OpenAlexW2038945476MaRDI QIDQ580899

G. W. Stewart

Publication date: 1987

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

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

zbMATH Keywords

communication through locally shared memoryHouseholder reduction to Hessenberg matriximplementation featureslinear array of processorsparallel QR-algorithm

Mathematics Subject Classification ID

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

Related Items

A parallel QR algorithm for the nonsymmetric eigenvalue problem ⋮ A PARALLEL TRIANGULAR SYLVESTER EQUATION SOLVER BASED ON THE HESSENBERG-SCHUR METHOD∗ ⋮ AN EFFICIENT PARALLEL SYLVESTER EQUATION SOLVER BASED ON THE HESSENBERG-SCHUR METHOD∗ ⋮ Computation of minimum eigenvalue through minimization of rayleigh's quotient for large sparse matrices using vector computer: ⋮ PARALLEL SPECTRAL DIVISION USING THE MATRIX SIGN FUNCTION FOR THE GENERALIZED EIGENPROBLEM ⋮ Parallel solution of linear system of equations using a column oriented approach ⋮ Parallel subspace method for non-Hermitian eigenproblems on the Connection Machine (CM2) ⋮ \(QR\)-like algorithms for eigenvalue problems ⋮ NUMERICAL SOLUTION OF DISCRETE STABLE LINEAR MATRIX EQUATIONS ON MULTICOMPUTERS