Convergence of algorithms of decomposition type for the eigenvalue problem

DOI10.1016/0024-3795(91)90004-GzbMATH Open0712.65025MaRDI QIDQ749154FDOQ749154

Authors: David S. Watkins, Ludwig Elsner 

Publication date: 1991

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Recommendations

• Convergence of algorithms for finding eigenvectors
• Convergence of Methods for Nonlinear Eigenvalue Problems
• scientific article
• scientific article; zbMATH DE number 1078184
• scientific article; zbMATH DE number 3936392
• Convergence results on greedy algorithms for high-dimensional eigenvalue problems
• Convergence of approximate eigenvectors in Jacobi methods
• On the rate of convergence of projection methods in the eigenvalue problem
• scientific article; zbMATH DE number 713697
• Decomplexification of eigenvalue and coneigenvalue problems

zbMATH Keywords

eigenvaluecondition numbersshifting strategyGR algorithmnested subspace iterationquadratic asymptotic convergence ratetheory of convergence

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Numerical Methods for Computing Angles Between Linear Subspaces
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A symplectic QR like algorithm for the solution of the real algebraic Riccati equation
• Numerical linear algorithms and group theory
• A new look at the Lanczos algorithm for solving symmetric systems of linear equations
• Title not available (Why is that?)
• Rayleigh quotient iteration fails for nonsymmetric matrices
• ON A BLOCK IMPLEMENTATION OF HESSENBERG MULTISHIFT QR ITERATION
• Title not available (Why is that?)
• An analysis of the HR algorithm for computing the eigenvalues of a matrix
• Global Convergence of the Basic QR Algorithm On Hessenberg Matrices
• Eigenvalues of Ax=lambdaBx for real symmetric matrices A and B computed by reduction to a pseudosymmetric form and the HR process
• Title not available (Why is that?)
• Understanding the $QR$ Algorithm
• A Geometric Theory for the $QR$, $LU$ and Power Iterations
• Das Verfahren der Treppeniteration und verwandte Verfahren zur Lösung algebraischer Eigenwertprobleme
• Chasing Algorithms for the Eigenvalue Problem
• On some algebraic problems in connection with general eigenvalue algorithms
• The condition numbers of the matrix eigenvalue problem
• On Modern Matrix Iteration Processes of Bernoulli and Graeffe Type
• Title not available (Why is that?)
• The ELR Method for Computing the Eigenvalues of a General Matrix

Cited In (37)

• Lie algebra representations, nilpotent matrices, and the \(C\)-numerical range
• A-posteriori residual bounds for Arnoldi's methods for nonsymmetric eigenvalue problems
• A multishift QR iteration without computation of the shifts
• On matrix differential equations and abstract FG algorithm
• A real triple dqds algorithm for the nonsymmetric tridiagonal eigenvalue problem
• Two connections between the \(SR\) and \(HR\) eigenvalue algorithms
• Rational \(QR\)-iteration without inversion
• Nearly optimal scaling in the SR decomposition
• A QR-method for computing the singular values via semiseparable matrices
• \(QR\)-like algorithms for eigenvalue problems
• Super-linear convergence in the p -adic QR-algorithm
• On the convergence properties of the orthogonal similarity transformations to tridiagonal and semiseparable (plus diagonal) form
• A Wilkinson-like multishift QR algorithm for symmetric eigenvalue problems and its global convergence
• Implicit QR algorithms for palindromic and even eigenvalue problems
• Some remarks on the complex \(J\)-symmetric eigenproblem
• Title not available (Why is that?)
• A note on the double-shift \(QL\) algorithm
• Polynomial root computation by means of the LR algorithm
• Convergence of the shifted \(QR\) algorithm on \(3\times{} 3\) normal matrices
• The parameterized \(SR\) algorithm for symplectic (butterfly) matrices
• An algorithm for the single-input partial pole assignment problem
• Rational functions, Toda flows, and LR-like algorithms
• The symplectic eigenvalue problem, the butterfly form, the SR algorithm, and the Lanczos method
• Convergence of algorithms for finding eigenvectors
• Computing a Hurwitz factorization of a polynomial
• A block Chebyshev-Davidson method with inner-outer restart for large eigenvalue problems
• The transmission of shifts and shift blurring in the QR algorithm
• Skew-Symmetric Differential qd Algorithm
• Title not available (Why is that?)
• Convergence theory of exact interpolation scheme for computing several eigenvectors
• Matrix Bruhat decompositions with a remark on the QR(GR) algorithm
• Diagonalization of complex symmetric matrices: generalized Householder reflections, iterative deflation and implicit shifts
• Convergence of the shifted $QR$ algorithm for unitary Hessenberg matrices
• \(SR\) and \(SZ\) algorithms for the symplectic (butterfly) eigenproblem
• The LR Cholesky algorithm for symmetric hierarchical matrices
• On the convergence of the \(QR\) algorithm with multishifts
• Title not available (Why is that?)

Uses Software

• LINPACK

This page was built for publication: Convergence of algorithms of decomposition type for the eigenvalue problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q749154)