×

Gradient-based maximal convergence rate iterative method for solving linear matrix equations. (English) Zbl 1188.65058

This paper deals with a gradient-based iterative methed proposed by Ding and Chen [IEEE Trans. Automat. Control. 50(8), 1216–1221 (2005)] for solving a class of linear matrix equation. The main contribution of this paper is that it is shown explicitly how to choose the convergence factor such that the convergence rate of the algorithm is maximized and analytical expression of the maximal convergence rate is given. These results shed some light on studying gradient-based algorithm reported in the literature by using control system theory.

MSC:

65F30 Other matrix algorithms (MSC2010)
65F10 Iterative numerical methods for linear systems
65N22 Numerical solution of discretized equations for boundary value problems involving PDEs
15A09 Theory of matrix inversion and generalized inverses
15A12 Conditioning of matrices
15A24 Matrix equations and identities
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Atkinson K. E., An Introduction of Numerical Analysis, 2. ed. (1989) · Zbl 0718.65001
[2] DOI: 10.1007/s00607-006-0178-y · Zbl 1111.65039
[3] DOI: 10.1016/S0167-6911(82)80009-1 · Zbl 0473.93037
[4] DOI: 10.1109/TAC.1979.1102064 · Zbl 0404.93018
[5] Blondel V. D., Unsolved Problems in Mathematical Systems and Control Theory (2004) · Zbl 1052.93002
[6] DOI: 10.1002/(SICI)1099-1514(199707/08)18:4<283::AID-OCA603>3.0.CO;2-Q · Zbl 0916.93029
[7] DOI: 10.1137/S0363012900331891 · Zbl 0963.93060
[8] DOI: 10.1137/S0895479801362546 · Zbl 1031.93074
[9] DOI: 10.1016/j.automatica.2006.04.024 · Zbl 1130.93332
[10] DOI: 10.1137/S0895479895270963 · Zbl 0912.93027
[11] DOI: 10.1016/S0024-3795(99)00108-1 · Zbl 0959.93032
[12] DOI: 10.1109/TAC.2006.886543 · Zbl 1366.93230
[13] DOI: 10.1109/TAC.1968.1098954
[14] DOI: 10.1016/0024-3795(81)90301-3 · Zbl 0468.15012
[15] DOI: 10.1109/TAC.2005.852558 · Zbl 1365.65083
[16] DOI: 10.1016/j.sysconle.2004.06.008 · Zbl 1129.65306
[17] DOI: 10.1137/S0363012904441350 · Zbl 1115.65035
[18] DOI: 10.1016/j.amc.2007.07.040 · Zbl 1143.65035
[19] DOI: 10.1109/9.250470 · Zbl 0775.93098
[20] DOI: 10.1109/9.489286 · Zbl 0855.93017
[21] DOI: 10.1109/TAC.2006.874989 · Zbl 1366.15011
[22] DOI: 10.1109/9.557586 · Zbl 0866.93048
[23] DOI: 10.1109/TAC.1979.1102170 · Zbl 0421.65022
[24] DOI: 10.1080/00207160410001712305 · Zbl 1059.65027
[25] DOI: 10.1109/9.284905 · Zbl 0816.93041
[26] DOI: 10.1109/TAC.1972.1099898 · Zbl 0262.93028
[27] DOI: 10.1023/B:JOTA.0000037409.86566.f9 · Zbl 1056.93036
[28] DOI: 10.1080/00207160500112886 · Zbl 1078.65024
[29] DOI: 10.1080/00207169208804103 · Zbl 0758.65027
[30] DOI: 10.1002/rnc.4590050303 · Zbl 0824.93027
[31] DOI: 10.1016/S0167-6911(97)90007-4 · Zbl 0901.93025
[32] DOI: 10.1080/002071799220326 · Zbl 1047.93519
[33] DOI: 10.1016/0024-3795(91)90384-9 · Zbl 0736.65031
[34] DOI: 10.1016/S0024-3795(02)00255-0 · Zbl 1003.65042
[35] DOI: 10.1016/j.laa.2005.01.018 · Zbl 1076.15016
[36] DOI: 10.1016/j.sysconle.2005.07.002 · Zbl 1129.15300
[37] DOI: 10.1109/CDC.2006.377465
[38] DOI: 10.1016/j.sysconle.2007.08.010 · Zbl 1129.93018
[39] DOI: 10.1080/00207160512331331129 · Zbl 1074.65042
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.