Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/80821
DC FieldValue
dc.titleNon-iterative computation of infimum in discrete-time H∞-optimization and solvability conditions for the discrete-time disturbance decoupling problem
dc.contributor.authorChen, B.M.
dc.contributor.authorGuo, Y.
dc.contributor.authorLin, Z.
dc.date.accessioned2014-10-07T03:01:39Z
dc.date.available2014-10-07T03:01:39Z
dc.date.issued1996-10
dc.identifier.citationChen, B.M.,Guo, Y.,Lin, Z. (1996-10). Non-iterative computation of infimum in discrete-time H∞-optimization and solvability conditions for the discrete-time disturbance decoupling problem. International Journal of Control 65 (3) : 433-454. ScholarBank@NUS Repository.
dc.identifier.issn00207179
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/80821
dc.description.abstractA non-iterative method for the computation of the infimum for a class of discrete-time H∞ optimal control problems, and the solvability conditions for the general discrete-time disturbance decoupling problem are given in this paper. The method for the computation of the infimum is applicable to systems where the transfer functions from the disturbance input to the measurement output and from the control input to the controlled output are free of unit circle invariant zeros and satisfy certain geometric conditions. The solvability conditions we obtained for the general discrete-time disturbance decoupling problem are also necessary and sufficient conditions.
dc.sourceScopus
dc.typeArticle
dc.contributor.departmentELECTRICAL ENGINEERING
dc.description.sourcetitleInternational Journal of Control
dc.description.volume65
dc.description.issue3
dc.description.page433-454
dc.description.codenIJCOA
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Page view(s)

61
checked on Mar 20, 2020

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.