An Algorithm for Numerical Computation of the Jordan Normal Form of a Complex Matrix

DOI10.1145/355900.355912MaRDI QIDQ3873395zbMATH OpenOpenAlexWikidataFDO

Authors Bo Kågström, Axel Ruhe

Publication date 1980

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/355900.355912

zbMATH Keywords

algorithmJordan normal formprincipal vectorsblock diagonal formcomplex square matrix

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Canonical forms, reductions, classification (15A21) Algorithms in computer science (68W99)

Cited in

(42)

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

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)