Computing the Jordan structure of an eigenvalue
From MaRDI portal
Recommendations
Cites work
- A structurally backward stable algorithm for solving the indefinite least squares problem with equality constraints
- An Algorithm for Generalized Matrix Eigenvalue Problems
- An Algorithm for Numerical Computation of the Jordan Normal Form of a Complex Matrix
- An algorithm for numerical determination of the structure of a general matrix
- An efficient algorithm for computing the generalized null space decomposition
- An improved algorithm for the computation of Kronecker's canonical form of a singular pencil
- Computing stable eigendecompositions of matrix pencils
- Continuity properties of the Drazin pseudoinverse
- Generalized inverses. Theory and applications.
- scientific article; zbMATH DE number 4192951 (Why is no real title available?)
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 3987117 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- Ill-Conditioned Eigensystems and the Computation of the Jordan Canonical Form
- Numerically stable deflation of hessenberg and symmetric tridiagonal matrices
- On a method of solving the complete eigenvalue problem for a degenerate matrix
- Polynomial roots: The ultimate answer?
- The autonomous linear quadratic control problem. Theory and numerical solution
- The computation of Kronecker's canonical form of a singular pencil
- The Matrix Eigenvalue Problem
- The transmission of shifts and shift blurring in the QR algorithm
- The Weyr Characteristic
- Using Gauss-Jordan elimination to compute the index, generalized nullspaces, and Drazin inverse
Cited in
(5)
This page was built for publication: Computing the Jordan structure of an eigenvalue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5358300)