Chasing Algorithms for the Eigenvalue Problem

DOI10.1137/0612027zbMath0726.65034OpenAlexW1976676253MaRDI QIDQ3350662

David S. Watkins, Ludwig Elsner

Publication date: 1991

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://pub.uni-bielefeld.de/record/1776217

zbMATH Keywords

eigenvaluedecompositionQR algorithmHessenberg matricesLR algorithmschasing algorithmschasing bulgeGR algorithms

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items

Parallel solvers for discrete‐time algebric Riccati equations, A fast method to diagonalize a Hankel matrix, The transmission of shifts and shift blurring in the QR algorithm, An inexact Krylov-Schur algorithm for the unitary eigenvalue problem, Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations, A QR-method for computing the singular values via semiseparable matrices, Convergence of algorithms of decomposition type for the eigenvalue problem, A multiple shift \(QR\)-step for structured rank matrices, \(SR\) and \(SZ\) algorithms for the symplectic (butterfly) eigenproblem, Eigenvalue computation in the 20th century, \(QR\)-like algorithms for eigenvalue problems, The symplectic eigenvalue problem, the butterfly form, the SR algorithm, and the Lanczos method