On the symbolic analysis of linear networks

A method for symbolic analysis of linear time-invariant networks is described. The method is an extension of the work by Pottle [1] which is based on the Souriau-Frame algorithm for inverting the matrix
sI-A
. Our main concerns are the sources of numerical errors in the method and ways of overcoming them.