Normal forms in matrix spaces

For the group GL(m, C) × GL(n, C) acting on the space of m × n matrices over C, we introduce a class of subgroups which we call admissible. We suggest an algorithm to reduce an arbitrary matrix to a normal form with respect to an action of any admissible group. This algorithm covers various classification problems, including the "wild problem" of bringing a pair of matrices to normal form by simultaneous similarity. The classical left, right, two-sided and similarity transformations turns out to be admissible. However, the stabilizers of known normal forms (Smith's, Jordan's), generally speaking, are not admissible, and this obstructs inductive steps of our algorithm. This is the reason that we introduce modified normal forms for classical actions.