메뉴 건너뛰기




Volumn 28, Issue 1, 2006, Pages 51-83

Solving stable Sylvester equations via rational iterative schemes

Author keywords

Halley's method; Image restoration; Matrix sign function; Model reduction; Newton iteration; Newton Schulz iteration; Parallel algorithms; Sylvester equation

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; IMAGE RECONSTRUCTION; ITERATIVE METHODS; MATHEMATICAL MODELS; NUMERICAL ANALYSIS; PARALLEL ALGORITHMS; PROGRAM PROCESSORS;

EID: 33746621687     PISSN: 08857474     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10915-005-9007-2     Document Type: Article
Times cited : (32)

References (47)
  • 1
    • 23944490373 scopus 로고    scopus 로고
    • CAREX - A collection of benchmark examples for continuous-time algebraic Riccati equations (version 2.0)
    • Abels J., and Benner, P. (1999). CAREX - a collection of benchmark examples for continuous-time algebraic Riccati equations (version 2.0). SLICOT Working Note 1999-14. Available from http://www.win.tue.nl/niconet/NIC2/reports. html.
    • (1999) SLICOT Working Note 1999-14
    • Abels, J.1    Benner, P.2
  • 2
    • 0026131309 scopus 로고
    • Model order reduction via real schur-form decomposition
    • Aldhaheri, R. (1991). Model order reduction via real Schur-form decomposition. Int. J. Control, 53(3), 709-716.
    • (1991) Int. J. Control , vol.53 , Issue.3 , pp. 709-716
    • Aldhaheri, R.1
  • 5
    • 0001175581 scopus 로고
    • Design of a parallel nonsymmetric eigenroutine toolbox, Part I
    • R. S. et al., (eds.), SIAM, Philadelphia, PA, 391-398, Tech. Report CSD-92-718, Computer Science Division, University of California, Berkeley, CA
    • Bai, Z., and Demmel, J. (1993). Design of a parallel nonsymmetric eigenroutine toolbox, Part I. In R. S. et al., (eds.), Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing, SIAM, Philadelphia, PA, 391-398, See also: Tech. Report CSD-92-718, Computer Science Division, University of California, Berkeley, CA.
    • (1993) Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing
    • Bai, Z.1    Demmel, J.2
  • 6
    • 84976855597 scopus 로고
    • Solution of the matrix equation AX + XB = C: Algorithm 432
    • Bartels, R., and Stewart, G. (1972). Solution of the matrix equation AX + XB = C: Algorithm 432. Comm. ACM, 15, 820-826.
    • (1972) Comm. ACM , vol.15 , pp. 820-826
    • Bartels, R.1    Stewart, G.2
  • 7
    • 0016580689 scopus 로고
    • A new solution method for the Lyapunov matrix equations
    • Beavers, A. N., and Denman, E. D. (1975). A new solution method for the Lyapunov matrix equations. SIAM J. Appl. Math. 29, 416-421.
    • (1975) SIAM J. Appl. Math. , vol.29 , pp. 416-421
    • Beavers, N.A.1    Denman, E.D.2
  • 9
    • 0032644014 scopus 로고    scopus 로고
    • Parallel distributed solvers for large stable generalized Lyapunov equations
    • Benner, P., Claver, v, and Quintana-Orti, E. (1999). Parallel distributed solvers for large stable generalized Lyapunov equations. Parallel Processing Lett., 9(1), 147-158.
    • (1999) Parallel Processing Lett. , vol.9 , Issue.1 , pp. 147-158
    • Benner, P.1    Claver, V.2    Quintana-Orti, E.3
  • 10
    • 0033412866 scopus 로고    scopus 로고
    • Solving stable generalized Lyapunov equations with the matrix sign function
    • Benner, P., and Quintana-Orti, E. (1999). Solving stable generalized Lyapunov equations with the matrix sign function. Numer. Algorithms 20(1), 75-100.
    • (1999) Numer. Algorithms , vol.20 , Issue.1 , pp. 75-100
    • Benner, P.1    Quintana-Orti, E.2
  • 11
    • 0242281707 scopus 로고    scopus 로고
    • Numerical solution of discrete stable linear matrix equations on multicomputers
    • Bemier, P., Quintana-Ortí, E., and Quintana-Ortí, G. (2002). Numerical solution of discrete stable linear matrix equations on multicomputers. Parallel Algorithms and Appl. 17(1), 127-146.
    • (2002) Parallel Algorithms and Appl. , vol.17 , Issue.1 , pp. 127-146
    • Bemier, P.1    Quintana-Ortí, E.2    Quintana-Ortí, G.3
  • 13
    • 38249038136 scopus 로고
    • Solving the algebraic Riccati equation with the matrix sign function
    • Byers, R. (1987). Solving the algebraic Riccati equation with the matrix sign function. Linear Algebra Appl. 85, 267-279.
    • (1987) Linear Algebra Appl. , vol.85 , pp. 267-279
    • Byers, R.1
  • 14
    • 0030532987 scopus 로고    scopus 로고
    • Application of ADI iterative methods to the restoration of noisy images
    • Calvetti, D., and Reichel, L. (1996). Application of ADI iterative methods to the restoration of noisy images. SIAM J. Matrix Anal. Appl. 17, 165-186.
    • (1996) SIAM J. Matrix Anal. Appl. , vol.17 , pp. 165-186
    • Calvetti, D.1    Reichel, L.2
  • 15
    • 0002170151 scopus 로고
    • Rank revealing QR factorizations
    • Chan, T. (1987). Rank revealing QR factorizations. Linear Algebra Appl. 88/89, 67-82.
    • (1987) Linear Algebra Appl. , vol.88-89 , pp. 67-82
    • Chan, T.1
  • 16
    • 0025464791 scopus 로고
    • Efficient matrix-valued algorithms for solving stiff Riccati differential equations
    • Choi, C., and Laub, A. (1990). Efficient matrix-valued algorithms for solving stiff Riccati differential equations. IEEE Trans. Automat. Control, 35, 770-776.
    • (1990) IEEE Trans. Automat. Control , vol.35 , pp. 770-776
    • Choi, C.1    Laub, A.2
  • 18
    • 33646669861 scopus 로고
    • Transformation method for solving linear BVPs. I: Theoretical aspects
    • Dieci, L., Osborne, M., and Russell, R., (1988). A. Riccati, transformation method for solving linear BVPs. I: Theoretical aspects. SIAM J. Numer. Anal. 25(5), 1055-1073.
    • (1988) SIAM J. Numer. Anal. , vol.25 , Issue.5 , pp. 1055-1073
    • Dieci, L.1    Osborne, M.2    Russell, R.3    Riccati, A.4
  • 21
    • 84976797154 scopus 로고
    • Improving the efficiency of matrix operations in the numerical solution of stiff ordinary differential equations
    • Enright, W (1978). Improving the efficiency of matrix operations in the numerical solution of stiff ordinary differential equations. ACM Trans. Math. Soft. 4, 127-136.
    • (1978) ACM Trans. Math. Soft. , vol.4 , pp. 127-136
    • Enright, W.1
  • 22
    • 0000860359 scopus 로고
    • Methods for the solution of AXD - BXC = e and its application in the numerical solution of implicit ordinary differential equations
    • Epton, M. (1980). Methods for the solution of AXD - BXC = E and its application in the numerical solution of implicit ordinary differential equations. BIT, 20, 341-345.
    • (1980) BIT , vol.20 , pp. 341-345
    • Epton, M.1
  • 23
    • 33746640992 scopus 로고
    • On a fundamental property of the cross-Gramian matrix
    • CAS-31(5)
    • Fernando, K., and Nicholson, H. (1984). On a fundamental property of the cross-Gramian matrix. IEEE Trans. Circuits Syst. CAS-31(5), 504-505.
    • (1984) IEEE Trans. Circuits Syst. , pp. 504-505
    • Fernando, K.1    Nicholson, H.2
  • 24
    • 0003299075 scopus 로고
    • Lyapunov matrix equation in system stability and control
    • Academic Press, San Diego, CA
    • Gajić, Z., and Qureshi, M. (1995). Lyapunov Matrix Equation in System Stability and Control. Math, in Science and Engineering. Academic Press, San Diego, CA.
    • (1995) Math, in Science and Engineering
    • Gajić, Z.1    Qureshi, M.2
  • 25
    • 0026402189 scopus 로고
    • Parallel algorithms for algebraic Riccati equations
    • Gardiner, J., and Laub, A. (1991). Parallel algorithms for algebraic Riccati equations. Int. J. Control, 54(6), 1317-1333.
    • (1991) Int. J. Control , vol.54 , Issue.6 , pp. 1317-1333
    • Gardiner, J.1    Laub, A.2
  • 26
    • 0026874674 scopus 로고
    • Solution of the Sylvester matrix equation AXB + CXD = e
    • Gardiner, J., Laub, A., Amato, J., and Moler, C. (1992). Solution of the Sylvester matrix equation AXB + CXD = E. ACM Trans. Math. Soft, 18, 223-231.
    • (1992) ACM Trans. Math. Soft , vol.18 , pp. 223-231
    • Gardiner, J.1    Laub, A.2    Amato, J.3    Moler, C.4
  • 28
  • 29
    • 12444323471 scopus 로고    scopus 로고
    • On reducing TLB misses in matrix multiplication
    • Department of Computer Sciences, The University of Texas at Austin
    • Goto, K., and van de Geijn, R. (2002). On reducing TLB misses in matrix multiplication. FLAME Working Note 9, Department of Computer Sciences, The University of Texas at Austin, http://www.cs.utexas.edu/users/flame.
    • (2002) FLAME Working Note , vol.9
    • Goto, K.1    Van De Geijn, R.2
  • 30
    • 10044281868 scopus 로고    scopus 로고
    • Existence of a low rank or H-matrix approximant to the solution of a Sylvester equation
    • Grasedyck, L. (2004). Existence of a low rank or H-matrix approximant to the solution of a Sylvester equation. Numer. Lin. Alg. Appl. 11, 371-389.
    • (2004) Numer. Lin. Alg. Appl. , vol.11 , pp. 371-389
    • Grasedyck, L.1
  • 33
    • 0001050260 scopus 로고
    • Methodus nova, accurata & facilis inveniendi radices aequationum quarumcumque generaliter, sine praevia reductione
    • Halley, E. (1694). Methodus nova, accurata & facilis inveniendi radices aequationum quarumcumque generaliter, sine praevia reductione. Philos. Trans. R Soc. Lond. 18, 136-148.
    • (1694) Philos. Trans. R Soc. Lond. , vol.18 , pp. 136-148
    • Halley, E.1
  • 34
    • 0001722652 scopus 로고    scopus 로고
    • Parallelizing the QR algorithm for the unsymmetric algebraic eigenvalue problem: Myths and reality
    • Henry, G., and van de Geijn, R. (1997). Parallelizing the QR algorithm for the unsymmetric algebraic eigenvalue problem: myths and reality. SIAM J. Sci. Comput. 17, 870-883.
    • (1997) SIAM J. Sci. Comput. , vol.17 , pp. 870-883
    • Henry, G.1    Van De Geijn, R.2
  • 35
    • 0001692403 scopus 로고
    • Computing the polar decomposition-with applications
    • Higham, N. (1986). Computing the polar decomposition-with applications. SIAM J. Sci. Statist. Comput. 7, 1160-1174.
    • (1986) SIAM J. Sci. Statist. Comput. , vol.7 , pp. 1160-1174
    • Higham, N.1
  • 36
    • 33746583255 scopus 로고
    • The numerical solution of the matrix equation XA + AY = F
    • Hoskins, W., Meek, D., and Walton, D. (1977). The numerical solution of the matrix equation XA + AY = F. BIT 17, 184-190.
    • (1977) BIT , vol.17 , pp. 184-190
    • Hoskins, W.1    Meek, D.2    Walton, D.3
  • 37
    • 38249011246 scopus 로고
    • Krylov-subspace methods for the Sylvester equation
    • Hu, D., and Reichel, L. (1992). Krylov-subspace methods for the Sylvester equation. Linear Algebra Appl. 172, 283-313.
    • (1992) Linear Algebra Appl. , vol.172 , pp. 283-313
    • Hu, D.1    Reichel, L.2
  • 38
    • 0030092417 scopus 로고    scopus 로고
    • Lapack-style algorithms and software for solving the generalized Sylvester equation and estimating the separation between regular matrix pairs
    • Kagström, B., and Poromaa, P. (1996). Lapack-style algorithms and software for solving the generalized Sylvester equation and estimating the separation between regular matrix pairs. ACM Trans. Math. Soft. 22(1), 78-103.
    • (1996) ACM Trans. Math. Soft. , vol.22 , Issue.1 , pp. 78-103
    • Kagström, B.1    Poromaa, P.2
  • 39
    • 0001246152 scopus 로고
    • Rational iterative methods for the matrix sign function
    • Kenney, C., and Laub, A. (1991). Rational iterative methods for the matrix sign function. SIAM J. Matrix Anal. Appl. 12, 273-291.
    • (1991) SIAM J. Matrix Anal. Appl. , vol.12 , pp. 273-291
    • Kenney, C.1    Laub, A.2
  • 42
    • 0019069037 scopus 로고
    • Linear model reduction and solution of the algebraic Riccati equation by use of the sign function
    • Technical Report No. TR-13, CUED/B-Control, Cambridge University, Engineering Department, 1971
    • Roberts, J. (1980). Linear model reduction and solution of the algebraic Riccati equation by use of the sign function. Int. J. Control, 32, 677-687, (Reprint of Technical Report No. TR-13, CUED/B-Control, Cambridge University, Engineering Department, 1971).
    • (1980) Int. J. Control , vol.32 , pp. 677-687
    • Roberts, J.1
  • 43
    • 84979324358 scopus 로고
    • Iterative berechnung der reziproken matrix
    • InGerman
    • Schulz, G. (1993), Iterative berechnung der reziproken matrix. Z. Angew. Math. Mech. 13, 57-59. In German.
    • (1993) Z. Angew. Math. Mech. , vol.13 , pp. 57-59
    • Schulz, G.1
  • 45
    • 33746599982 scopus 로고    scopus 로고
    • Evaluation of the linear matrix equation solvers in SLICOT
    • Slowik, M., Benner, P., and Sima, V. (2004). Evaluation of the linear matrix equation solvers in SLICOT. SLICOT Working Note 2004-1 Available from http://www.win.tue.nl/niconet/NIC2/reports.html.
    • (2004) SLICOT Working Note 2004-1
    • Slowik, M.1    Benner, P.2    Sima, V.3
  • 47
    • 38249030580 scopus 로고
    • Iterative solution of the lyapunov matrix equation
    • Wachspress, E. (1988). Iterative solution of the Lyapunov matrix equation. Appl. Math. Lett. 107, 87-90.
    • (1988) Appl. Math. Lett. , vol.107 , pp. 87-90
    • Wachspress, E.1


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