Abstract
This paper is concerned with the problem of testing the robust strict positive realness (SPRness) of a family of rational functions with both numerator and denominator dependent on the same set of parameters. The authors show that this problem can be solved by using a series of Routh tables. In other words, the robust SPRness of the whole family can be tested by performing only a finite number of elementary operations (arithmetic operations, logical operations and sign tests).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
