On positive—Real discrete-time transfer functions

An algebraic formulation of the positive-real (PR) condition of transfer functions is given. It provides a simple interpretation in terms of a polynomial inequality whose computational solution may be shown to be numerically stable. A class of transfer functions which do not verify the PR condition is given in terms of the roots of these polynomials. An example of interest in adaptive control theory furnishes insight into the proposed method.