Please use this identifier to cite or link to this item:
https://doi.org/10.1016/j.automatica.2007.03.012
DC Field | Value | |
---|---|---|
dc.title | The extended J-spectral factorization for descriptor systems | |
dc.contributor.author | Chu, D. | |
dc.contributor.author | Tan, R.C.E. | |
dc.date.accessioned | 2014-10-28T02:47:36Z | |
dc.date.available | 2014-10-28T02:47:36Z | |
dc.date.issued | 2008-03 | |
dc.identifier.citation | Chu, D., Tan, R.C.E. (2008-03). The extended J-spectral factorization for descriptor systems. Automatica 44 (3) : 585-597. ScholarBank@NUS Repository. https://doi.org/10.1016/j.automatica.2007.03.012 | |
dc.identifier.issn | 00051098 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/104295 | |
dc.description.abstract | In this paper we study an extended J-spectral factorization problem, i.e., J-spectral factorization problem for descriptor systems which may not have full column normal rank and may exhibit poles and zeros on the extended imaginary axis. We present necessary and sufficient solvability conditions and develop a numerically reliable method for the underlying problem. Our method is implemented by using only orthogonal transformations and has an acceptable computational complexity. © 2007 Elsevier Ltd. All rights reserved. | |
dc.description.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1016/j.automatica.2007.03.012 | |
dc.source | Scopus | |
dc.subject | Descriptor system | |
dc.subject | Orthogonal transformation | |
dc.subject | Spectral factorization | |
dc.type | Article | |
dc.contributor.department | MATHEMATICS | |
dc.description.doi | 10.1016/j.automatica.2007.03.012 | |
dc.description.sourcetitle | Automatica | |
dc.description.volume | 44 | |
dc.description.issue | 3 | |
dc.description.page | 585-597 | |
dc.description.coden | ATCAA | |
dc.identifier.isiut | 000254596100001 | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.