메뉴 건너뛰기




Volumn 36, Issue 8, 2012, Pages 3545-3554

LSQR iterative method for generalized coupled Sylvester matrix equations

Author keywords

Generalized coupled Sylvester matrix equations; LSQR algorithm; Minimum Frobenius norm solutions

Indexed keywords

APPROXIMATE SOLUTION; COUPLED SYLVESTER MATRIX EQUATIONS; FROBENIUS NORM; LEAST SQUARE; LEAST SQUARES SOLUTIONS; NUMERICAL EXAMPLE; SYMMETRIC MATRICES;

EID: 84859827907     PISSN: 0307904X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apm.2011.10.030     Document Type: Article
Times cited : (55)

References (28)
  • 1
    • 48149092968 scopus 로고    scopus 로고
    • An iterative algorithm for the reflexive solutions of the generalized coupled Sylvester matrix equations and its optimal approximation
    • Dehghan M., Hajarian M. An iterative algorithm for the reflexive solutions of the generalized coupled Sylvester matrix equations and its optimal approximation. Appl. Math. Comput. 2008, 202:571-588.
    • (2008) Appl. Math. Comput. , vol.202 , pp. 571-588
    • Dehghan, M.1    Hajarian, M.2
  • 2
    • 70350622178 scopus 로고    scopus 로고
    • An iterative method for solving the generalized coupled Sylvester matrix equations over generalized bisymmetric matices
    • Dehghan M., Hajarian M. An iterative method for solving the generalized coupled Sylvester matrix equations over generalized bisymmetric matices. Appl. Math. Model. 2010, 34:639-654.
    • (2010) Appl. Math. Model. , vol.34 , pp. 639-654
    • Dehghan, M.1    Hajarian, M.2
  • 3
    • 77949484741 scopus 로고    scopus 로고
    • An iterative method for (R,S)-symmetric solution of matrix equation AXB=C
    • Liang M.L., Dai L.F., Wang S.F. An iterative method for (R,S)-symmetric solution of matrix equation AXB=C. SCI. Magna 2008, 4:60-70.
    • (2008) SCI. Magna , vol.4 , pp. 60-70
    • Liang, M.L.1    Dai, L.F.2    Wang, S.F.3
  • 5
    • 0028462341 scopus 로고
    • ∞ design of general multirate sampled-data control systems
    • ∞ design of general multirate sampled-data control systems. Automatica 1994, 30:1139-1152.
    • (1994) Automatica , vol.30 , pp. 1139-1152
    • Chen, T.1    Qiu, L.2
  • 6
    • 0033100301 scopus 로고    scopus 로고
    • ∞ suboptimal controllers and the minimum entropy controller
    • ∞ suboptimal controllers and the minimum entropy controller. IEEE Trans. Automat. Control 1999, 44:537-550.
    • (1999) IEEE Trans. Automat. Control , vol.44 , pp. 537-550
    • Qiu, L.1    Chen, T.2
  • 7
    • 0019689365 scopus 로고
    • Explicit solutions of the discrete-time Lyapunov matrix equation and Kalman-Yakubovich equations
    • Bitmead R. Explicit solutions of the discrete-time Lyapunov matrix equation and Kalman-Yakubovich equations. IEEE Trans. Autom. Control 1981, AC-26:1291-1294.
    • (1981) IEEE Trans. Autom. Control , vol.AC26 , pp. 1291-1294
    • Bitmead, R.1
  • 8
    • 0015300240 scopus 로고
    • A technique for solving the extended discrete Lyapunov matrix equation
    • Heinen J. A technique for solving the extended discrete Lyapunov matrix equation. IEEE Trans. Autom. Control 1972, 17:156-157.
    • (1972) IEEE Trans. Autom. Control , vol.17 , pp. 156-157
    • Heinen, J.1
  • 9
    • 0018480844 scopus 로고
    • On the solutions of the discrete-time Lyapunov matrix equation controllable canonical form
    • Bitmead R., Weiss H. On the solutions of the discrete-time Lyapunov matrix equation controllable canonical form. IEEE Trans. Autom. Control 1979, AC-24:481-482.
    • (1979) IEEE Trans. Autom. Control , vol.AC24 , pp. 481-482
    • Bitmead, R.1    Weiss, H.2
  • 10
    • 0018721357 scopus 로고
    • A Hessenbeg-Schur method for the matrix problem AX+XB=C
    • Golub G.H., Nash S., Van Loan C.F. A Hessenbeg-Schur method for the matrix problem AX+XB=C. IEEE Trans. Autom. Control 1979, AC-24:909-913.
    • (1979) IEEE Trans. Autom. Control , vol.AC24 , pp. 909-913
    • Golub, G.H.1    Nash, S.2    Van Loan, C.F.3
  • 12
    • 19044380439 scopus 로고    scopus 로고
    • Recursive blocked algorithms for solving triangular systems-Part I: One-sided and coupled Sylvester-type matrix equations
    • Jonsson I., Kägström B. Recursive blocked algorithms for solving triangular systems-Part I: One-sided and coupled Sylvester-type matrix equations. ACM Trans. Math. Software 2002, 28:392-415.
    • (2002) ACM Trans. Math. Software , vol.28 , pp. 392-415
    • Jonsson, I.1    Kägström, B.2
  • 13
    • 19044400922 scopus 로고    scopus 로고
    • Recursive blocked algorithms for solving triangular systems-Part II: Two-sided and generalized Sylvester and Lyapunov matrix equations
    • Jonsson I., Kägström B. Recursive blocked algorithms for solving triangular systems-Part II: Two-sided and generalized Sylvester and Lyapunov matrix equations. ACM Trans. Math. Software 2002, 28:416-435.
    • (2002) ACM Trans. Math. Software , vol.28 , pp. 416-435
    • Jonsson, I.1    Kägström, B.2
  • 14
    • 26244448321 scopus 로고    scopus 로고
    • Gradient based iterative algorithms for solving a class of matrix equations
    • Ding F., Chen T. Gradient based iterative algorithms for solving a class of matrix equations. IEEE Trans. Autom. Control 2005, 50:1216-1221.
    • (2005) IEEE Trans. Autom. Control , vol.50 , pp. 1216-1221
    • Ding, F.1    Chen, T.2
  • 15
    • 10444247504 scopus 로고    scopus 로고
    • Iterative least squares solutions of coupled Sylvester matrix equations
    • Ding F., Chen T. Iterative least squares solutions of coupled Sylvester matrix equations. Systems Control Lett. 2005, 54:95-107.
    • (2005) Systems Control Lett. , vol.54 , pp. 95-107
    • Ding, F.1    Chen, T.2
  • 16
    • 33751185751 scopus 로고    scopus 로고
    • On iterative solution of general coupled matrix equations
    • Ding F., Chen T. On iterative solution of general coupled matrix equations. SIAM J. Control Optim. 2006, 44:2269-2284.
    • (2006) SIAM J. Control Optim. , vol.44 , pp. 2269-2284
    • Ding, F.1    Chen, T.2
  • 17
    • 22144434326 scopus 로고    scopus 로고
    • Hierarchical gradient-based identification of multivariable discrete-time systems
    • Ding F., Chen T. Hierarchical gradient-based identification of multivariable discrete-time systems. Automatica 2005, 41:315-325.
    • (2005) Automatica , vol.41 , pp. 315-325
    • Ding, F.1    Chen, T.2
  • 18
    • 16244397443 scopus 로고    scopus 로고
    • Hierarchical least squares identification methods for multivarible systems
    • Ding F., Chen T. Hierarchical least squares identification methods for multivarible systems. IEEE Trans. Autom. Control 2005, AC-50:397-402.
    • (2005) IEEE Trans. Autom. Control , vol.AC50 , pp. 397-402
    • Ding, F.1    Chen, T.2
  • 19
    • 61449108996 scopus 로고    scopus 로고
    • Gradient based iterative algorithm for solving coupled matrix equations
    • Zhou B., Duan G.R., Li Z.Y. Gradient based iterative algorithm for solving coupled matrix equations. Systems Control Lett. 2009, 58:327-333.
    • (2009) Systems Control Lett. , vol.58 , pp. 327-333
    • Zhou, B.1    Duan, G.R.2    Li, Z.Y.3
  • 20
    • 58149346165 scopus 로고    scopus 로고
    • Weighted least squares solutions to general coupled Sylvester matrix equations
    • Zhou B., Li Z.Y., Duan G.R., Wang Y. Weighted least squares solutions to general coupled Sylvester matrix equations. J. Comput. Appl. Math. 2009, 224:759-776.
    • (2009) J. Comput. Appl. Math. , vol.224 , pp. 759-776
    • Zhou, B.1    Li, Z.Y.2    Duan, G.R.3    Wang, Y.4
  • 21
    • 73149119779 scopus 로고    scopus 로고
    • The general coupled matrix equations over generalized bisymmetric matrices
    • Dehghan M., Hajarian M. The general coupled matrix equations over generalized bisymmetric matrices. Linear Alg. Appl. 2010, 432:1531-1552.
    • (2010) Linear Alg. Appl. , vol.432 , pp. 1531-1552
    • Dehghan, M.1    Hajarian, M.2
  • 22
    • 77649337553 scopus 로고    scopus 로고
    • An efficient algorithm for solving general coupled matrix equations and its application
    • Dehghan M., Hajarian M. An efficient algorithm for solving general coupled matrix equations and its application. Math. Comput. Model. 2010, 51:1118-1134.
    • (2010) Math. Comput. Model. , vol.51 , pp. 1118-1134
    • Dehghan, M.1    Hajarian, M.2
  • 24
    • 77952198885 scopus 로고    scopus 로고
    • An iterative algorithm for a least squares solution of a matrix equation
    • Wang M.H., Wei M.S., Feng Y. An iterative algorithm for a least squares solution of a matrix equation. Int. J. Comput. Math. 2010, 87:1289-1298.
    • (2010) Int. J. Comput. Math. , vol.87 , pp. 1289-1298
    • Wang, M.H.1    Wei, M.S.2    Feng, Y.3
  • 25
    • 77954626059 scopus 로고    scopus 로고
    • A matrix LSQR iterative method to solve matrix equation AXB=C
    • Peng Z.Y. A matrix LSQR iterative method to solve matrix equation AXB=C. Int. J. Comput. Math. 2010, 87:1820-1830.
    • (2010) Int. J. Comput. Math. , vol.87 , pp. 1820-1830
    • Peng, Z.Y.1
  • 26
    • 0039943513 scopus 로고
    • LSQR: an algorithm for sparse linear equations and sparse least squares
    • Paige C.C., Saunders A. LSQR: an algorithm for sparse linear equations and sparse least squares. ACM Trans. Math. Software 1982, 8:43-71.
    • (1982) ACM Trans. Math. Software , vol.8 , pp. 43-71
    • Paige, C.C.1    Saunders, A.2
  • 27
    • 0000288016 scopus 로고
    • Calculating the singular values and pseudoinverse of a matrix
    • Golub G.H., Kahan W. Calculating the singular values and pseudoinverse of a matrix. SIAM J. Numer. Anal. 1965, 2:205-224.
    • (1965) SIAM J. Numer. Anal. , vol.2 , pp. 205-224
    • Golub, G.H.1    Kahan, W.2
  • 28
    • 33746253645 scopus 로고    scopus 로고
    • Global least squares method (Gl-LSQR) for solving general linear systems with several right-hand sides
    • Toutounian F., Karimi S. Global least squares method (Gl-LSQR) for solving general linear systems with several right-hand sides. Appl. Math. Comput. 2006, 178:452-460.
    • (2006) Appl. Math. Comput. , vol.178 , pp. 452-460
    • Toutounian, F.1    Karimi, S.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.