Computation of the canonical form for the matrices of chains and cycles of linear mappings
arXiv:0709.2470 · doi:10.1016/j.laa.2003.07.001
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.
34 pages
References in corpus (2)
Cited by in corpus (6)
- A regularization algorithm for matrices of bilinear and sesquilinear forms
- Matrices that are self-congruent only via matrices of determinant one
- Classification of linear mappings between indefinite inner product spaces
- Classification of sesquilinear forms with the first argument on a subspace or a factor space
- Reduction of a pair of skew-symmetric matrices to its canonical form under congruence
- Miniversal deformations of chains of linear mappings