An algorithm for the eigenvalue perturbation problem: reduction of a κ-matrix to a Lidskii matrix
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
On matrix perturbations with minimal leading Jordan structure
Journal of Computational and Applied Mathematics - Special issue: Proceedings of the international conference on linear algebra and arithmetic, Rabat, Morocco, 28-31 May 2001
Schur positivity of skew Schur function differences and applications to ribbons and Schubert classes
Journal of Algebraic Combinatorics: An International Journal
Fiedler Companion Linearizations and the Recovery of Minimal Indices
SIAM Journal on Matrix Analysis and Applications
On the class of reduced order models obtainable by projection
Automatica (Journal of IFAC)
Combinatorial analysis of generic matrix pencils
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
| Hi-index | 0.01 |
Computing the Jordan form of a matrix or the Kronecker structure of a pencil is a well-known ill-posed problem. We propose that knowledge of the closure relations, i.e., the stratification, of the orbits and bundles of the various forms may be applied in the staircase algorithm. Here we discuss and complete the mathematical theory of these relationships and show how they may be applied to the staircase algorithm. This paper is a continuation of our Part I paper on versal deformations, but it may also be read independently.