A shifted method for solving symmetric eigenvalue problems

DOI10.1016/0898-1221(93)90250-YzbMath0776.65029MaRDI QIDQ2365942

Zhenyue Zhang

Publication date: 29 June 1993

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

algorithmconvergencenumerical resultsefficiencylargest eigenvalueHouseholder reflectionsfull symmetric matrixparallel processing machineshifted method

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Cites Work

• An interactive method for the eigenvalue problem for matrices
• The QR and QL algorithms for symmetric matrices
• Rational QR transformation with Newton shift for symmetric tridiagonal matrices
• A Parallel QR Algorithm for Symmetric Tridiagonal Matrices
• A New Algorithm for Diagonalizing a Real Symmetric Matrix
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A shifted method for solving symmetric eigenvalue problems