Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/81180
DC Field | Value | |
---|---|---|
dc.title | Simultaneous finite- and infinite-zero assignments of linear systems | |
dc.contributor.author | Chen, B.M. | |
dc.contributor.author | Da-Zhong, Z. | |
dc.date.accessioned | 2014-10-07T03:05:31Z | |
dc.date.available | 2014-10-07T03:05:31Z | |
dc.date.issued | 1995-04 | |
dc.identifier.citation | Chen, B.M.,Da-Zhong, Z. (1995-04). Simultaneous finite- and infinite-zero assignments of linear systems. Automatica 31 (4) : 643-648. ScholarBank@NUS Repository. | |
dc.identifier.issn | 00051098 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/81180 | |
dc.description.abstract | A simultaneous finite- and infinite-zero assignment problem via sensor selection for linear multivariable systems is proposed. By sensor selection we mean an appropriate choice of the output matrix C. Here, by utilizing the well-known Burnovsky canonical form for a linear system characterized by the matrix pair (A, B), we obtain an explicit construction algorithm that generates a non-empty set C of output matrices such that for any member C of this set, the corresponding system characterized by the triple (A, B, C) has the prescribed finite- and infinite-zero structures. Two examples are also given to illustrate our results. © 1995. | |
dc.source | Scopus | |
dc.subject | infinite zeros | |
dc.subject | Invariant zeros | |
dc.subject | linear system theory | |
dc.subject | zero placement | |
dc.type | Article | |
dc.contributor.department | ELECTRICAL ENGINEERING | |
dc.description.sourcetitle | Automatica | |
dc.description.volume | 31 | |
dc.description.issue | 4 | |
dc.description.page | 643-648 | |
dc.description.coden | ATCAA | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.