Solution of the Sylvester matrix equation AXBT + CXDT = E
暂无分享,去创建一个
Alan J. Laub | Cleve B. Moler | Judith D. Gardiner | James J. Amato | A. Laub | C. Moler | J. Gardiner | J. J. Amato
[1] Peter Lancaster,et al. The theory of matrices , 1969 .
[2] Richard H. Bartels,et al. Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4] , 1972, Commun. ACM.
[3] G. Stewart,et al. An Algorithm for Generalized Matrix Eigenvalue Problems. , 1973 .
[4] G. Golub,et al. A Hessenberg-Schur method for the problem AX + XB= C , 1979 .
[5] J. H. Wilkinson,et al. AN ESTIMATE FOR THE CONDITION NUMBER OF A MATRIX , 1979 .
[6] Gene H. Golub,et al. Matrix computations , 1983 .
[7] A. Laub,et al. Generalized eigenproblem algorithms and software for algebraic Riccati equations , 1984, Proceedings of the IEEE.
[8] R. Byers. A LINPACK-style condition estimator for the equation AX-XB^{T} = C , 1984 .
[9] G. Hewer,et al. The sensitivity of the stable Lyapunov equation , 1987, 26th IEEE Conference on Decision and Control.
[10] K. Chu. The solution of the matrix equations AXB−CXD=E AND (YA−DZ,YC−BZ)=(E,F) , 1987 .
[11] Nicholas J. Higham,et al. FORTRAN codes for estimating the one-norm of a real or complex matrix, with applications to condition estimation , 1988, TOMS.
[12] N. Higham. Algorithm 674: Fortran codes for estimating the one-norm of a real or complex matrix, with applications to condition estimation , 1989, TOMS.
[13] B. Kågström,et al. Generalized Schur methods with condition estimators for solving the generalized Sylvester equation , 1989 .
[14] N. Higham,et al. Large growth factors in Gaussian elimination with pivoting , 1989 .
[15] L. Trefethen,et al. Average-case stability of Gaussian elimination , 1990 .
[16] Alan J. Laub,et al. Algorithm 705; a FORTRAN-77 software package for solving the Sylvester matrix equation AXBT + CXDT = E , 1992, TOMS.