The numerical Jordan form
From MaRDI portal
Publication:2074949
DOI10.1016/j.laa.2021.12.014zbMath1482.65059OpenAlexW4200258670MaRDI QIDQ2074949
Petko Hr. Petkov, Michael M.Konstantinov
Publication date: 11 February 2022
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2021.12.014
regularizationJordan canonical formill-posed problemsWeyr canonical formSegre and Weyr characteristics
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Ill-posedness and regularization problems in numerical linear algebra (65F22) Perturbation theory of linear operators (47A55) Canonical forms, reductions, classification (15A21) Diagonalization, Jordan forms (15A20)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The computation of Kronecker's canonical form of a singular pencil
- Norms and exclusion theorems
- Bounds for iterates, inverses, spectral variation and fields of values of non-normal matrices
- On condition numbers and the distance to the nearest ill-posed problem
- Computing stable eigendecompositions of matrices
- Computing stable eigendecompositions of matrix pencils
- An improved algorithm for the computation of Kronecker's canonical form of a singular pencil
- Eigenvalues and pseudo-eigenvalues of Toeplitz matrices
- An algorithm for calculation of the Jordan canonical form of a matrix
- Weierstraß and the theory of matrices
- Bounds for the distance between nearby Jordan and Kronecker structures in a closure hierachy
- Extracting partial canonical structure for large scale eigenvalue problems
- Eigenvalue computation in the 20th century
- The dimension of matrices (matrix pencils) with given Jordan (Kronecker) canonical forms
- Finding well-conditioned similarities to block-diagonalize nonsymmetric matrices is NP-hard
- Matrix Algorithms
- The Weyr Characteristic
- Numerical Methods for Large Eigenvalue Problems
- An Algorithm for Computing Reducing Subspaces by Block Diagonalization
- Sensitivity and Computation of a Defective Eigenvalue
- An Efficient Algorithm for Computing the Generalized Null Space Decomposition
- Jordan Canonical Form: Application to Differential Equations
- Jordan Canonical Form: Theory and Practice
- Perturbation Bounds for Matrix Eigenvalues
- RGSVD—AN Algorithm for Computing the Kronecker Structure and Reducing Subspaces of Singular $A - \lambda B$ Pencils
- On the Segré, Weyr characteristics of right (left) regular matrix pencils
- LAPACK Users' Guide
- An Algorithm for Numerical Computation of the Jordan Normal Form of a Complex Matrix
- Algorithm 560: JNF, An Algorithm for Numerical Computation of the Jordan Normal Form of a Complex Matrix [F2]
- Ill-Conditioned Eigensystems and the Computation of the Jordan Canonical Form
- Numerical Linear Algebra for High-Performance Computers
- A Geometric Approach to Perturbation Theory of Matrices and Matrix Pencils. Part II: A Stratification-Enhanced Staircase Algorithm
- A Geometric Approach to Perturbation Theory of Matrices and Matrix Pencils. Part I: Versal Deformations
- On computing condition numbers for the nonsymmetric eigenproblem
- The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part I
- The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part II
- Templates for the Solution of Algebraic Eigenvalue Problems
- Computing multiple roots of inexact polynomials
- Accuracy and Stability of Numerical Algorithms
- Lectures on Finite Precision Computations
- Staircase Failures Explained by Orthogonal Versal Forms
- First-Order Perturbation Theory for Eigenvalues and Eigenvectors
- Invariant Subspaces of Matrices with Applications
- The QR algorithm: 50 years later its genesis by John Francis and Vera Kublanovskaya and subsequent developments
- Computing the Jordan Structure of an Eigenvalue
- Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
- Numerical Methods in Matrix Computations
- On a method of solving the complete eigenvalue problem for a degenerate matrix
- Perturbation bounds for means of eigenvalues and invariant subspaces
- An algorithm for numerical determination of the structure of a general matrix
- ON MATRICES DEPENDING ON PARAMETERS
