An implicit iterative algorithm with a tuning parameter for Itô Lyapunov matrix equations

In this paper, an implicit iterative algorithm is proposed for solving a class of Lyapunov matrix equations arising in Itô stochastic linear systems. A tuning parameter is introduced in this algorithm, and thus the convergence rate of the algorithm can be changed. Some conditions are presented such...

Full description

Saved in:
Bibliographic Details
Published in:International journal of systems science Vol. 49; no. 2; pp. 425 - 434
Main Authors: Zhang, Ying, Wu, Ai-Guo, Sun, Hui-Jie
Format: Journal Article
Language:English
Published: London Taylor & Francis 25.01.2018
Taylor & Francis Ltd
Subjects:
Algorithms
Convergence
convergence rate
discrete Lyapunov matrix equations
Iterative algorithms
Iterative methods
Linear systems
Matrix methods
Queuing theory
Smith iteration
Tuning
ISSN:0020-7721, 1464-5319
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract In this paper, an implicit iterative algorithm is proposed for solving a class of Lyapunov matrix equations arising in Itô stochastic linear systems. A tuning parameter is introduced in this algorithm, and thus the convergence rate of the algorithm can be changed. Some conditions are presented such that the developed algorithm is convergent. In addition, an explicit expression is also derived for the optimal tuning parameter, which guarantees that the obtained algorithm achieves its fastest convergence rate. Finally, numerical examples are employed to illustrate the effectiveness of the given algorithm.
AbstractList In this paper, an implicit iterative algorithm is proposed for solving a class of Lyapunov matrix equations arising in Itô stochastic linear systems. A tuning parameter is introduced in this algorithm, and thus the convergence rate of the algorithm can be changed. Some conditions are presented such that the developed algorithm is convergent. In addition, an explicit expression is also derived for the optimal tuning parameter, which guarantees that the obtained algorithm achieves its fastest convergence rate. Finally, numerical examples are employed to illustrate the effectiveness of the given algorithm.
Author Wu, Ai-Guo
Zhang, Ying
Sun, Hui-Jie
Author_xml – sequence: 1
  givenname: Ying
  surname: Zhang
  fullname: Zhang, Ying
  organization: Shenzhen Graduate School, Harbin Institute of Technology
– sequence: 2
  givenname: Ai-Guo
  surname: Wu
  fullname: Wu, Ai-Guo
  email: agwu@hitsz.edu.cn
  organization: Shenzhen Graduate School, Harbin Institute of Technology
– sequence: 3
  givenname: Hui-Jie
  surname: Sun
  fullname: Sun, Hui-Jie
  organization: Shenzhen Graduate School, Harbin Institute of Technology
BookMark eNqFkE1OwzAQRi0EEi1wBCRLrFPGjlMnYgOq-JMqsYENG2uSOmCU2MFxWnovbsDFcClsWMBmZvO-bzRvTHats5qQYwYTBjmcAnCQkrMJByYnTIAEKHbIiImpSLKUFbtktGGSDbRPxn3_AgBZxmFEHi8sNW3XmMoEaoL2GMxSU2yenDfhuaWrOCnSMFhjn2iHHlsdMVo7T2_Dxzudr7EbrFvSFoM3b1S_DrHD2f6Q7NXY9Proex-Qh6vL-9lNMr-7vp1dzJMqTfOQIJd5plm-kFNMWVlkQoPMOAMhZc1KJsqaCcGxmGKdljrX5QIWlRQRL2tesvSAnGx7O-9eB90H9eIGb-NJxYo8yhBcQqSyLVV51_de16rzpkW_VgzURqP60ag2GtW3xpg7-5WLpr4eDB5N82_6fJs2NgprceV8s1AB143ztUdbmV6lf1d8AsPLjiM
CitedBy_id crossref_primary_10_1016_j_amc_2022_126958
crossref_primary_10_1049_cth2_12680
crossref_primary_10_1177_0142331219875273
crossref_primary_10_3934_jimo_2025076
crossref_primary_10_1016_j_amc_2018_07_032
Cites_doi 10.1109/9.863597
10.1016/j.sysconle.2008.12.004
10.1016/j.amc.2010.05.086
10.1016/j.apm.2009.06.018
10.1016/j.jfranklin.2013.07.008
10.1017/S0017089500002135
10.1049/iet-cta.2014.0669
10.1109/TAC.2015.2508884
10.1109/TAC.2005.852558
10.1016/j.amc.2011.01.031
10.1109/TAC.2008.929368
10.1049/iet-cta.2009.0655
10.1137/S0363012904441350
10.1016/j.camwa.2009.06.047
10.1016/j.automatica.2003.07.002
10.1016/j.laa.2009.11.014
10.1016/j.amc.2008.02.035
ContentType Journal Article
Copyright 2017 Informa UK Limited, trading as Taylor & Francis Group 2017
2017 Informa UK Limited, trading as Taylor & Francis Group
Copyright_xml – notice: 2017 Informa UK Limited, trading as Taylor & Francis Group 2017
– notice: 2017 Informa UK Limited, trading as Taylor & Francis Group
DBID AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1080/00207721.2017.1407009
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1464-5319
EndPage 434
ExternalDocumentID 10_1080_00207721_2017_1407009
1407009
Genre Article
GrantInformation_xml – fundername: Shenzhen Municipal Basic Research Project for Discipline Layout
  grantid: JCYJ20170413112722597
