Compute passivity indices and/or solves feasibility via a LMI.
Constructs a linear matrix inequality (LMI) such that if a solution exists and the last element of the solution is positive, the system sys is passive. Inputs of None for rho or nu indicate that the function should solve for that index (they are mutually exclusive, they can’t both be None, otherwise you’re trying to solve a nonconvex bilinear matrix inequality.) The last element of the output solution is either the output or input passivity index, for rho = None and nu = None, respectively.
System to be checked.
Output feedback passivity index.
Input feedforward passivity index.
The LMI solution.
References
[1]McCourt, Michael J., and Panos J. Antsaklis, “Demonstrating passivity and dissipativity using computational methods.”
[2]Nicholas Kottenstette and Panos J. Antsaklis, “Relationships Between Positive Real, Passive Dissipative, & Positive Systems”, equation 36.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4