Computer Programming

Abstract

State variable techniques are reviewed and applied to analog computer programming. The concise rep resentation for ordinary differential equations made possible by this technique is used to formulate a gen eral program for all such equations. It is shown that an analog computer program based on state variables will not have redundant integrators. The fact that the use of state variables facilitates the choice of variables internal to an analog com puter program is illustrated by two techniques, namely, (1) a technique for avoiding derivatives of the forcing function in programming a large class of ordinary differential equations, and (2) a technique for simulating certain systems in such a way that the effect of each characteristic root is placed in evi dence.