On reducing infinite eigenvalues of regular pencils by a nonequivalence transformation
From MaRDI portal
Publication:1073545
DOI10.1016/0024-3795(86)90025-XzbMath0588.65028MaRDI QIDQ1073545
Publication date: 1986
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Related Items (4)
Nonequivalence deflation for the solution of matrix latent value problems ⋮ Computing several eigenvalues of nonlinear eigenvalue problems by selection ⋮ A novel symmetric skew-Hamiltonian isotropic Lanczos algorithm for spectral conformal parameterizations ⋮ Pencils of complex and real symmetric and skew matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The computation of Kronecker's canonical form of a singular pencil
- AB-algorithm and its modifications for the spectral problems of linear pencils of matrices
- Kronecker's canonical form and the QZ algorithm
- 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
- Simultaneous iteration for computing invariant subspaces of non-Hermitian matrices
- Solution of the Cauchy problem. Methods and algorithms
- An Algorithm for Numerical Computation of the Jordan Normal Form of a Complex Matrix
- Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
- On the Sensitivity of the Eigenvalue Problem $Ax = \lambda Bx$
- A Geometric Theory for the $QR$, $LU$ and Power Iterations
This page was built for publication: On reducing infinite eigenvalues of regular pencils by a nonequivalence transformation