– fundername: Guangdong Natural Science Foundation
  grantid: 2017A030313340
  funderid: 10.13039/501100003453
– fundername: National Natural Science Foundation of China
  grantid: 61603111
  funderid: 10.13039/501100001809
– fundername: Shenzhen Municipal Project for Basic Research
  grantid: JCYJ20170307150227897
GroupedDBID -~X
.7F
.DC
.QJ
0BK
0R~
29J
30N
4.4
5GY
5VS
8VB
AAENE
AAGDL
AAHIA
AAJMT
AALDU
AAMIU
AAPUL
AAQRR
ABCCY
ABFIM
ABHAV
ABJNI
ABLIJ
ABPAQ
ABPEM
ABTAI
ABXUL
ABXYU
ACGEJ
ACGFS
ACNCT
ACTIO
ADCVX
ADGTB
ADXPE
AEISY
AENEX
AEOZL
AEPSL
AEYOC
AFKVX
AFRVT
AGDLA
AGMYJ
AHDZW
AIJEM
AIYEW
AJWEG
AKBVH
AKOOK
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AQRUH
AQTUD
AVBZW
AWYRJ
BLEHA
CCCUG
CE4
CS3
DGEBU
DKSSO
DU5
EBS
EJD
E~A
E~B
F5P
GTTXZ
H13
HF~
HZ~
H~P
IPNFZ
J.P
KYCEM
M4Z
MS~
NA5
NX~
O9-
P2P
QWB
RIG
RNANH
ROSJB
RTWRZ
S-T
SNACF
TASJS
TBQAZ
TDBHL
TEN
TFL
TFT
TFW
TNC
TTHFI
TUROJ
TWF
UT5
UU3
ZGOLN
ZL0
~02
~S~
AAYXX
CITATION
7SC
8FD
ADYSH
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c338t-a2785e18d76a31b954e075210477f1b14bf1442a96af3be8ebd0dc7476abf2b13
IEDL.DBID TFW
ISICitedReferencesCount 10
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000428634500014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0020-7721
IngestDate Fri Jul 25 06:17:37 EDT 2025
Sat Nov 29 02:12:35 EST 2025
Tue Nov 18 21:58:47 EST 2025
Mon Oct 20 23:47:25 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 2
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c338t-a2785e18d76a31b954e075210477f1b14bf1442a96af3be8ebd0dc7476abf2b13
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
PQID 1980704270
PQPubID 2045514
PageCount 10
ParticipantIDs proquest_journals_1980704270
informaworld_taylorfrancis_310_1080_00207721_2017_1407009
crossref_primary_10_1080_00207721_2017_1407009
crossref_citationtrail_10_1080_00207721_2017_1407009
PublicationCentury 2000
PublicationDate 2018-01-25
PublicationDateYYYYMMDD 2018-01-25
PublicationDate_xml – month: 01
  year: 2018
  text: 2018-01-25
  day: 25
