Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/92039
DC FieldValue
dc.titleIdentification on demand using a blockwise recursive partial least-squares technique
dc.contributor.authorVijaysai, P.
dc.contributor.authorGudi, R.D.
dc.contributor.authorLakshminarayanan, S.
dc.date.accessioned2014-10-09T09:54:43Z
dc.date.available2014-10-09T09:54:43Z
dc.date.issued2003-02-05
dc.identifier.citationVijaysai, P.,Gudi, R.D.,Lakshminarayanan, S. (2003-02-05). Identification on demand using a blockwise recursive partial least-squares technique. Industrial and Engineering Chemistry Research 42 (3) : 540-554. ScholarBank@NUS Repository.
dc.identifier.issn08885885
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/92039
dc.description.abstractRegression techniques that are used for online estimation and control generally yield poor models if the data is not rich enough. Further, restrictions on the lower limit of the forgetting factor, used to prevent ill conditioning of the covariance matrix, confine applications of such techniques to slowly changing processes only. In this paper a modified blockwise dynamic recursive PLS technique that is based on selection of rich data has been proposed for online adaptation and control. Because of its ability to accommodate a wider range of forgetting factors, the technique is found to track the dynamics of slow as well as fast changes in the processes. The proposed technique has been evaluated for adaptation and control using representative chemical processes taken from the literature.
dc.sourceScopus
dc.typeArticle
dc.contributor.departmentCHEMICAL & ENVIRONMENTAL ENGINEERING
dc.description.sourcetitleIndustrial and Engineering Chemistry Research
dc.description.volume42
dc.description.issue3
dc.description.page540-554
dc.description.codenIECRE
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.

Google ScholarTM

Check


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