  We present order reduction results for linear time invariant descriptor
systems. Results are given for both forced and unforced systems as well methods
for constructing the reduced order systems. Our results establish a precise
connection between classical and new results on this topic, and lead to an
elementary construction of quasi-Weierstrass forms for a descriptor system.
Examples are given to illustrate the usefulness of our results.
