File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A gradient flow approach to the robust pole-placement problem

TitleA gradient flow approach to the robust pole-placement problem
Authors
KeywordsPole placement
Robustness
Gradient
Issue Date1995
PublisherJohn Wiley & Sons Ltd. The Journal's web site is located at http://www3.interscience.wiley.com/cgi-bin/jhome/5510
Citation
International Journal of Robust and Nonlinear Control, 1995, v. 5 n. 3, p. 175-185 How to Cite?
AbstractThis paper provides a computational procedure for a type of robust pole-placement problem. By exploiting the differentiability nature of the objective function based on the Frobenius norm condition number, the minimization problem is formulated in terms of a gradient flow to which standard ODE numerical routines can be applied. It is shown that a minimum point exists for the objective function. The algorithm is efficient and faces no singularity problem with the resulting eigenvector matrix. A numerical example is used to illustrate the technique and comparison with other methods is made.
Persistent Identifierhttp://hdl.handle.net/10722/222189
ISSN
2021 Impact Factor: 3.897
2020 SCImago Journal Rankings: 1.361
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorLam, J-
dc.contributor.authorYan, WY-
dc.date.accessioned2015-12-30T06:39:00Z-
dc.date.available2015-12-30T06:39:00Z-
dc.date.issued1995-
dc.identifier.citationInternational Journal of Robust and Nonlinear Control, 1995, v. 5 n. 3, p. 175-185-
dc.identifier.issn1049-8923-
dc.identifier.urihttp://hdl.handle.net/10722/222189-
dc.description.abstractThis paper provides a computational procedure for a type of robust pole-placement problem. By exploiting the differentiability nature of the objective function based on the Frobenius norm condition number, the minimization problem is formulated in terms of a gradient flow to which standard ODE numerical routines can be applied. It is shown that a minimum point exists for the objective function. The algorithm is efficient and faces no singularity problem with the resulting eigenvector matrix. A numerical example is used to illustrate the technique and comparison with other methods is made.-
dc.languageeng-
dc.publisherJohn Wiley & Sons Ltd. The Journal's web site is located at http://www3.interscience.wiley.com/cgi-bin/jhome/5510-
dc.relation.ispartofInternational Journal of Robust and Nonlinear Control-
dc.rightsInternational Journal of Robust and Nonlinear Control. Copyright © John Wiley & Sons Ltd.-
dc.rightsSpecial Statement for Preprint only Before publication: 'This is a preprint of an article accepted for publication in [The Journal of Pathology] Copyright © ([year]) ([Pathological Society of Great Britain and Ireland])'. After publication: the preprint notice should be amended to follows: 'This is a preprint of an article published in [include the complete citation information for the final version of the Contribution as published in the print edition of the Journal]' For Cochrane Library/ Cochrane Database of Systematic Reviews, add statement & acknowledgement : ‘This review is published as a Cochrane Review in the Cochrane Database of Systematic Reviews 20XX, Issue X. Cochrane Reviews are regularly updated as new evidence emerges and in response to comments and criticisms, and the Cochrane Database of Systematic Reviews should be consulted for the most recent version of the Review.’ Please include reference to the Review and hyperlink to the original version using the following format e.g. Authors. Title of Review. Cochrane Database of Systematic Reviews 20XX, Issue #. Art. No.: CD00XXXX. DOI: 10.1002/14651858.CD00XXXX (insert persistent link to the article by using the URL: http://dx.doi.org/10.1002/14651858.CD00XXXX) (This statement should refer to the most recent issue of the Cochrane Database of Systematic Reviews in which the Review published.)-
dc.subjectPole placement-
dc.subjectRobustness-
dc.subjectGradient-
dc.titleA gradient flow approach to the robust pole-placement problem-
dc.typeArticle-
dc.identifier.emailLam, J: james.lam@hku.hk-
dc.identifier.authorityLam, J=rp00133-
dc.identifier.doi10.1002/rnc.4590050303-
dc.identifier.scopuseid_2-s2.0-84987172528-
dc.identifier.hkuros2020-
dc.identifier.volume5-
dc.identifier.issue3-
dc.identifier.spage175-
dc.identifier.epage185-
dc.identifier.isiWOS:A1995RA71400002-
dc.publisher.placeUnited Kingdom-
dc.identifier.issnl1049-8923-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats