Efficient computation of transfer function dominant poles using subspace acceleration

This paper describes a new algorithm to compute the dominant poles of a high-order scalar transfer function. The algorithm, called the subspace accelerated dominant pole algorithm (SADPA), is more robust than existing methods in finding both real and complex dominant poles and faster because of subspace acceleration. SADPA is able to compute the full set of dominant poles and produce good modal equivalents automatically, without any human interaction