The Matrix Sign Function

IEEE Transactions on Automatic Control

Volumn 40, Issue 8, 1995, Pages 1330-1348

  Kenney, Charles S ^a   Laub, Alan J ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; CONTROL THEORY; EIGENVALUES AND EIGENFUNCTIONS; ESTIMATION;

CONDITION THEORY; EIGENDECOMPOSITION; MATRIX SIGN FUNCTION;

MATRIX ALGEBRA;

EID: 0029358151     PISSN: 00189286     EISSN: 15582523     Source Type: Journal    
DOI: 10.1109/9.402226     Document Type: Article

References (124)

1. A. A. Abramov, “On the boundary conditions at a singular point for linear ordinary differential equations, “U.S.S.R. Computational Mathematics and Mathematical Physics, vol. 11, pp. 363-367, 1971.
2. “Numerical some theory of stability, “U.S.S.R. Computational Mathematics and Mathematical Physics, vol. 6, pp. 1-6, 1984.
3. N. I. Akhiezer, Lectures on Approximation Theory. Moscow: Nauka, 1965 (in Russian).
4. —,Elements of the Theory of Elliptic Functions. Moscow: Nauka, 1970 (in Russian).
5. F. A. Aliev, B. A. Bordyug, and V. B. Larin, “Discrete generalized agebraic Riccati equations and polynomial matrix factorization, “Sys. Contr. Lett., vol. 18, pp. 49-59, 1992.
6. Z. Bai, J. Demmel, and M. Gu, “Inverse free parallel spectral divide and conquer algorithms for nonsymmetric eigenproblems, “Dept. Mathematics, Univ. Kentucky, Tech. Rep. 94-01, Feb. 1994.
7. Z. Bai and J. W. Demmel, “Design of a parallel nonsymmetric eigenroutine toolbox, part I, “in Proc. Sixth SIAM Conf. Parallel Processing for Scientific Computing, Vol. I, Philadelphia, PA, Dec. 1993, pp. 391-398.
8. V. A. Bailey, “Prodigious calculation, “Austral. J. Sci., vol. 3 pp. 78-80, 1941.
9. L. Balzer, “Accelerated convergence of the matrix sign function, “Int. J. Contr., vol. 32, pp. 1057-1078, 1980.
10. A. Y. Barraud, “Investigation autour de la fonction signe d' ‘une matrice—application a 1’ equation de Riccati, “R.A.I.R.O. Automatique/Systems Analysis and Control, vol. 13, pp. 335-368, 1979.
11. “The numerical solution of ATQ+QA= -C, “EEE Trans. Automat. Contr., vol. AC-24, pp. 671-672, 1979.
12. Produit etoile et fonction signe de matrice—application a l’equation de Riccati dans le cas discret, “R.A.I.R.O. Automatique/Syst. Anal. Contr., vol. 14, pp. 55-85, 1980.
13. A. N. Beavers and E. D. Denman, “A computational method for eigenvalues and eigenvectors of a matrix with real eigenvalues, “Numer. Math., pp. 389-396, 1973.
14. “Asymptotic solutions to the matrix Riccati equation, “Math. Biosci., vol. 20, pp. 339-344, 1974.
15. “A new similarity transformation method for eigenvalues and eigenvectors, “Math. Biosci., vol. 20, pp. 143-169, 1974.
16. A new solution method for quadratic matrix equations, “Biosci., vol. 20, pp. 135-143, 1974.
17. “A new solution method for the Lyapunov matrix SIAM J. Appl. Math., vol. 29, pp. 416-421, 1975.
18. G. J. Bierman, “Computational aspects of the matrix sign function solution to the ARE, “in Proc. 23rd IEEE Conf. Decis. Contr., Las Vegas, NV, Dec. 1984, pp. 514-519.
19. A. Björck and C. Bowie, “An iterative algorithm for computing the best estimate of an orthogonal matrix, “SIAM J. Numer. Anal., vol. 8, pp. 358-364, 1971.
20. A. Ya. Bulgakov, “An calculable parameter property of a system of linear differential equations with constant coefficients, “Siberian Math. J., vol. 21, pp. 339-347, 1980.
21. “An estimate of the Green matrix and the continuity of the dichotomy parameter, “Siberian Math. J., vol. 30, pp. 139-142, 1989.
22. “Generalization a matrix J., vol. 30, pp. 30-39, 1989.
23. “Matrix spectrum equation, “Analysis and Optimization of Systems, Proc. 9th Intern. Conf., Antibes, France, 1990 (Lecture Notes Control and Information Science). Berlin: Springer-Verlag, 1990, pp. 95-102.
24. A. Ya. Bulgakov and S. K. Godunov, “Circular dichotomy of the spectrum of a matrix, “Siberian Math. J., vol. 29, pp. 734~744, 1988.
25. A. Bunse-Gerstner, R. Byers, and V. Mehrmann, “Numerical methods for algebraic Riccati equations, “in Proc. Workshop Riccati Equation in Contr. Syst. Sig., Como, Italy, June 1989, pp. 107-116.
26. R. Byers, “Numerical stability and instability in matrix sign function based algorithms, “in Computational and Combinatorial Methods in Systems Theory, C. I. Byrnes and A. Lindquist, Eds. New York: Elsevier. 1986. pp. 185-200.
27. Solving the algebraic Riccati equation with the matrix sign function, “Lin. Alg. Appl., vol. 85, pp. 267-279, 1987.
28. “A bisection method for measuring the distance of a stable matrix to the unstable matrices, “SIAM J. Sci. Stat. Comp., vol. 9, pp. 875-881, 1988.
29. R. Byers, C. He, and V. Mehrmann, “The matrix sign function method and the computation of invariant subspaces, “Tech. Univ. Chemnitz-Zwickau, Tech. Rep., 1994.
30. J. P. Charlier and P. Van Dooren, “A systolic algorithm for Riccati and Lyapunov equations, “Math. Contr. Sig., Sys., vol. 2, pp. 109-136, 1989.
31. J. Cheng, G. Ianculescu, C. S. Kenney, A. J. Laub, J. Ly, and P. M. Papadopoulos, “Control-structure interaction study for the space station solar dynamic power module, “Contr. Syst. Mag., vol. 12, pp. 4-13, 1992.
32. J. Demmel, “On condition numbers and the distance to the nearest ill-posed problem, “Numer. Math., vol. 51, pp. 251-289, 1987.
33. —, The probability that a numerical analysis problem is difficult, “Math. Comp., vol. 50, pp. 449-480, 1988.
34. E. D. Denman, “An additional algorithm for a system of coupled algebraic matrix Riccati equations, “IEEE Trans. Comp., vol. C-25, pp. 91-93, 1976.
35. E. D. Denman and A. N. Beavers, ' ‘The matrix sign function and computations in systems, “Appl. Math. Comp., vol. 2, pp. 63-94, 1976.
36. E. D. Denman and J. Leyva-Ramos, “Spectral decomposition of a matrix using the generalized sign matrix, “Appl. Math. Comp., vol. 8, pp. 237-250, 1981.
37. C. R. DePrima and C. R. Johnson, “The range of A-1A in GL(n, C), “Lin. Alg. Appl., vol. 9, pp. 209-222, 1974.
38. N. Dunford and J. T. Schwartz, Linear Operators. Part I: General Theory. New York: Wiley, 1958.
39. W. Gander, “Algorithms for the polar decomposition, “SIAM J. Sci. Stat. Comp., vol. 11, pp. 1102-1115, 1990.
40. J. D. Gardiner, “Iterative and parallel algorithms for the solution of algebraic Riccati equations, “Ph.D. disseration, Univ. California, Santa Barbara, ECE Dept., Santa Barbara, CA, July 1988.
41. J. D. Gardiner and A. J. Laub, “A generalization of the matrix-signfunction solution for algebraic Riccati equations, “Int. J. Contr., vol. 44, pp. 823-832, 1986 (see also Proc. 1985 CDC, pp. 1233-1235).
42. “Implementation of two control system design algorithms on a message-passing hypercube, “in Hypercube Multiprocessors 1987, M. T. Heath, Ed. Philadelphia, PA: SIAM, 1987, pp. 512-519.
43. “Matrix sign function implementations on a hypercube multiprocessor, “in Proc. 27th IEEE Conf. Decis. Contr., Austin, TX, Dec. 1988, pp. 1466-1471.
44. “Solving the algebraic Riccati equation on a hypercube multiprocessor, “in Hypercube Concurrent Computers and Applications, Vol. II, G. Fox, Ed. New York: ACM Press, 1988, pp. 1562-1568.
45. “Parallel algorithms for algebraic Riccati equations, “Int. J. Contr., vol. 54, pp. 1317-1333, 1991.
46. S. K. Godunov, “The problem of dichotomy of the spectrum of a matrix, “Siberian Math. J., vol. 27, pp. 649-660, 1986.
47. “The problem of guaranteed precision in numerical methods of linear algebra, “in Proc. Internat Congr. Math. (Berkeley, Calif., 1986), Providence, RI, 1989, vol. 147, pp. 65-73.
48. “Norms of solutions of Lur’e-Riccati matrix equations as criteria of the quality of stabilizability and detectability, “Siberian Adv. in Math., vol. 2, pp. 135-157, 1992.
49. “An estimate for Green's matrix of a Hamiltonian system in the optimal control problem, “Siberian Math. J., vol. 34, pp. 70-80, 1993 (in Russian).
50. S. K. Godunov and A. Ya. Bulgakov, “The stability quality of systems of linear differential equations with constant coefficients and its application, “Numerical Methods of Linear Algebra. Novosibirsk: Computer Center of the Siberian Branch of the USSR Academy of Sciences, 1978, pp. 16-38 (in Russian).
51. “Difficultés Calculatives dans le Probléme de Hurwitz et Méthodes à les Surmonter, “in Proc. 5th Intern. Conf. on Analysis and Optimization of Systems, Versailles, France, 1982, pp. 845-851.
52. I. Gradshteyn and I. Ryzhik, Table of Integrals, Series, and Products, 4th ed. New York: Academic, 1965.
53. G. Hewer and C. S. Kenney, “The sensitivity of the stable Lyapunov equation, “SIAM J. Contr. Optim., vol. 26, pp. 321-344, 1988.
54. N. J. Higham, “Computing the polar decomposition—with applications, “SIAM J. Sci. Stat. Comp., vol. 7, pp. 1160-1174, 1986.
55. “Newton's method for the matrix square root, “Math. Comp., vol. 46, pp. 537-549, 1986.
56. “Computing real square roots of a real matrix, “Lin. Alg. Appl., vol. 88/89. pp. 405-430. 1987.
57. “The matrix sign decomposition and its relation to the polar decomposition, “Lin Alg. Appl., vol. 212/213, pp. 3-20, 1994.
58. N. J. Higham and P. Papadimitriou, “A parallel algorithm for computing the polar decomposition, “Dept. Mathematics, Univ. Manchester, England, Tech. Rep. 226, June 1993, also to appear in Parallel Computing.
59. N. J. Higham and R. S. Schreiber, “Fast polar decomposition of an arbitrary matrix, “SIAM J. Sci. Stat. Comp., vol. 11, pp. 648-655, 1990.
60. D. Hinrichsen and A. J. Pritchard, “Stability radius for structured perturbations and the algebraic Riccati equation, “Syst. Contr. Lett., vol. 8, pp. 105-113, 1986.
61. W. D. Hoskins, D. S. Meek, and D. J. Walton, “The of A'Q + QA = —C, “IEEE Trans. Automat. Contr., vol. AC-22, pp. 881-882, 1977.
62. “The numerical = + + = C, “IEEE Trans. Automat. Contr., vol. AC-22, pp. 882-883, 1977.
63. “The numerical solution of the matrix equation XA+ = F, “BIT, vol. 17, pp. 184-190, 1977.
64. W. D. Hoskins and D. J. Walton, “A faster, more stable method for computing the pth roots of positive definite matrices, “Lin. Alg. Appl, vol. 26, pp. 136-163, 1979.
65. J. L. Howland, “The sign matrix and the separation of matrix eigenvalues, “Lin. Alg. Appl., vol. 49, pp. 221-232, 1983.
66. C. S. Kenney and G. Hewer, “The sensitivity of the algebraic and differential Riccati equations, “SIAM J. Contr. Opt., vol. 28, pp. 50-69, 1990.
67. C. S. Kenney and A. J. Laub, “Controllability and stability radii for companion form systems, “Math. Contr. Signals, Sys., vol. 1, pp. 239-256, 1988.
68. “Condition estimates for matrix functions, “SIAM J. Matrix Anal. Appl, vol. 10, pp. 191-209, 1989.
69. “Padé error estimates for the logarithm of a matrix, “Int. J. Contr., vol. 50, pp. 707-730, 1989.
70. “Polar decomposition and matrix sign function condition estimates, “SIAM J. Sci. Stat. Comp., vol. 12, pp. 488-504, 1991.
71. “Rational iterative methods J. Matrix Anal. Appl, vol. 12, pp. 273-291, 1991.
72. “On scaling Newton's method for the matrix sign function, “SIAM J. Matrix Atu-1Appl., vol. 13, pp. 688-706, 1992.
73. “A hyperbolic tangent identity and the geometry of Padé sign function iterations, “Numerical Algorithms, vol. 7, pp. 111-128, 1994.
74. “Small-sample statistical estimates functions, “SIAM J. Sci. Comp., vol. 15, pp. 36-61, 1994.
75. C. S. Kenney, A. J. Laub, and E. A. Jonckheere, “Positive and negative solutions of dual Riccati equations by matrix sign function iteration, “Sys. Contr. Lett., vol. 13, pp. 109-116, 1989.
76. C. S. Kenney, A. J. Laub, and P. M. Papadopoulos, “Matrix-sign algorithms for Riccati equations, “IMA J. Math. Contr. Info., vol. 9, pp. 331-344, 1992.
77. “A Newton-squaring algorithm for computing the negative invariant subspace of a matrix, “IEEE Trans. Automat. Contr., vol. 38, pp. 1284-1289, 1993.
78. C. S. Kenney, A. J. Laub, and M. Wette, “A stability-enhancing scaling procedure for Schur-Riccati solvers, “Sys. Contr. Lett., vol. 12, pp. 241-250, 1989.
79. “Error bounds for Newton refinement of solutions to Riccati equations, “Math. Contr., Signals, Sys., vol. 3, pp. 211-224, 1990.
80. Ç. K. Koç and B. Bakkaloğlu, “Halley's method for the matrix sector function, “to appear in IEEE Trans. Automat. Contr., vol. 40, pp. 944-949, 1995.
81. Ç. K. Koç, B. Bakkaloğlu, and L. S. Shieh, “Computation of the matrix sign function using continued fraction expansion, “IEEE Trans. Automat. Contr., vol. 39, pp. 1644-1647, 1994.
82. Z. Kovarik, “Some iterative methods for improving orthonormality, “SIAM J. Numer. Anal., vol. 7, pp. 386-389, 1970.
83. V. Kučera, “A contribution to matrix quadratic equations, “IEEE Trans. Automat. Contr., vol. AC-17, pp. 344-347, 1972.
84. P. Lancaster, “Explicit solutions of linear matrix equations, “SIAM Review, vol. 12, pp. 544-566, 1970.
85. V. B. Larin, “Finding the square root of a positive definite matrix, “Soviet Math. Dokl., vol. 44, pp. 479-481, 1992.
86. V. B. Larin and F. A. Aliev, square root solution of the Lyapunov matrix equation, “Sys. Contr. Lett., vol. 20, pp. 109-112, 1993.
87. A. J. Laub, “Invariant subspace methods for the numerical Riccati equations, “in The Riccati Equation, S. Bittanti, A. J. Laub, and J. C. Willems, Eds. Berlin: Springer-Verlag, 1991, pp. 163-196.
88. A. J. Laub and J. D. Gardiner, “Hypercube implementation some parallel algorithms in control, “in Advanced Computing Concepts and Techniques in Control Engineering, M. J. Denham and A. J. Laub, Eds. Berlin: Springer-Verlag, 1988, pp. 361-390.
89. R. B. Leipnik, “Rapidly convergent recursive solution of quadratic operator equations, “Numer. Math., vol. 17, pp. 1-16, 1971.
90. C. Lin and E. Zmijewski, “A parallel algorithm for computing the eigenvalues of an unsymmetric matrix on an SIMD mesh of processors, “Dept. Computer Science, Univ. California, Santa Barbara, Tech. Rep. TRCS 91-15, 1991.
91. D. Luenberger, Linear and Nonlinear Programming, 2nd ed. Reading, MA: Addison-Wesley, 1984.
92. A. Malyshev, “Computing invariant subspaces of a regular linear pencil of matrices, “Siberian Math. J., vol. 30, pp. 559-567, 1989.
93. A. Malyshev, “Guaranteed accuracy in spectral problems of linear algebra, I, II, “Siberian Adv. in Math., vol. 2, no. 1, 2, pp. 144-197, 153-204, 1992.
94. “Parallel algorithm for solving some spectral problems in linear algebra, “Lin. Alg. Appl., vol. 188/189, pp. 489-520, 1993.
95. A. N. Malyshev, Introduction to Numerical Linear Algebra. Novosibirsk, Russia: Nauka, 1991 (in Russian).
96. “Guaranteed accuracy in the generalized eigenvalue problem and factorization of matrix polynomials, “Ph.D. dissertation, Novosibirsk, Russia, 1993, (Habilitation thesis) (in Russian).
97. R. Mathias, “Perturbation bounds for the polar decomposition, “SIAM J. Matrix Anal., vol. 14, pp. 588-597, 1993.
98. “Condition estimation for the matrix sign function via the Schui decomposition, “in Proc. Fifth SIAM Conf. on Applied Linear Algebra, Snowbird, Utah, June 1994, pp. 85-89.
99. “Condition estimation for matrix functions via the Schur decomposition, “SIAM J. Matrix Anal., vol. 16, pp. 565-578, 1995.
100. R. L. Mattheys, “Stability analysis via the extended matrix sign function, “Proc. IEE, vol. 125, pp. 241-243, 1978.
101. P. Pandey, C. S. Kenney, and A. J. Laub, “A parallel algorithm for the matrix sign function, “Int. J. High Speed Computing, vol. 2, pp. 181-191, 1990.
102. P. P. Petrushev and V. A. Popov, Rational Approximation of Real Functions. Cambridge: Cambridge Univ. Press, 1987.
103. L. Qiu, B. Bernhardsson, A. Rantzer, E. J. Davison, P. M. Young, and J. C. Doyle, “On the real structured stability radius, “in Proc. I2th IFAC World Congress, Sydney, Australia, 1993, vol. 8, pp. 71-78.
104. J. R. Rice, The Approximation of Functions, Vol. 1—Linear Theory. Reading, MA: Addison-Wesley, 1964.
105. “A theory of condition, “SIAM J. Numer. Anal., vol. 3, pp. 287-310, 1966.
106. J. D. Roberts, “Linear model reduction and solution of the algebraic Riccati equation by use of the sign function, “Int. J. Contr., vol. 32, pp. 677-687, 1980.
107. G. Schulz, “Iterative computation of reciprocal matrices, “Z. Angew. Math. Mech., vol. 13, pp. 57-59, 1933 (in German).
108. L. S. Shieh, H. M. Dib, and R. E. Yates, “Separation of matrix eigenvalues and structural decomposition of large-scale systems, “IEE Proc., vol. 133, pp. 90-96, 1986.
109. L. S. Shieh, S. R. Lian, and B. C. Mclnnis, “Fast and stable algorithms for computing the principal square root of a complex matrix, “IEEE Trans. Automat. Contr., vol. AC-32, pp. 820-822, 1987.
110. L. S. Shieh, J. S. H. Tsai, and N. P. Coleman, “Rectangular and polai representations of a complex matrix, “Int. J. Syst. Sci., vol. 18, pp. 1825-1838, 1987.
111. L. S. Shieh, J. S. H. Tsai, and R. E. Yates, “The generalized matrix sector functions and their applications to systems theory, “IMA J. Math. Contr. and Info., vol. 2, pp. 251-258, 1990.
112. L. S. Shieh, Y. T. Tsay, and C. T. Wang, “Matrix sector functions and their applications to systems theory, “IEE Proc., Part D: Control and Applications, vol. 131, pp. 171-181, 1984.
113. L. S. Shieh, Y. T. Tsay, and R. E. Yates, “Some properties of matrix sign functions derived from continued fractions, “IEE Proc., Part D: Control and Applications, vol. 130, pp. 111-118, 1983.
114. L. S. Shieh, Y. T. Tsay, S. W. Lin, and N. P. Coleman, “Block-diagonalization and block-triangularization of a matrix via the matrix sign function, “Int. J. Syst. Sci., vol. 15, pp. 1203-1220, 1984.
115. L. S. Shieh, Y. T. Tsay. and R. E. Yates, “Computation of the principal nth roots of complex matrices, “IEEE Trans. Automat. Contr., vol. AC-30, pp. 606-608, 1985.
116. I. Stakgold, Green's Functions and Boundary Value Problems. New York: Wiley, 1979.
117. G. W. Stewart, “Error and perturbation bounds for subspaces associated with eigenvalue problems, “SIAM Review, vol. 15, pp. 727-764, 1973.
118. E. U. Stickel, “Separating eigenvalues using the matrix sign function, “Lin. Alg. Appl., vol. 148, pp. 75-88, 1991.
119. J. F. Traub, Iterative Methods for the Solution of Equations. New York: Chelsea, 1964.
120. L. N. Trefethen, “Pseudospectra of matrices, “in Numerical Analysis 1991, D. F. Griffiths and G. A. Watson Eds. White Plains, NY: Longman, 1992, pp. 234-266.
121. J. S. H. Tsai, L. S. Shieh, and R. E. Yates, “Fast and stable algorithms for computing the principal nth root of a complex matrix and the matrix sector functions, “Computers and Mathematics with Application, vol. 15, pp. 903-913, 1988.
122. Y. T. Tsay, L. S. Shieh, and J. S. H. Tsai, “A fast method for computing the principal nth roots of complex matrices, “Lin. Alg. App., vol. 76, pp. 205-221, 1986.
123. C. F. Van Loan, “How near is a to an in Proc. Summer Research Conference, AMS Vol. 47, Contemporary Mathematics, American Mathematical Society, Providence, RI, 1985, pp. 465-477.
124. E. I. Zolotarjov, Application of the Elliptic Functions to the Problems on the Functions of the Least and Most Deviation from Zero. Nauk: Zapiskah Rossijskoi Akad. 1877 (in Russian).