Fast Algorithm for Testing the Stability of Discrete Time Systems.

摘要

This reprint studies the computational aspects of the algorithms for testing the strict sense and wide sense stability of discrete time systems. These algorithms are based on the computation of the reflection coefficients for a given real polynomial. The algorithms presented here require one-half the number of multiplications and the same number of additions as compared to the previously known similar algorithms. Keywords: Fast algorithms; Discrete systems; Unit circle; Strict sense stability; Computational complexity; Multiplications and additions; Stepdown procedure; Reprints. (jhd)