A classification of the solutions of non-regular, discrete-time descriptor systems

A classification of the solutions of linear, time invariant non-regular, discrete descriptor systems is given in terms of the structural invariant of the associated matrix pencil σE-A. The lack of conditionability (in the general case) implies a partitioning of the behavior and thus a classification of the solution according to their boundary values. A generalization of the boundary mapping equation is also given