Abstract
A new algorithm is developed for computation of the transfer function zeros of an SISO linear state space system, based on an improved Sandberg and So algorithm and Householder transformations which reduce the problem to that of finding the standard eigenvalues of a matrix. Techniques are introduced which take full advantage of sparsity to improve accuracy. Where possible a reducing transformation is performed which does not cause any round-off error. Methods for improving the accuracy of the zeros are included.