Eigenvalues of Ax=lambdaBx for real symmetric matrices A and B computed by reduction to a pseudosymmetric form and the HR process

DOI10.1016/0024-3795(82)90246-4zbMath0485.65029OpenAlexW1979738559MaRDI QIDQ1164375

S. Singh

Publication date: 1982

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

Full work available at URL: https://doi.org/10.1016/0024-3795(82)90246-4

zbMATH Keywords

reductiongeneralized eigenvalue problemreal symmetric matricesiterative HR processpseudosymmetric matrix

Mathematics Subject Classification ID

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

Related Items (28)

On a deflation method for the symmetric generalized eigenvalue problem ⋮ Analysis of a recursive least squares hyperbolic rotation algorithm for signal processing ⋮ The computation of the Kronecker canonical form of an arbitrary symmetric pencil ⋮ HMDR and FMDR algorithms for the generalized eigenvalue problem ⋮ Self-similar flows ⋮ A non-selfadjoint general matrix eigenvalue problem ⋮ Two connections between the \(SR\) and \(HR\) eigenvalue algorithms ⋮ 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 ⋮ Classification of the five-dimensional Lie superalgebras over the real numbers ⋮ A Structure-Preserving Divide-and-Conquer Method for Pseudosymmetric Matrices ⋮ An analysis of the HR algorithm for computing the eigenvalues of a matrix ⋮ Simultaneous band reduction of two symmetric 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 ⋮ Efficient and accurate algorithms for solving the Bethe-Salpeter eigenvalue problem for crystalline systems ⋮ Matrix pencils: Theory, applications, and numerical methods ⋮ A symmetric structure-preserving {\(\Gamma\)}QR algorithm for linear response eigenvalue problems ⋮ Use of indefinite pencils for computing damped natural modes ⋮ On some algebraic problems in connection with general eigenvalue algorithms ⋮ Convergence of algorithms of decomposition type for the eigenvalue problem ⋮ Simultaneous tridiagonalization of two symmetric matrices ⋮ Self-equivalent flows associated with the generalized eigenvalue problem ⋮ On Hamiltonian and symplectic Lanczos processes ⋮ A parallel implementation of Davidson methods for large-scale eigenvalue problems in SLEPc ⋮ \(QR\)-like algorithms for eigenvalue problems ⋮ Cholesky-Like Factorization of Symmetric Indefinite Matrices and Orthogonalization with Respect to Bilinear Forms ⋮ On reducing infinite eigenvalues of regular pencils by a nonequivalence transformation

Cites Work

• Unnamed Item
• An analysis of the HR algorithm for computing the eigenvalues of a matrix
• Eigenvalues of Ax=lambdaBx for real symmetric matrices A and B computed by reduction to a pseudosymmetric form and the HR process
• On some algebraic problems in connection with general eigenvalue algorithms
• Reduction of the symmetric eigenproblem \(Ax =\lambda Bx\) and related problems to standard form

This page was built for publication: Eigenvalues of Ax=lambdaBx for real symmetric matrices A and B computed by reduction to a pseudosymmetric form and the HR process