Checking of the positivity of descriptor linear systems by the use of the shuffle algorithm

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 the descriptor systems is proposed and illustrated by numerical examples.