An Algorithm for Numerical Computation of the Jordan Normal Form of a Complex Matrix
From MaRDI portal
Publication:3873395
Cited in
(42)- A new block method for computing the Hamiltonian Schur form
- On reducing infinite eigenvalues of regular pencils by a nonequivalence transformation
- Computing stable eigendecompositions of matrices
- On estimating the condition of eigenvalues and eigenvectors
- Computational methods of linear algebra
- Closed-form solutions for boundary value coupled differential and difference systems
- Explicit closed-form solution of coupled systems of Volterra integrodifferential systems
- Rational transformation from Schur to Jordan form
- Stable perturbations of nonsymmetric matrices
- Schur-like forms for matrix Lie groups, Lie algebras and Jordan algebras
- When is a periodic discrete-time system equivalent to a time-invariant one?
- Methods and algorithms of solving spectral problems for polynomial and rational matrices
- Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian
- SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices
- A fast algorithm for index of annihilation computations
- Perturbation bound of the Drazin inverse
- Structured eigenvalue methods for the computation of corner singularities in 3D anisotropic elastic structures
- The dimension of matrices (matrix pencils) with given Jordan (Kronecker) canonical forms
- On the minimum number of general or dedicated controllers required for system controllability
- The numerical Jordan form
- Explicit solutions of the singular Yang-Baxter-like matrix equation and their numerical computation
- Möbius transformations of matrix polynomials
- Verified computation of the matrix exponential
- Jordan-Schur algorithms for computing the matrix exponential
- Simultaneous diagonalization of matrices and its applications in quadratically constrained quadratic programming
- Computing matrix symmetrizers. II: New methods using eigendata and linear means; a comparison.
- Numerical algorithms with condition and accuracy estimates for linear systems design
- Sensitivity and computation of a defective eigenvalue
- A note on a method to compute the asymptotic Distribution of the sample second order moments of dynamic linear normal variables
- Computational algorithms for linear control systems: a brief survey
- On convergent linear multistep matrix methods
- THE METHOD OF SPLITTING OPERATORS AND LYAPUNOV MAJORANTS IN PERTURBATION LINEAR ALGEBRA AND CONTROL
- Componentwise perturbation analysis of the Schur decomposition of a matrix
- Computing the Jordan structure of an eigenvalue
- The RKFIT algorithm for nonlinear rational approximation
- The representation and approximation for Drazin inverse
- Determining the structure of the Jordan normal form of a matrix by symbolic computation
- The generalized singular value decomposition and the general (A- B)-problem
- Pencils of complex and real symmetric and skew matrices
- A closed form solution for nonsymmetric Riccati differential equations with invertible quadratic coefficient
- An eigenvalue problem for derogatory matrices
- Calculation and utilization of component matrices in linear bioscience models
This page was built for publication: An Algorithm for Numerical Computation of the Jordan Normal Form of a Complex Matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3873395)
