An analysis of the HR algorithm for computing the eigenvalues of a matrix

From MaRDI portal
Publication:1152932

DOI10.1016/0024-3795(81)90271-8zbMath0462.65021OpenAlexW2064468023MaRDI QIDQ1152932

Angelika Bunse-Gerstner

Publication date: 1981

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

Full work available at URL: https://doi.org/10.1016/0024-3795(81)90271-8



Related Items

A new look at pencils of matrix valued functions, On a deflation method for the symmetric generalized eigenvalue problem, Analysis of a recursive least squares hyperbolic rotation algorithm for signal processing, Numerical solutions for large sparse quadratic eigenvalue problems, The computation of the Kronecker canonical form of an arbitrary symmetric pencil, Toda hierarchy with indefinite metric, An implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem, A block representation for products of hyperbolic Householder transforms, HMDR and FMDR algorithms for the generalized eigenvalue problem, Self-similar flows, Two connections between the \(SR\) and \(HR\) eigenvalue algorithms, Sensitivity analysis for the SR decomposition, Model reduction of state space systems via an implicitly restarted Lanczos method, An extension problem for H-unitary matrices with applications to Hermitian Toeplitz matrices, An extended Hamiltonian QR algorithm, Two-sided generalized hyperbolic QR factorization and its perturbation analysis, A Structure-Preserving Divide-and-Conquer Method for Pseudosymmetric Matrices, The pseudosymmetric tridiagonalization of an arbitrary real matrix, Eigenvalues of Ax=lambdaBx for real symmetric matrices A and B computed by reduction to a pseudosymmetric form and the HR process, Numerical algorithms for undamped gyroscopic systems, Optimal symplectic Householder transformations for \(SR\) decomposition, Orthosymmetric block reflectors, Efficient and accurate algorithms for solving the Bethe-Salpeter eigenvalue problem for crystalline systems, A structure-preserving \(QR\) factorization for centrosymmetric real matrices, A symmetric structure-preserving {\(\Gamma\)}QR algorithm for linear response eigenvalue problems, Symplectic Householder transformations for a QR-like decomposition, a geometric and algebraic approaches, Perturbation analysis for the hyperbolic QR factorization, Indefinite QR factorization, Hamilton and Jacobi come full circle: Jacobi algorithms for structured Hamiltonian eigenproblems, On theoretical and numerical aspects of symplectic Gram-Schmidt-like algorithms, Use of indefinite pencils for computing damped natural modes, Structure-preserving \(\Gamma\) QR and \(\Gamma\)-Lanczos algorithms for Bethe-Salpeter eigenvalue problems, Large-scale complex eigenvalue problems, On the sensitivity of the SR decomposition, Convergence of algorithms of decomposition type for the eigenvalue problem, Self-equivalent flows associated with the generalized eigenvalue problem, On Hamiltonian and symplectic Lanczos processes, Eigenvalue condition numbers: zero-structured versus traditional., A hybrid iterative method for symmetric indefinite linear systems, Schur-like forms for matrix Lie groups, Lie algebras and Jordan algebras, \(SR\) and \(SZ\) algorithms for the symplectic (butterfly) eigenproblem, \(QR\)-like algorithms for eigenvalue problems, For tridiagonals \(T\) replace \(T\) with \(LDL\), Cholesky-Like Factorization of Symmetric Indefinite Matrices and Orthogonalization with Respect to Bilinear Forms, On the similarity transformation to tridiagonal form, Matrix factorizations and their perturbations, On reducing infinite eigenvalues of regular pencils by a nonequivalence transformation, A real triple dqds algorithm for the nonsymmetric tridiagonal eigenvalue problem



Cites Work