Halley 's Method for the Matrix Sector Function

IEEE Transactions on Automatic Control

Volumn 40, Issue 5, 1995, Pages 944-949

  Koç, Cetin Kaya ^a   Bakkaloğlu, Bertan ^a  

^a OREGON STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CALCULATIONS; CONVERGENCE OF NUMERICAL METHODS; EIGENVALUES AND EIGENFUNCTIONS; ERRORS; FUNCTIONS; ITERATIVE METHODS; MATRIX ALGEBRA; NONLINEAR EQUATIONS; NUMERICAL METHODS; VECTORS;

CONTINUED FRACTION METHOD; ERROR PROPAGATION PROPERTIES; HALLEY'S METHOD; MATRIX SECTOR FUNCTION; NEWTON'S METHOD;

CONTROL THEORY;

EID: 0029304771     PISSN: 00189286     EISSN: 15582523     Source Type: Journal    
DOI: 10.1109/9.384237     Document Type: Article

References (28)

1. A. A. Abdul-Wahab, “Lyapunov-type equations for matrix root-clustering in subregions of the complex plane,” Int. J. Syst. Sci., vol. 21, no. 9, pp. 1819-1830, 1990.
2. Z. Bai and J. Demmel, “Design of parallel nonsymmetric eigenvalue toolbox, Part 1, “ Univ. California Berkeley, Tech. Rep. csd-92-718, Dec. 1992.
3. Z. Bai, J. Demmel, and M. Gu, “Inverse free parallel spectral divide and conquer algorithms for nonsymmetric eigenproblems.” Univ. California Berkeley, Tech. Rep. csd-94-793, Feb. 1994.
4. S. Bittanti, A. J. Laub, and J. C. Willems, Eds., The Riccati Equation. New York: Springer-Verlag, 1991.
5. D. Boley, “Solving the generalized eigenvalue problem on a synchronous linear processor array,” Parallel Computing, vol. 3, no. 2, pp. 153-166, May 1986.
6. R. Byers, “Solving the algebraic Riccati equation with the matrix sign function,” Linear Algebra and Its Applications, vol. 85, pp. 267-279, 1987.
7. P. Comon, “Fast computation of a restricted subset of eigenpairs of a varying Hermitian matrix" in Numerical Linear Algebra, Digital Signal Processing and Parallel Algorithms, G. H. Golub and P. van Dooren, Eds. New York: Springer-Verlag, 1991, pp. 457-466.
8. A. A. M. Cuyt, “Numerical stability of the Halley-iteration for the solution of a system of nonlinear equations.” Math. Computation, vol. 38, no. 157, pp. 171-179, Jan. 1982.
9. M. Davies and B. Dawson, “On the global convergence of Halley’s iteration formula,” Numerische Mathematik, vol. 14, no. 2, pp. 133-135, 1975.
10. J. S. Frame, “A variation of Newton’s method,” Amer. Math. Monthly, vol. 51, pp. 36-38, 1944.
11. J. D. Gardiner and A. J. Laub, “Parallel algorithms for algebraic Riccati equations,” Int. J. Contr., vol. 44, no. 6, pp. 1317-1333, Dec. 1991.
12. G. A. Geist, R. C. Ward, G. J. Davis, and R. E. Funderlic, “Finding eigenvalues and eigenvectors of unsymmetric matrices using a hypercube multiprocessor,” in Hypercube Concurrent Computers and Applications, vol. II, G. Fox, Ed. New York: ACM Press, 1988, pp. 1577-1582.
13. G. H. Golub and C. F. van Loan, Matrix Computations, 2nd ed. Baltimore, MD: Johns Hopkins Univ. Press, 1989.
14. W. D. Hoskins and D. J. Walton, “A faster, more stable method for computing the pth roots of positive definite matrices,” Linear Algebra and Its Applications, vol. 26, pp. 139-163, 1979.
15. A. Jennings and J. J. McKeown, Matrix Computations. New York: Wiley, 1992.
16. C. Kenney and A. J. Laub, “Polar decomposition and matrix sign function condition estimates,” SIAM J. Scientific and Statistical Computing, vol. 12, no. 3, pp. 488-504, 1991.
17. “Rational iterative methods for the matrix sign function,” SIAM J. Matrix Analysis and Applications, vol. 12, no. 2, pp. 273-291, Apr. 1991.
18. “A hyperbolic tangent identity and geometry of Padé sign function iterations,” Numerical Algorithms, vol. 7, pp. 111-128, 1994.
19. Private communication. 1994.
20. Ç. K. Koç, B. Bakkaloglu, and L. S. Shieh, “Computation of the matrix sign function using continued fraction expansion,” IEEE Trans. Automat. Contr., vol. 39, no. 8, pp. 1644-1647, Aug. 1994.
21. P. Pandey, C. Kenney, and A. J. Laub, “A parallel algorithm for the matrix sign function, “ Int. J. High-Speed Computing, vol. 2. no. 2, pp. 181-191, 1990.
22. R. F. Rinehart, “The equivalence of definitions of a matric function,” Amer. Math. Monthly, vol. 3, no. 62, pp. 395-414, 1955.
23. J. D. Roberts, “Linear model reduction and solution of the algebraic Riccati equation by use of the sign function" Int. J. Contr., vol. 32, no. 4, pp. 677-687, 1980.
24. L. S. Shieh, H. M. Dib, and R. E. Yates, “Separation of matrix eigenvalues and structural decomposition of large-scale systems,” IEE Proc.: Contr. Theory and Applications, vol. 133, no. 2, pp. 90-96, 1986.
25. 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. Inform., vol. 2, pp. 251-258, 1990.
26. L. S. Shieh, Y. T. Tsay, and C. T. Wang, “Matrix sector functions and their applications to systems theory,” IEE Proc.: Control Theory and Applications, vol. 131, no. 5, pp. 171-181, Sep. 1984.
27. 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 Applications, vol. 15, no. 11, pp. 903-913, 1988.
28. J. H. Wilkinson, The Algebraic Eigenvalue Problem. Oxford, London: Oxford Univ. Press, 1965.