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

From MaRDI portal
Revision as of 04:20, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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 (48)

A new look at pencils of matrix valued functionsOn a deflation method for the symmetric generalized eigenvalue problemAnalysis of a recursive least squares hyperbolic rotation algorithm for signal processingNumerical solutions for large sparse quadratic eigenvalue problemsThe computation of the Kronecker canonical form of an arbitrary symmetric pencilToda hierarchy with indefinite metricAn implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problemA block representation for products of hyperbolic Householder transformsHMDR and FMDR algorithms for the generalized eigenvalue problemSelf-similar flowsTwo connections between the \(SR\) and \(HR\) eigenvalue algorithmsSensitivity analysis for the SR decompositionModel reduction of state space systems via an implicitly restarted Lanczos methodAn extension problem for H-unitary matrices with applications to Hermitian Toeplitz matricesAn extended Hamiltonian QR algorithmTwo-sided generalized hyperbolic QR factorization and its perturbation analysisA Structure-Preserving Divide-and-Conquer Method for Pseudosymmetric MatricesThe pseudosymmetric tridiagonalization of an arbitrary real matrixEigenvalues of Ax=lambdaBx for real symmetric matrices A and B computed by reduction to a pseudosymmetric form and the HR processNumerical algorithms for undamped gyroscopic systemsOptimal symplectic Householder transformations for \(SR\) decompositionOrthosymmetric block reflectorsEfficient and accurate algorithms for solving the Bethe-Salpeter eigenvalue problem for crystalline systemsA structure-preserving \(QR\) factorization for centrosymmetric real matricesA symmetric structure-preserving {\(\Gamma\)}QR algorithm for linear response eigenvalue problemsSymplectic Householder transformations for a QR-like decomposition, a geometric and algebraic approachesPerturbation analysis for the hyperbolic QR factorizationIndefinite QR factorizationHamilton and Jacobi come full circle: Jacobi algorithms for structured Hamiltonian eigenproblemsOn theoretical and numerical aspects of symplectic Gram-Schmidt-like algorithmsUse of indefinite pencils for computing damped natural modesStructure-preserving \(\Gamma\) QR and \(\Gamma\)-Lanczos algorithms for Bethe-Salpeter eigenvalue problemsLarge-scale complex eigenvalue problemsOn the sensitivity of the SR decompositionConvergence of algorithms of decomposition type for the eigenvalue problemSelf-equivalent flows associated with the generalized eigenvalue problemOn Hamiltonian and symplectic Lanczos processesEigenvalue condition numbers: zero-structured versus traditional.A hybrid iterative method for symmetric indefinite linear systemsSchur-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 problemsFor tridiagonals \(T\) replace \(T\) with \(LDL\)Cholesky-Like Factorization of Symmetric Indefinite Matrices and Orthogonalization with Respect to Bilinear FormsOn the similarity transformation to tridiagonal formMatrix factorizations and their perturbationsOn reducing infinite eigenvalues of regular pencils by a nonequivalence transformationA real triple dqds algorithm for the nonsymmetric tridiagonal eigenvalue problem



Cites Work


This page was built for publication: An analysis of the HR algorithm for computing the eigenvalues of a matrix