PublicationDecade 2010
PublicationPlace London
PublicationPlace_xml – name: London
PublicationTitle International journal of systems science
PublicationYear 2018
Publisher Taylor & Francis
Taylor & Francis Ltd
Publisher_xml – name: Taylor & Francis
– name: Taylor & Francis Ltd
References cit0011
cit0001
cit0012
cit0010
Deng F. (cit0005) 1996; 13
cit0008
cit0009
cit0006
cit0017
cit0007
cit0018
cit0004
cit0015
cit0016
cit0002
cit0013
cit0003
cit0014
References_xml – volume: 13
  start-page: 163
  year: 1996
  ident: cit0005
  publication-title: Control Theory and Applications
– ident: cit0013
  doi: 10.1109/9.863597
– ident: cit0018
  doi: 10.1016/j.sysconle.2008.12.004
– ident: cit0011
  doi: 10.1016/j.amc.2010.05.086
– ident: cit0004
  doi: 10.1016/j.apm.2009.06.018
– ident: cit0008
  doi: 10.1016/j.jfranklin.2013.07.008
– ident: cit0001
  doi: 10.1017/S0017089500002135
– ident: cit0009
  doi: 10.1049/iet-cta.2014.0669
– ident: cit0014
  doi: 10.1109/TAC.2015.2508884
– ident: cit0006
  doi: 10.1109/TAC.2005.852558
– ident: cit0012
  doi: 10.1016/j.amc.2011.01.031
– ident: cit0017
  doi: 10.1109/TAC.2008.929368
– ident: cit0010
  doi: 10.1049/iet-cta.2009.0655
– ident: cit0007
  doi: 10.1137/S0363012904441350
– ident: cit0015
  doi: 10.1016/j.camwa.2009.06.047
– ident: cit0016
  doi: 10.1016/j.automatica.2003.07.002
– ident: cit0003
  doi: 10.1016/j.laa.2009.11.014
– ident: cit0002
  doi: 10.1016/j.amc.2008.02.035
