English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

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.

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