State space computations using MapleV

The development of algorithms needed for the analytic solution of state space design equations using a computer algebra system (MapleV) is presented in this article. These calculations involve matrix manipulations, eigenvalue-eigenvector determinations, Laplace and inverse Laplace transformations, Z and inverse Z transformations, which are complex, tedious, and error prone, even for simple examples. The process of programming with MapleV encourages appreciation of the important aspects of mathematical investigation, because there is one-to-one correspondence between the symbolic code and the mathematical algorithms being programmed. The use of MapleV has provided symbolic and numerical results, quickly and efficiently, with a tremendous gain in time and with minimal effort.