SSID ssj0005520
Score 2.2125738
Snippet In this paper, an implicit iterative algorithm is proposed for solving a class of Lyapunov matrix equations arising in Itô stochastic linear systems. A tuning...
SourceID proquest
crossref
informaworld
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 425
SubjectTerms Algorithms
Convergence
convergence rate
discrete Lyapunov matrix equations
Iterative algorithms
Iterative methods
Linear systems
Matrix methods
Queuing theory
Smith iteration
Tuning
Title An implicit iterative algorithm with a tuning parameter for Itô Lyapunov matrix equations
URI https://www.tandfonline.com/doi/abs/10.1080/00207721.2017.1407009
https://www.proquest.com/docview/1980704270
Volume 49
WOSCitedRecordID wos000428634500014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAWR
  databaseName: Taylor and Francis Online Journals
  customDbUrl:
  eissn: 1464-5319
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0005520
  issn: 0020-7721
  databaseCode: TFW
  dateStart: 19701001
  isFulltext: true
  titleUrlDefault: https://www.tandfonline.com
  providerName: Taylor & Francis
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3NSsNAEF6keNCD_2K1yh68RrLZpMkei1gUSvFQsXhZdpONFtq0NmnR9_INfDFn8lNbRHrQ4xJmSSYzszPLN98QchlEyg49iH6a88hyPWGsINYcG3xYoNxY2GFOmd_xu92g3xf3JZowLWGVWEPHBVFEHqvRuZVOK0QcdnDbkBRidcd8cHWw2ryFD45-dM1e-_Eb5OGVxIxQJKFI1cPz2y4rp9MKd-mPWJ0fQO3df3j1PbJTZp-0VZjLPtkwyQHZXuIkPCRPrYQOcpj5IKMF5zIERKqGz-PpIHsZUby5pYpmM7xRoUgdPkJIDYWPoHfZ5wftvKvJLBnP6Qjp_9-oeS3oxNMj8tC-6V3fWuUABiuEyjWzlOMHnmFB5DcVZ1p4roEMw0F2Bz9mmrk6hnrMUaKpYq5NYHRkRyEUKE2lY0czfkxqyTgxJ4TCApIJE_oaciDBlXYjrSB7QAIryCFYnbiV4mVYspPjkIyhZAsS00J1ElUnS9XVydVCbFLQc6wTEMt_VWb5vUhcDDGRfI1sozIBWXp6KpkI4KHr-PbpH7Y-I1uwRFih5XgNUsumM3NONsN5NkinF7lNfwHtt_Ca
linkProvider Taylor & Francis
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LT8MwDI4QIAEH3ojxzIFrUdO0a3OcENMQZachJi5R0qZQaetg6xD8L_4Bfwy7DxhCiAMcq8hR6zrOZ8v-TMhJECs78sD7ac5jy_WEsYJEc2zwYYFyE2FHBWV-6He7Qb8vZnthsKwSY-ikJIoofDUebkxG1yVx2MJtAyrE8I75cNbBbLGHb8ET3EMr77VvPss8vIqaEcIklKm7eH7a5sv99IW99Ju3Lq6g9tp_vPw6Wa0AKG2VFrNB5ky2SVZmaAm3yG0ro2lRaZ7mtKRdBp9I1eBuNE7z-yHF5C1VNJ9iUoUie_gQq2oofAW9yN9eafiiHqbZ6IkOcQLAMzWPJaP4ZJtct897Zx2rmsFgRRC85pZy_MAzLIj9puJMC881ADIcJHjwE6aZqxMIyRwlmirh2gRGx3YcQYzSVDpxNOM7ZD4bZWaXUHgAPGEiXwMMElxpN9YKAARyWAGMYA3i1pqXUUVQjnMyBpJ98JiWqpOoOlmprkFOP8QeSoaO3wTE7G-VeZEaSco5JpL_IntQ24CsDvtEMhHAouv49t4ftj4mS53eVSjDi-7lPlmGJawytBzvgMzn46k5JIvRU55OxkeFgb8DOin0xA
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1NS8NAEF2kiujBb7FadQ9eI9l8NMmxqMViKT1ULF6W3WRXC21am7To__If-MecSdLaIuJBj2GZJZnMzr5Z3rwl5MKPhBm6kP2kbUeG4wbK8LW0scGH-cLRgRlmkvlNr9Xyu92gXbAJk4JWiTW0zoUislyNi3sU6RkjDju4TQCFWN0xD5Y6RC228K0CdHaQ1dWpP3yxPNxCmRGqJLSZNfH8NM3S9rQkXvotWWc7UH37H959h2wV8JPW8njZJSsq3iObC6KE--SxFtNexjPvpTQXXYaMSEX_aTjupc8Dike3VNB0gkcqFLXDB8ipofARtJF-vNPmmxhN4uGUDlD__5Wql1xPPDkg9_WbztWtUdzAYIRQuqaGsDzfVcyPvKqwmQxcRwHEsFDewdNMMkdqKMgsEVSFtqXylYzMKIQKpSqktiSzD0kpHsbqiFB4ADShQk8CCApsIZ1ICoAPqGAFIIKViTNzPA8LeXK8JaPP2VzFNHcdR9fxwnVlcjk3G-X6HL8ZBIt_lafZwYjObzHh9i-2lVkI8GKpJ5wFPgw6lmce_2Hqc7Levq7zZqN1d0I2YAQphoblVkgpHU_UKVkLp2kvGZ9l4f0JVrbzdg
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+implicit+iterative+algorithm+with+a+tuning+parameter+for+It%C3%B4+Lyapunov+matrix+equations&rft.jtitle=International+journal+of+systems+science&rft.au=Zhang%2C+Ying&rft.au=Wu%2C+Ai-Guo&rft.au=Sun%2C+Hui-Jie&rft.date=2018-01-25&rft.issn=0020-7721&rft.eissn=1464-5319&rft.volume=49&rft.issue=2&rft.spage=425&rft.epage=434&rft_id=info:doi/10.1080%2F00207721.2017.1407009&rft.externalDBID=n%2Fa&rft.externalDocID=10_1080_00207721_2017_1407009
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-7721&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-7721&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-7721&client=summon