Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

An algorithm to determine the controllability and observability of linear, time-invariant systems using zero-state algebraic equations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Goknar, /I/. ; Technical University of Istanbul, Istanbul, Turkey ; Dervisoglu, /A/.

The controllability (observability) of a linear, time-invariant system is examined by reducing the system equations into their canonical form or by using the controllability (observability) matrix. To reduce into the canonical form requires row as well as column operations and consequently the original variables are not preserved. The controllability. (observability) matrix gives little information about the system as compared to its size and its construction. In this paper the controllability (observability) of a system is examined by the use of algebraic equations contained in the zero-state Laplace transform of state equations and an algorithm which only requires elementary row operations on real matrices is given to derive these algebraic equations. Besides providing an explicit explanation of controllability (observability) and displaying the structural properties of a system, these algebraic equations give a transformation which requires no matrix inversion and which leaves the controllable (observable) states invariant when reducing the system into its canonical form. The algorithm is still valid when the coefficient matrix of X(t) is not the identity matrix in the state equations. Therefore, in order to apply the algorithm matrix inversion is not needed when a change of variables takes place.

Published in:

Automatic Control, IEEE Transactions on  (Volume:22 ,  Issue: 3 )