Descriptor systems: Decomposition into forward and backward subsystems

It is shown that a decomposition of the descriptor space with certain properties induces a decomposition of the descriptor system into forward and backward subsystems. Different decompositions correspond to different apportionments of the required boundary conditions between initial and final times. Applications include several different but equivalent methods for solving the descriptor system and a clarification of the relations between some previously known methods of solution.