File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/j.camwa.2008.07.037
- Scopus: eid_2-s2.0-55649083103
- WOS: WOS:000261626600011
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Convergence of gradient-based iterative solution of coupled Markovian jump Lyapunov equations
Title | Convergence of gradient-based iterative solution of coupled Markovian jump Lyapunov equations |
---|---|
Authors | |
Keywords | Convergence Rate Discrete-Time Gradient Iteration Lyapunov Equations Markov Jump Linear Systems |
Issue Date | 2008 |
Publisher | Pergamon. The Journal's web site is located at http://www.elsevier.com/locate/camwa |
Citation | Computers And Mathematics With Applications, 2008, v. 56 n. 12, p. 3070-3078 How to Cite? |
Abstract | The solution of coupled discrete-time Markovian jump Lyapunov matrix equations (CDMJLMEs) is important in stability analysis and controller design for Markovian jump linear systems. This paper presents a simple and effective iterative method to produce numerical solutions to this class of matrix equations. The gradient-based algorithm is developed from an optimization point of view. A necessary and sufficient condition guaranteeing the convergence of the algorithm is established. This condition shows that the algorithm always converges provided the CDMJLMEs have unique solutions which is evidently different from the existing results that converge conditionally. A simple sufficient condition which is easy to test is also provided. The optimal step size in the algorithm such that the convergence rate of the algorithm is maximized is given explicitly. It turns out that an upper bound of the convergence rate is bounded by a function of the condition number of the augmented coefficient matrix of the CDMJLMEs. Some parameters are introduced to the algorithm that will potentially reduce the condition number and thus increase the convergence rate of the algorithm. A numerical example is used to illustrate the efficiency of the proposed approach. © 2008 Elsevier Ltd. All rights reserved. |
Persistent Identifier | http://hdl.handle.net/10722/156986 |
ISSN | 2023 Impact Factor: 2.9 2023 SCImago Journal Rankings: 0.949 |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zhou, B | en_US |
dc.contributor.author | Lam, J | en_US |
dc.contributor.author | Duan, GR | en_US |
dc.date.accessioned | 2012-08-08T08:44:49Z | - |
dc.date.available | 2012-08-08T08:44:49Z | - |
dc.date.issued | 2008 | en_US |
dc.identifier.citation | Computers And Mathematics With Applications, 2008, v. 56 n. 12, p. 3070-3078 | en_US |
dc.identifier.issn | 0898-1221 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/156986 | - |
dc.description.abstract | The solution of coupled discrete-time Markovian jump Lyapunov matrix equations (CDMJLMEs) is important in stability analysis and controller design for Markovian jump linear systems. This paper presents a simple and effective iterative method to produce numerical solutions to this class of matrix equations. The gradient-based algorithm is developed from an optimization point of view. A necessary and sufficient condition guaranteeing the convergence of the algorithm is established. This condition shows that the algorithm always converges provided the CDMJLMEs have unique solutions which is evidently different from the existing results that converge conditionally. A simple sufficient condition which is easy to test is also provided. The optimal step size in the algorithm such that the convergence rate of the algorithm is maximized is given explicitly. It turns out that an upper bound of the convergence rate is bounded by a function of the condition number of the augmented coefficient matrix of the CDMJLMEs. Some parameters are introduced to the algorithm that will potentially reduce the condition number and thus increase the convergence rate of the algorithm. A numerical example is used to illustrate the efficiency of the proposed approach. © 2008 Elsevier Ltd. All rights reserved. | en_US |
dc.language | eng | en_US |
dc.publisher | Pergamon. The Journal's web site is located at http://www.elsevier.com/locate/camwa | en_US |
dc.relation.ispartof | Computers and Mathematics with Applications | en_US |
dc.subject | Convergence Rate | en_US |
dc.subject | Discrete-Time | en_US |
dc.subject | Gradient | en_US |
dc.subject | Iteration | en_US |
dc.subject | Lyapunov Equations | en_US |
dc.subject | Markov Jump Linear Systems | en_US |
dc.title | Convergence of gradient-based iterative solution of coupled Markovian jump Lyapunov equations | en_US |
dc.type | Article | en_US |
dc.identifier.email | Lam, J:james.lam@hku.hk | en_US |
dc.identifier.authority | Lam, J=rp00133 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.doi | 10.1016/j.camwa.2008.07.037 | en_US |
dc.identifier.scopus | eid_2-s2.0-55649083103 | en_US |
dc.identifier.hkuros | 164192 | - |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-55649083103&selection=ref&src=s&origin=recordpage | en_US |
dc.identifier.volume | 56 | en_US |
dc.identifier.issue | 12 | en_US |
dc.identifier.spage | 3070 | en_US |
dc.identifier.epage | 3078 | en_US |
dc.identifier.isi | WOS:000261626600011 | - |
dc.publisher.place | United Kingdom | en_US |
dc.identifier.scopusauthorid | Zhou, B=7401906664 | en_US |
dc.identifier.scopusauthorid | Lam, J=7201973414 | en_US |
dc.identifier.scopusauthorid | Duan, GR=35229183800 | en_US |
dc.identifier.issnl | 0898-1221 | - |