Computation of canonical matrices for chains and cycles of linear mappings.
From MaRDI portal
(Redirected from Publication:1415299)
Abstract: Paul Van Dooren [Linear Algebra Appl. 27 (1979) 103-140] constructed an algorithm for the computation of all irregular summands in Kronecker's canonical form of a matrix pencil. The algorithm is numerically stable since it uses only unitary transformations. We extend Paul Van Dooren's algorithm to the matrices of a cycle of linear mappings.
The author constructs a unitary algorithm of the canonical form of the matrices of a chain of linear mappings and extends \textit{P. Van Dooren}'s algorithm [ibid. 27, 103--140 (1979; Zbl 0416.65026)] to the matrices of a cycle of linear mappings.
Recommendations
Cites work
- Algebra VIII: Representations of finite-dimensional algebras. Transl. from the Russian
- Applications of the duality method to generalizations of the Jordan canonical form
- Canonical matrices for linear matrix problems
- Complexity of matrix problems
- Contragredient equivalence: A canonical form and some applications
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 3475514 (Why is no real title available?)
- scientific article; zbMATH DE number 762243 (Why is no real title available?)
- scientific article; zbMATH DE number 3278303 (Why is no real title available?)
- scientific article; zbMATH DE number 3310128 (Why is no real title available?)
- Normal forms in matrix spaces
- REPRESENTATIONS OF QUIVERS OF INFINITE TYPE
- The computation of Kronecker's canonical form of a singular pencil
- The contragredient equivalence for several matrices: A set of invariants
- Unzerlegbare Darstellungen. I. (Indecomposable representations. I)
Cited in
(18)- Reduction of a pair of skew-symmetric matrices to its canonical form under congruence
- Cycles of linear and semilinear mappings
- Solvability and uniqueness criteria for generalized Sylvester-type equations
- Corrigendum to: ``Solvability and uniqueness criteria for generalized Sylvester-type equations
- Symmetric completions of cycles and bipartite graphs
- Classification of linear mappings between indefinite inner product spaces
- Regularizing decompositions for matrix pencils and a topological classification of pairs of linear mappings
- Computing periodic deflating subspaces associated with a specified set of eigenvalues
- A regularization algorithm for matrices of bilinear and sesquilinear forms
- Topological classification of the oriented cycles of linear mappings
- Cyclicity in multicompanion canonical matrices
- Topological classification of chains of linear mappings
- Regularizing algorithm for mixed matrix pencils
- The cyclic rank completion problem with general blocks
- Locally finite cycles of linear mappings in countable dimension
- The Rayleigh-Ritz method, refinement and Arnoldi process for periodic matrix pairs
- Matrices that are self-congruent only via matrices of determinant one
- Classification of sesquilinear forms with the first argument on a subspace or a factor space
This page was built for publication: Computation of canonical matrices for chains and cycles of linear mappings.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1415299)
