Parallelizing the QR Algorithm for the Unsymmetric Algebraic Eigenvalue Problem: Myths and Reality

DOI10.1137/0917056zbMath0856.65027OpenAlexW2036585521MaRDI QIDQ4891738

Greg M. Henry, Robert A. van de Geijn

Publication date: 24 February 1997

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

Full work available at URL: https://doi.org/10.1137/0917056

zbMATH Keywords

eigenvalueparallel computingQR algorithmSchur decompositionhigh performance parallel computer

Mathematics Subject Classification ID

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

Related Items (9)

Parallel solvers for discrete‐time algebric Riccati equations ⋮ Evaluating products of matrix pencils and collapsing matrix products ⋮ The transmission of shifts and shift blurring in the QR algorithm ⋮ PARALLEL SPECTRAL DIVISION USING THE MATRIX SIGN FUNCTION FOR THE GENERALIZED EIGENPROBLEM ⋮ Algorithm 953 ⋮ Efficient algorithms for generalized algebraic Bernoulli equations based on the matrix sign function ⋮ A quadratically convergent QR-like method without shifts for the Hermitian eigenvalue problem ⋮ Solving stable Sylvester equations via rational iterative schemes ⋮ NUMERICAL SOLUTION OF DISCRETE STABLE LINEAR MATRIX EQUATIONS ON MULTICOMPUTERS

Uses Software

• Unnamed Item

This page was built for publication: Parallelizing the QR Algorithm for the Unsymmetric Algebraic Eigenvalue Problem: Myths and Reality