An algorithm to check the nonnegativity of singular systems (Q2381328)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5191347
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm to check the nonnegativity of singular systems |
scientific article; zbMATH DE number 5191347 |
Statements
An algorithm to check the nonnegativity of singular systems (English)
0 references
17 September 2007
0 references
Consider the linear discrete time control system \(Ex(k+1) = Ax(k) + Bu(k), \, y(k) = Cx(k)\) with singular matrix \(E\). The paper characterizes those systems for which non-negative controls \(u(k)\) and initial conditions \(x(0)\) always lead to non-negative states \(x(k)\) and outputs \(y(k)\). An algorithmic procedure is given to check this property.
0 references
nonnegative singular systems
0 references
singular system
0 references
non-negative
0 references
Drazin inverse
0 references
group inverse
0 references
discrete control system
0 references
block matrices
0 references
algorithm
0 references
numerical examples
0 references
0.7853536605834961
0 references
0.7704043388366699
0 references
0.730726957321167
0 references
0.708136796951294
0 references
