# zbMATH — the first resource for mathematics

On Smith-type iterative algorithms for the Stein matrix equation. (English) Zbl 1179.15016
Summary: This note studies the iterative solution to the Stein matrix equation. Firstly, it is shown that the recently developed Smith$$(l)$$ iteration converges to the exact solution for arbitrary initial condition whereas a special initial condition is required in the literature. Secondly, by presenting a new accelerative Smith iteration named the $$r$$-Smith iteration that includes the well-known ordinary Smith accelerative iteration as a special case, we have shown that the $$r$$-Smith accelerative iteration requires less computation than the Smith iteration and the Smith$$(l)$$ iteration, and the ordinary Smith accelerative iteration requires the least computations comparing with other Smith-type iterations.

##### MSC:
 15A24 Matrix equations and identities
mctoolbox
Full Text:
##### References:
 [1] Bhattacharyya, S.P.; de Souza, E., Pole assignment via sylvester’s equation, Systems & control letters, 1, 4, 261-263, (1981) · Zbl 0473.93037 [2] Hu, T.; Lin, Z.; Lam, J., Unified gradient approach to performance optimization under a pole assignment constrain, Journal of optimization theory and applications, 121, 2, 361-383, (2004) · Zbl 1056.93036 [3] Lam, J.; Yan, W.; Hu, T., Pole assignment with eigenvalue and stability robustness, International journal of control, 72, 13, 1165-1174, (1999) · Zbl 1047.93519 [4] B. Zhou, G.R. Duan, Parametric approach for the normal Luenberger function observer design in second-order linear systems, in: Proceedings of the 45th IEEE Conference on Decision and Control, 2006, pp. 1423-1428 [5] Penzl, T., A cyclic low-rank Smith method for large sparse Lyapunov equations, SIAM journal on scientific computing, 21, 4, 1401-1418, (2000) · Zbl 0958.65052 [6] Gugercin, S.; Sorensen, D.C.; Antoulas, A.C., A modified low-rank Smith method for large-scale Lyapunov equations, Journal numerical algorithms, 32, 1, 27-55, (2003) · Zbl 1034.93020 [7] Chu, D.; Van Dooren, P., A novel numerical method for exact model matching problem with stability, Automatica, 42, 1697-1704, (2006) · Zbl 1130.93332 [8] Miller, D.F., The iterative solution of the matrix equation $$X A + B X + C = 0$$, Linear algebra and its applications, 105, 131-137, (1988) · Zbl 0663.65032 [9] Duan, G.R., The solution to the matrix equation $$A V + B W = E V J + R$$, Applied mathematics letters, 17, 10, 1197-1204, (2004) [10] Zhou, B.; Duan, G.R., A new solution to the generalized Sylvester matrix equation $$A V - E V F = B W$$, Systems & control letters, 55, 3, 193-198, (2006) [11] Hu, Q.; Cheng, D., The polynomial solution to the Sylvester matrix equation, Applied mathematics letters, 19, 9, 859-864, (2006) · Zbl 1117.15011 [12] Smith, R.A., Matrix equation $$X A + B X = C$$, SIAM journal on applied mathematics, 16, 1, 198-201, (1968) · Zbl 0157.22603 [13] Wachspress, E.L., Iterative solution of the Lyapunov matrix equation, Applied mathematics letters, 1, 1, 87-90, (1988) · Zbl 0631.65037 [14] Davison, E.J.; Man, F.T., The numerical solution of $$A^\prime Q + Q A = C$$, IEEE transactions on automatic control, 13, 4, 448-449, (1968) [15] Sadkane, M., Estimates from the discrete-time Lyapunov equation, Applied mathematics letters, 16, 3, 313-316, (2003) · Zbl 1068.93047 [16] Hammarling, S.J., Numerical solution of the stable, non-negative definite Lyapunov equation, IMA journal of numerical analysis, 2, 303-323, (1982) · Zbl 0492.65017 [17] Wang, Q.; Lam, J.; Wei, Y.; Chen, T., Iterative solutions of coupled discrete Markovian jump Lyapunov equations, Computers and mathematics with applications, 55, 4, 843-850, (2008) · Zbl 1139.60334 [18] Varga, R.S., Matrix iterative analysis, (2000), Springer · Zbl 0133.08602 [19] Higham, N.J., Accuracy and stability of numerical algorithms, (1996), SIAM Philadelphia · Zbl 0847.65010
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.