×

Closed-form solutions to Sylvester-conjugate matrix equations. (English) Zbl 1198.15013

Summary: Some explicit closed-form solutions of homogeneous and nonhomogeneous Sylvester-conjugate matrix equations are provided in this paper. One of the solutions is expressed in terms of controllability matrices and observability matrices. The proposed approach does not require all the coefficient matrices to be in any canonical forms and the solutions provide a significant degree of freedom which is represented by an arbitrarily chosen parameter matrix. By specifying the solutions of the homogeneous Sylvester-conjugate equation, some new expressions of the solutions of the normal Sylvester, normal Sylvester-conjugate and Sylvester equations are given. This fact reveals that the Sylveter-conjugate matrix equations are a more general class of some previously investigated matrix equations.

MSC:

15A24 Matrix equations and identities

Software:

Algorithm 432
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Dou, A., Method of undetermined coefficients in linear differential systems and the matrix equation \(Y A - A Y = F\), SIAM Journal on Applied Mathematics, 14, 691-696 (1966) · Zbl 0148.06501
[2] Zheng, D. Z., Linear Systems Theory (1990), Tsinghua University Press: Tsinghua University Press Beijing
[3] Zhou, K.; Doyle, J. C.; Glover, K., Robust and Optimal Control (1996), Prentice Hall · Zbl 0999.49500
[4] Levine, W. S.; Athans, M., On the determination of the optimal constant output feedback gains for linear multivariable systems, IEEE Transactions on Automatic Control, AC-15, 1, 44-48 (1970)
[5] Dynamics Systems Control: Linear Systems Analysis and Synthesis (1988), Wiley: Wiley New York
[6] Persidskii, S. K., One application of Lyapunov’s matrix equation, Journal of Mathematical Sciences, 90, 6, 2510-2520 (1998)
[7] Roth, W. E., The equations \(A X - Y B = C\) and \(A X - X B = C\) in matrices, Proceedings of the American Mathematical Society, 3, 392-396 (1952) · Zbl 0047.01901
[8] Huang, L.; Liu, J., The extension of Roth’s theorem for matrix equations over a ring, Linear Algebra and its Applications, 259, 229-235 (1997) · Zbl 0880.15016
[9] Jameson, A., Solutions of the equation \(A X - X B = C\) by inversion of an \(M \times M\) or \(N \times N\) matrix, SIAM Journal on Applied Mathematics, 16, 1020-1023 (1968) · Zbl 0169.35202
[10] Bartels, R. H.; Stewart, C. W., Solution of the matrix equation \(A X + X B = C\), Communications of the ACM, 15, 9, 820-826 (1972) · Zbl 1372.65121
[11] Kleinman, D. L.; Rao, P. K., Extensions to the Bartels-Stewart algorithm for linear matrix equations, IEEE Transactions on Automatic Control, AC-23, 1, 85-87 (1978) · Zbl 0369.65005
[12] Higham, N. J., Perturbation theory and backward error for \(A X - X B = C\), BIT, 33, 1, 124-136 (1993) · Zbl 0781.65034
[13] Ghavimi, A. R.; Laub, A. J., Backward error, sensitivity, and refinement of computed solutions of algebraic Riccati equations, Numerical Linear Algebra with Applications, 2, 1, 29-49 (1995) · Zbl 0829.65042
[14] Sorensen, D. C.; Zhou, Y., Direct methods for matrix Sylvester and Lyapunov equations, Journal of Applied Mathematics, 6, 277-303 (2003) · Zbl 1028.65039
[15] Hammarling, S. J., Numerical solution of the stable, nonnegative definite Lyapunov equation, IMA Journal of Numerical Analysis, 2, 3, 303-323 (1982) · Zbl 0492.65017
[16] Golub, G. H.; Nash, S.; Loan, C. V., A Hessenberg-Schur method for the problem \(A X + X B = C\), IEEE Transactions on Automatic Control, AC-24, 6, 909-913 (1979) · Zbl 0421.65022
[17] Xiao, C. S.; Feng, Z. M.; Shan, X. M., On the solution of the continuous-time Lyapunov matrix equation in two canonical forms, IEE Proceedings-D, 139, 3, 286-290 (1992) · Zbl 0765.93029
[18] Ding, F.; Liu, P. X.; Ding, J., Iterative solutions of the generalized Sylvester matrix equations by using the hierarchical identification principle, Applied Mathematics and Computation, 197, 41-50 (2008) · Zbl 1143.65035
[19] Ma, E. C., A finite series solution of the matrix equation \(A X - X B = C\), SIAM Journal on Applied Mathematics, 14, 3, 490-495 (1966) · Zbl 0144.27003
[20] Jones, J.; Lew, C., Solutions of the Lyapunov matrix equation \(B X - A X = C\), IEEE Transactions on Automatic Control, AC-27, 2, 464-466 (1982)
[21] Chen, Y.; Xiao, H., The explicit solution of the matrix equation \(A X - X B = C\)—to the memory of Prof. Guo Zhongheng, Applied Mathematics and Mechanics, 16, 12, 1133-1141 (1995)
[22] Lancaster, P., Explicit solutions of linear matrix equations, SIAM Review, 12, 4, 544-566 (1970) · Zbl 0209.06502
[23] Lu, T., Solution of the matrix equation \(A X - X B = C\), Computing, 37, 351-355 (1986)
[24] Navarro, E.; Company, R.; Jodar, L., Bessel matrix differential equations: explicit solutions of initial and two-point boundary value problems, Applicationes Mathematicae, 22, 1, 11-23 (1993) · Zbl 0796.34012
[25] Wu, A. G.; Duan, G. R.; Yu, H. H., On solutions of \(X F - A X = C\) and \(X F - A \overline{X} = C\), Applied Mathematics and Computation, 182, 2, 932-941 (2006) · Zbl 1112.15018
[26] Wu, A. G.; Duan, G. R., Solution to the generalised Sylvester matrix equation \(A V + B W = E V F\), IET Control Theory & Applications, 1, 1, 402-408 (2007)
[27] Hanzon, B., A Faddeev sequence method for solving Lyapunov and Sylvester equations, Linear Algebra and its Applications, 241-243, 401-430 (1996) · Zbl 0859.65038
[28] de Souza, E.; Bhattacharyya, S. P., Controllability, observability and the solution of \(A X - X B = C\), Linear Algebra and its Applications, 39, 167-188 (1981) · Zbl 0468.15012
[29] Smith, P. G., Numerical solution of the matrix equation \(A X + X A^T + B = 0\), IEEE Transactions on Automatic Control, AC-16, 3, 278-279 (1971)
[30] Kim, H. C.; Choi, C. H., Closed-form solution of the continuous-time Lyapunov matrix equation, IEE Proceedings—Control Theory and Applications, 141, 5, 350-356 (1994) · Zbl 0815.93031
[31] Sreeram, V.; Agathoklis, P., Solution of Lyapunov equation with system matrix in companian form, IEE Proceedings-D, 138, 6, 529-534 (1992) · Zbl 0754.34051
[32] Betser, A.; Cohen, N.; Zeheb, E., On solving the Lyapunov and Stein equations for a comapanian matrix, Systems and Control Letters, 25, 211-218 (1995) · Zbl 0877.93043
[33] Mori, T.; Fukuma, N.; Kuwahara, M., Explicit solution and eigenvalue bounds in Lyapunov matrix equation, IEEE Transactions on Automatic Control, AC-31, 7, 656-658 (1986) · Zbl 0608.93034
[34] Horn, R. A.; Johnson, C. R., Matrix Analysis (1990), Cambridge University Press: Cambridge University Press Cambridge · Zbl 0704.15002
[35] Bevis, J. H.; Hall, F. J.; Hartwing, R. E., Consimilarity and the matrix equation \(A \overline{X}- X B = C\), (Current Trends in Matrix Theory. Current Trends in Matrix Theory, Auburn, Ala., 1986 (1987), North-Holland: North-Holland New York), 51-64
[36] Hong, Y. P.; Horn, R. A., A canonical form for matrices under consimilarity, Linear Algebra and its Applications, 102, 143-168 (1988) · Zbl 0657.15008
[37] Bevis, J. H.; Hall, F. J.; Hartwig, R. E., The matrix equation \(A \overline{X}- X B = C\) and its special cases, SIAM Journal on Matrix Analysis and Applications, 9, 3, 348-359 (1988) · Zbl 0655.15013
[38] Jiang, T.; Wei, M., On solutions of the matrix equations \(X - A X B = C\) and \(X - A \overline{X} B = C\), Linear Algebra and its Applications, 367, 225-233 (2003)
[39] Gavin, K. R.; Bhattacharyya, S. P., Robust and well-conditioned eigenstructure assignment via Sylvester’s equation, Optimal Control Application and Methods, 4, 205-212 (1983) · Zbl 0512.93035
[40] Kwon, B. H.; Youn, M. J., Eigenvalue-generalized eigenvector assignment by output feedback, IEEE Transactions on Automatic Control, 32, 5, 417-421 (1987) · Zbl 0611.93030
[41] Shafai, B.; Bhattacharyya, S. P., An algorithm for pole assignment in high order multivariable systems, IEEE Transactions on Automatic Control, 33, 9, 870-876 (1988) · Zbl 0645.93020
[42] A. Varga, Robust pole assignment via Sylvester equation based state feedback parametrization, in: Proceedings of the 2000 IEEE International Symposium on Computer-Aided Control System Design, Alsaka, USA, 2000, pp. 13-18.; A. Varga, Robust pole assignment via Sylvester equation based state feedback parametrization, in: Proceedings of the 2000 IEEE International Symposium on Computer-Aided Control System Design, Alsaka, USA, 2000, pp. 13-18.
[43] Chen, C. T., Linear System and Design (1984), Holt, Rinehart and Winstion: Holt, Rinehart and Winstion NY
[44] Van Dooren, P., Reduced order observers: a new algorithm and proof, Systems and Control Letters, 4, 243-251 (1984) · Zbl 0542.93018
[45] Bischof, C.; Datta, B. N.; Purkyastha, A., A parallel algorithm for the Sylvester observer matrix equation, SIAM Journal on Scientific Computing, 686-698 (1996) · Zbl 0855.65043
[46] B.N. Datta, C. Hetti, Generalized Arnoldi methods for the Sylvester-observer equation and the multi-input pole placement problem, in: Proceedings of the 36th Conference on Decision & Control, San Diego, CA, USA, 1997.; B.N. Datta, C. Hetti, Generalized Arnoldi methods for the Sylvester-observer equation and the multi-input pole placement problem, in: Proceedings of the 36th Conference on Decision & Control, San Diego, CA, USA, 1997.
[47] Carvalho, J.; Datta, K.; Hong, Y., A new block algorithm for full-rank solution of the Sylvester-observer equation, IEEE Transactions on Automatic Control, 48, 12, 2223-2228 (2003) · Zbl 1364.93235
[48] Kautsky, J.; Nichols, N. K.; Van Dooren, P., Robust pole assignment in linear state feedback, International Journal of Control, 41, 5, 1129-1155 (1985) · Zbl 0567.93036
[49] Tsui, C. C., A complete analytical solution to the equation \(T A - F T = L C\) and its applications, IEEE Transactions on Automatic Control, 32, 742-744 (1987) · Zbl 0617.93009
[50] Duan, G. R., Solutions of Sylvester matrix equation \(A V + B W = V F\) and their application to eigenstrucuture assignment in linear systems, IEEE Transactions on Automatic Control, 38, 2, 276-280 (1993)
[51] Zhou, B.; Duan, G. R., An explicit solution to the matrix equation \(A X - X F = B Y\), Linear Algebra and its Applications, 402, 345-366 (2005)
[52] Zhou, B.; Duan, G. R., Parametric solutions to the generalized Sylvester matrix equation \(A X - X F = B Y\) and the regulator equation \(A X - X F = B Y + R\), Asian Journal of Control, 9, 4, 478-483 (2007)
[53] Wu, A. G.; Duan, G. R.; Xue, Y., Kronecker maps and Sylvester-polynomial matrix equations, IEEE Transactions on Automatic Control, 52, 5, 905-910 (2007) · Zbl 1366.93190
[54] Qiu, J.; Jiang, W.; Shi, Y.; Xi, D., Positive solutions for nonlinear \(n\) th-order \(m\)-point boundary value problem with the first derivative, International Journal of Innovative Computing, Information and Control, 5, 8, 2405-2414 (2009)
[55] Zhong, X.; Zhang, T.; Shi, Y., Oscillation and nonoscillation of neutral difference equation with positive and negative coefficients, International Journal of Innovative Computing, Information and Control, 5, 5, 1329-1342 (2009)
[56] Yu, C., Existence and uniqueness of the solution for FM-BEM based on GMRES(m) algorithm, ICIC Express Letters, 2, 1, 89-93 (2008)
[57] Liu, J.; Yu, C.; Chen, Y.; Li, Xia, Computational formulations for the fundamental solution and kernel functions of elasto-plastic FM-BEM in spherical coordinate system, ICIC Express Letters, 2, 2, 207-212 (2008)
[58] Hou, S. H., A simple proof of the Leverrier-Faddeev characteristical polynomial algorithm, SIAM Review, 40, 3, 706-709 (1998) · Zbl 0912.65035
[59] P. Misra, E. Quintana, P.M. Van Dooren, Numerically reliable computation of characteristic polynomials, in: Proceedings of 2005 American Control Conference, vol. 6, 1995, pp. 4025-4029.; P. Misra, E. Quintana, P.M. Van Dooren, Numerically reliable computation of characteristic polynomials, in: Proceedings of 2005 American Control Conference, vol. 6, 1995, pp. 4025-4029.
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.