Mukaidani, Hiroaki Newton’s method for solving cross-coupled sign-indefinite algebraic Riccati equations for weakly coupled large-scale systems. (English) Zbl 1118.65048 Appl. Math. Comput. 188, No. 1, 103-115 (2007). Summary: A new algorithm for solving cross-coupled sign-indefinite algebraic Riccati equations (CSAREs) for weakly coupled large-scale systems is proposed. It is shown that since the proposed algorithm is based on the Newton’s method, the quadratic convergence is attained. Moreover, the local uniqueness of the convergence solutions for the CSAREs is investigated. Finally, in order to overcome the computation of large- and sparse-matrix related to the Newton’s method, the fixed point algorithm and the alternating direction implicit method are combined. Cited in 7 Documents MSC: 65H10 Numerical computation of solutions to systems of equations 15A24 Matrix equations and identities 65L05 Numerical methods for initial value problems involving ordinary differential equations 91A23 Differential games (aspects of game theory) 34A30 Linear ordinary differential equations and systems Keywords:Newton-Kantorovich theorem; fixed point algorithm; alternating direction implicit method; linear-quadratic differential games; convergence; quadratic convergence PDF BibTeX XML Cite \textit{H. Mukaidani}, Appl. Math. Comput. 188, No. 1, 103--115 (2007; Zbl 1118.65048) Full Text: DOI OpenURL References: [1] Broek, W.A.V.D.; Engwerda, J.C.; Schumacher, J.M., Robust equilibria in indefinite linear-quadratic differential games, J. optim. theory appl., 119, 3, 565-595, (2003) · Zbl 1084.91009 [2] Engwerda, J.C., A numerical algorithm to find soft-constrained Nash equilibria in scalar LQ-games, Int. J. control, 79, 6, 592-603, (2006) · Zbl 1255.91051 [3] Delacour, J.D.; Darwish, M.; Fantin, J., Control strategies for large-scale power systems, Int. J. control, 27, 5, 753-767, (1978) · Zbl 0373.93003 [4] Shen, X.; Xia, Q.; Rao, M.; Gourishankar, V., Optimal control for large-scale systems: a recursive approach, Int. J. syst. sci., 25, 12, 2235-2244, (1994) · Zbl 0820.93003 [5] Gajić, Z.; Borno, I., General transformation for block diagonalization of weakly coupled linear systems composed of N-subsystems, IEEE trans. circ. syst. I, 47, 6, 909-912, (2000) · Zbl 0972.93012 [6] Petrovic, B.; Gajić, Z., The recursive solution of linear quadratic Nash games for weakly interconnected systems, J. optim. theory appl., 56, 3, 463-477, (1988) · Zbl 0622.93005 [7] Gajić, Z.; Petkovski, D.; Shen, X., Singularly perturbed and weakly coupled linear system - A recursive approach, Lecture notes in control and information sciences, vol. 140, (1990), Springer-Verlag Berlin [8] H. Mukaidani, Numerical Computation of Nash Strategy for Large-Scale Systems, in Proc. of 2004 American Control Conference, Boston, June 2004. pp. 5641-5646. [9] Mukaidani, H., Optimal numerical strategy for Nash games of weakly coupled large-scale systems, Dyn. continuous, discrete impulsive syst., ser. B: appl. algorithms, 13, 2, 249-268, (2006) · Zbl 1176.91012 [10] Mukaidani, H., Numerical computation for H2 state feedback control of large-scale systems, Dyn. continuous, discrete impulsive syst., ser. B: appl. algorithms, 12, 2, 281-296, (2005) · Zbl 1083.93015 [11] Zhou, K.; Doyle, J.C.; Glover, K., Robust and optimal control, (1996), Prentice Hall New Jersey · Zbl 0999.49500 [12] Yamamoto, T., A method for finding sharp error bounds for newton’s method under the Kantorovich assumptions, Numer. math., 49, 2-3, 203-220, (1986) · Zbl 0607.65033 [13] Penzl, T., A cyclic low rank Smith method for large sparse Lyapunov equations with applications in model reduction and optimal control, SIAM J. sci. comput., 21, 4, 1401-1418, (1999) · Zbl 0958.65052 [14] Levenberg, N.; Reichel, L., A generalized ADI iterative method, Numer. math., 66, 1, 215-233, (1993) · Zbl 0797.65030 [15] Golub, G.; Nash, S.; Van Loan, C., A hessenberg – schur method for the problem AX+XB=C, IEEE trans. autom. control, 24, 6, 909-913, (1979) · Zbl 0421.65022 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.