Skip to main content
Log in

A hyperbolic tangent identity and the geometry of Padé sign function iterations

  • Published:
Numerical Algorithms Aims and scope Submit manuscript

Abstract

The rational iterations obtained from certain Padé approximations associated with computing the matrix sign function are shown to be equivalent to iterations involving the hyperbolic tangent and its inverse. Using this equivalent formulation many results about these Padé iterations, such as global convergence, the semi-group property under composition, and explicit partial fraction decompositions can be obtained easily. In the second part of the paper it is shown that the behavior of points under the Padé iterations can be expressed, via the Cayley transform, as the combined result of a completely regular iteration and a chaotic iteration. These two iterations are decoupled, with the chaotic iteration taking the form of a multiplicative linear congruential random number generator where the multiplier is equal to the order of the Padé approximation.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Z. Bai and J.W. Demmel, Design of a parallel nonsymmetric eigenroutine toolbox, Part I, in:Proc. 6th SIAM Conf. on Parallel Processing for Scientific Computing, eds. R.F. Sincovec, D.E. Keyes, M.R. Leuze, L.R. Petzold and D.A. Reed, vol. 1 (SIAM, Philadelphia, PA, 1993) pp. 391–398.

    Google Scholar 

  2. A.Y. Barraud, Produit étoile et fonction signe de matrice—Application à l'équation de Riccati dans le cas discret, R.A.I.R.O. Automatique/Systems Analysis and Control 14 (1980) 55–85.

    Google Scholar 

  3. A.F. Beardon,Iteration of Rational Functions (Springer, New York, 1991).

    Google Scholar 

  4. G.J. Bierman, Computational aspects of the matrix sign function solution to the ARE, in:Proc. 23rd IEEE Conf. on Decision Control, Las Vegas, NV (December 1984) pp. 514–519.

  5. E.D. Denman and A.N. Beavers, The matrix sign function and computations in systems, Appl. Math. Comp. 2 (1976) 63–94.

    Google Scholar 

  6. J.D. Gardiner and A.J. Laub, A generalization of the matrix-sign-function solution for algebraic Riccati equations, Int. J. Control 44 (1986) 823–832; see alsoProc. 1985 CDC, pp. 1233–1235.

    Google Scholar 

  7. I. Gradshteyn and I. Ryzhik,Table of Integrals, Series, and Products (Academic Press, New York, 4th ed, 1965).

    Google Scholar 

  8. N. Higham, The matrix sign decomposition and its relation to the polar decomposition, Technical Report 225, University of Manchester (April 1993), to appear in Lin. Alg. Appl.

  9. J.L. Howland, The sign matrix and the separation of matrix eigenvalues, Lin. Alg. Appl. 49 (1983) 221–232.

    Google Scholar 

  10. C.S. Kenney and A.J. Laub, Rational iterative methods for the matrix sign function, SIAM J. Matrix Anal. Appl. 12 (1991) 273–291.

    Google Scholar 

  11. C.S. Kenney, A.J. Laub and P.M. Papadopoulos, Matrix-sign algorithms for Riccati equations, IMA J. Math. Control Inf. 9 (1992) 331–344.

    Google Scholar 

  12. C. Koc, B. Bakkaloglu and L. Sheih, Computation of matrix sign function using continued fraction expansion, preprint (March 1993).

  13. Z. Kovarik, Some iterative methods for improving orthonormality, SIAM J. Numer. Anal. 7 (1970) 386–389.

    Google Scholar 

  14. R.B. Leipnik, Rapidly convergent recursive solution of quadratic operator equations, Numer. Math. 17 (1971) 1–16.

    Google Scholar 

  15. C.-C. Lin and E. Zmijewski, A parallel algorithm for computing the eigenvalues of an unsymmetric matrix on an SIMD mesh of processors, Technical Report TRCS 91-15, Dept. of Computer Science, Univ. of California, Santa Barbara (July 1991).

    Google Scholar 

  16. R. Nevanlinna and V. Paatero,Introduction to Complex Analysis (Addison-Wesley, Reading, MA, 1969).

    Google Scholar 

  17. P. Pandey, C.S. Kenney and A.J. Laub, A parallel algorithm for the matrix sign function, Int. J. High Speed Comp. 2 (1990) 181–191.

    Google Scholar 

  18. S. Park and K. Miller, Random number generators: good ones are hard to find, Commun. ACM 31 (1988) 1192–1201.

    Google Scholar 

  19. J.F. Ritt, Periodic functions with a multiplication theorem Trans. Amer. Math. Soc. 23 (1922) 16–25.

    Google Scholar 

  20. T.J. Rivlin,Chebyshev Polynomials (Wiley, New York, 2nd ed, 1990).

    Google Scholar 

  21. J.D. Roberts, Linear model reduction and solution of the algebraic Riccati equation by use of the sign function, Int. J. Control 32 (1980) 677–687, reprint of Technical Report No. TR-13, CUED/B-Control, Cambridge University, Engineering Department (1971).

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by P. Van Dooren

This research was supported in part by the National Science Foundation under Grant No. ECS-9120643, the Air Force Office of Scientific Research under Grant no. F49620-94-1-0104DEF, and the Office of Naval Research under Grant No. N00014-92-J-1706.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kenney, C.S., Laub, A.J. A hyperbolic tangent identity and the geometry of Padé sign function iterations. Numer Algor 7, 111–128 (1994). https://doi.org/10.1007/BF02140677

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02140677

Keywords