Condition Numbers of the Generalized Sylvester Equation

This note is devoted to the perturbation analysis for the generalized Sylvester equations (AX-YB, DX-YE)= (C, F), which have some important applications in control and system theory. Expressions and upper bounds for normwise, mixed, and componentwise condition numbers are presented. The results are illustrated by numerical examples.

[1]  Israel Koltracht,et al.  Mixed componentwise and structured condition numbers , 1993 .

[2]  Feng Ding,et al.  Iterative least-squares solutions of coupled Sylvester matrix equations , 2005, Syst. Control. Lett..

[3]  G. Stewart.  Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems , 1973 .

[4]  Bo Kågström,et al.  LAPACK-style algorithms and software for solving the generalized Sylvester equation and estimating the separation between regular matrix pairs , 1994, TOMS.

[5]  B. Datta.  Numerical methods for linear control systems : design and analysis , 2004 .

[6]  Nicholas J. Higham,et al.  Perturbation Theory And Backward Error For , 1993 .

[7]  Yimin Wei,et al.  A new projection method for solving large Sylvester equations , 2007 .

[8]  Yimin Wei,et al.  On mixed and componentwise condition numbers for Moore-Penrose inverse and linear least squares problems , 2006, Math. Comput..

[9]  G. Stewart,et al.  Matrix Perturbation Theory , 1990 .

[10]  G. Golub,et al.  A Hessenberg-Schur method for the problem AX + XB= C , 1979 .

[11]  Charles R. Johnson,et al.  Topics in Matrix Analysis , 1991 .

[12]  Isak Jonsson,et al.  Recursive blocked algorithms for solving triangular systems—Part I: one-sided and coupled Sylvester-type matrix equations , 2002, TOMS.

[13]  V. Mehrmann,et al.  Perturbation theory for matrix equations , 2003, IEEE Transactions on Automatic Control.

[14]  B. Kågström,et al.  A Direct Method for Reordering Eigenvalues in the Generalized Real Schur form of a Regular Matrix Pair (A, B) , 1993 .

[15]  Richard H. Bartels,et al.  Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4] , 1972, Commun. ACM.

[16]  Volker Mehrmann,et al.  Balanced Truncation Model Reduction for Large-Scale Systems in Descriptor Form , 2005 .

[17]  K. Chu.  The solution of the matrix equations AXB−CXD=E AND (YA−DZ,YC−BZ)=(E,F) , 1987 .

[18]  J. Doyle,et al.  Robust and optimal control , 1995, Proceedings of 35th IEEE Conference on Decision and Control.

[19]  Athanasios C. Antoulas,et al.  Approximation of Large-Scale Dynamical Systems , 2005, Advances in Design and Control.

[20]  Bo Kågström,et al.  A Perturbation Analysis of the Generalized Sylvester Equation $( AR - LB,DR - LE ) = ( C,F )$ , 1994, SIAM J. Matrix Anal. Appl..

[21]  Isak Jonsson,et al.  Recursive blocked algorithms for solving triangular systems—Part II: two-sided and generalized Sylvester and Lyapunov matrix equations , 2002, TOMS.

[22]  B. Kågström,et al.  Generalized Schur methods with condition estimators for solving the generalized Sylvester equation , 1989 .