A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Checking of the positivity of descriptor linear systems by the use of the shuffle algorithm TADEUSZ KACZOREK Necessary and sufficient conditions for the positivity of descriptor continuous-time and discrete-time linear systems are established. The shuffle algorithm is applied to transform the state equations of the descriptor systems to their equivalent form for which necessary and sufficient conditions for their positivity have been derived. A procedure for checking the positivity of thedoi:10.2478/v10170-010-0044-1 fatcat:fio6na4xhjenhladhvdsd6u7ma