SpringerLink
Log in

Applications of Pade approximants and continued fractions in systems theory

  • Conference paper
  • First Online:
Mathematical Theory of Networks and Systems

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 58))

Abstract

A brief introduction to the terminology of Padé approximation is given first. In the next sections we summarize some known applications of Padé approximants and continued fractions in the theory of linear systems, digital filtering and network theory. Relevant references are given.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Jones W.B., Thron W.J.: Continued fractions: analytic theory and applications. Addison-Wesley, Reading, 1980.

    Google Scholar 

  2. Perron O.: Die Lehre von den Kettenbrücken (3rd ed.). Teubner Verlag, Stuttgart, 1977.

    Google Scholar 

  3. Wall H.S.: Analytic theory of continued fractions. Van Nostrand, New York, 1948.

    Google Scholar 

  4. Miklosko J.: An algorithm for calculating continued fractions. Journal Comp. Appl. Math. 3 (1977) 272–275.

    Google Scholar 

  5. Van der Cruyssen P.: A continued fraction algorithm. Numerische Math. 37 (1981) 149–156.

    Google Scholar 

  6. Baker G.A. Jr.: Essentials of Padé approximants, Ac. Press, N.Y., 1975.

    Google Scholar 

  7. Baker G.A. Jr., Graves-Morris P.: Padé approximants. Addison-Wesley, Reading, 1981.

    Google Scholar 

  8. Brezinski C.: Padé type approximation and general orthogonal polynomials. Birkhäuser, Basel, 1980.

    Google Scholar 

  9. Gilewicz J.: Approximants de Padé. Springer Verlag, Berlin, 1978.

    Google Scholar 

  10. Gragg W.B.: The Padé table and its relation to certain algorithms of numerical analysis. SIAM Rev. 14 (1972) 1–62.

    Google Scholar 

  11. Chisholm J.S.R.: Some generalizations of Padé approximants. Circuits, Systems, Signal Proc. 1 (1982) 279–287.

    Google Scholar 

  12. Bussonnais D.: "Tous" les algorithmes de calcul par recurrence des approximants de Padé d'une serie. Construction des fractions continues correspondantes. Presented Conf. Padé approx., Lille, 1978.

    Google Scholar 

  13. Bultheel A.: Recursive relations for block Hankel and Toeplitz systems part I: direct recursions. Report TW56, part II: dual recursions. Report TW58, 1982, K.U.Leuven.

    Google Scholar 

  14. Bultheel A.: Division algorithms for continued fractions and the Padé table. Journ. Comp. Appl. Math. 6 (1980) 259–266.

    Google Scholar 

  15. Draux A.: Polynômes orthogonaux formels-applications. Springer Verlag, Berlin, 1983.

    Google Scholar 

  16. Draux A.: Formal orthogonal polynomials and Padé approximants in a non commutative algebra. These proceedings.

    Google Scholar 

  17. McEliece R.J., Shearer J.B.: A property of Euclid's algorithm and an application to Padé approximation. SIAM J. Appl. Math. 34 (1978) 611–616.

    Google Scholar 

  18. Murphy J.A., O'Donohoe M.P.: A class of algorithms for obtaining rational approximants to functions which are defined by power series. Journ. Appl. Math. Phys. 28 (1977) 1121–1131.

    Google Scholar 

  19. Magnus A.: Expansion of power series into P-fractions. Math. Z. 80 (1962) 209–216.

    Google Scholar 

  20. Magnus A.: Certain continued fractions associated with the Padé table. Math. z. 78 (1962) 361–374.

    Google Scholar 

  21. Massey J.L.: Shift-register synthesis and BCH decoding. IEEE Trans. Info. Th. IT-15 (1969) 122–127.

    Google Scholar 

  22. Welch L.R., Scholtz R.A.: Continued fractions and Berlekamp's algorithm. IEEE Trans. Info Th. IT-25 (1979) 19–27.

    Google Scholar 

  23. Bultheel A.: Recursive algorithms for nonnormal Padé tables. SIAM J. Appl. Math. 39 (1980) 106–118.

    Google Scholar 

  24. Bultheel A.: Epsilon and qd algorithms for the matrix Padé and 2D-Padé problem. Report TW57, K.U.Leuven, 1982.

    Google Scholar 

  25. Levinson N.: The Wiener RMS (root mean square) error criterion in filter design and prediction. J. Math. Phys. 25 (1947) 261–278.

    Google Scholar 

  26. Schur I.: Ueber Potenzreihen die im Innern des Einheits-Kreises beschränkt sind. Z. für Reine Angew. Math. 147 (1917) 205–232, 148 122–145.

    Google Scholar 

  27. Bultheel A., Dewilde P.: On the relation between Padé approximation algorithms and Levinson/Schur recursive methods. In Signal Processing: Theory and Applications M. Kunt, F. de Coulon eds., North Holland, 1980, 517–523.

    Google Scholar 

  28. Lévy B., Morf M., Kung S.Y.: Some algorithms for the recursive input-output modeling of 2-D systems. Preprint LIDS-P-962, 1979.

    Google Scholar 

  29. Bose N.K., Basu S.: Two dimensional matrix Padé approximants: existence, uniqueness and recursive computation. IEEE Trans. Autom. Contr. AC-25 (1980) 509–514.

    Google Scholar 

  30. Bultheel A.: Recursive computation of triangular 2-D Padé approximants. Presented SIAM Conf. on Appl. Lin. Alg. Raleigh, NC, April 1982.

    Google Scholar 

  31. Cuyt A.: Abstract Padé approximants for operators: theory and applications. Ph.D. Thesis UIA, Antwerp, 1982.

    Google Scholar 

  32. Henrici P.: Applied computational complex analysis. John Wiley, New York, 1977.

    Google Scholar 

  33. Gragg W.B., Lindquist A.: On the partial realization problem. Linear algebra Appl. Special issue edited by: Brockett R., Fuhrmann P., 1983.

    Google Scholar 

  34. Kalman R. On partial realizations, transfer functions and canonical forms. Acta Polytechnica Scandinavica 31 (1979) 9–32.

    Google Scholar 

  35. Bultheel A.: Recursive algorithms for the matrix Padé problem. Math. Comp. 35 (1980) 875–892.

    Google Scholar 

  36. Dickinson B.W., Morf M., Kailath T.: A minimal realization algorithm for matrix sequences. IEEE Trans. Autom. Contr. AC-19 (1974) 31–38.

    Google Scholar 

  37. Fuhrmann P.: A matrix Euclidean algorithm and matrix continued fraction expansion. These proceedings.

    Google Scholar 

  38. Shamash Y.: Model reduction using the Routh stability criterion and the Padé approximation technique. Int. J. Control 21 (1975) 475–484.

    Google Scholar 

  39. Lepschy A., Viaro U.: An improvement in the Routh-Padé approximation techniques. Int. J. Control 36 (1982) 643–661.

    Google Scholar 

  40. Decoster M., Van Cauwenberghe A.: A comparative study of different reduction methods (part 2). Journal A, 17 (1976) 125–134.

    Google Scholar 

  41. Lepschy A., Viaro U.: Simulation of complex systems via reduced-order models. IASTED, Applied Modelling on Simulation Symposium, Paris, 1982.

    Google Scholar 

  42. Hwang C., Shih Y.P.: On the time moments of discrete systems. Int. J. Control 34 (1982) 1227–1228.

    Google Scholar 

  43. Chen C.F.: Model reduction of multivariable control systems by means of matrix continued fractions. Int. J. Control 20 (1974) 225–238.

    Google Scholar 

  44. Chuang S.C.: Application of continued fraction method for modelling transfer functions to give accurate initial transient response. Electr. Lett. 6 861–863.

    Google Scholar 

  45. Bistritz Y., Shaked U.: Discrete multivariable system approximations by minimal Padé type models. Preprint 1982.

    Google Scholar 

  46. Bistritz Y., Shaked U.: Minimal Padé model reduction of multivariable systems. Preprint 1982.

    Google Scholar 

  47. Mitra S.K., Sagar A.D., Pendergrass N.A.: Realizations of two-dimensional recursive digital filters. IEEE Trans. Circuits Syst. CAS-22 (1975) 177–184.

    Google Scholar 

  48. Rao G.S., Karivaratharajan P., Rajappan K.P.: A general form of continued fraction expansion for two-dimensional recursive digital filters. IEEE Trans. Acoust. Speech Signal Proc. ASSP-25 (1977) 198–200.

    Google Scholar 

  49. Bultheel A.: Incoming and outgoing algorithms for matrix Padé approximation and multivariable AR filtering. Subm. IEEE Trans. ASSP, 1982.

    Google Scholar 

  50. Bultheel A.: Algorithms to compute the reflection coefficients of digital filters. Proc. Oberwolfach meeting Numerical Methods of approximation theory, 1983, Birkhäuser, to appear.

    Google Scholar 

  51. Bultheel A.: Quotient-difference relations in connection with AR filtering. Proceedings ECCTD'83 Conference, Stuttgart, VDE Verlag, Frankfurt, to appear.

    Google Scholar 

  52. Bistritz Y., Langholz G.: Model reduction by Chebyshev polynomial technique. IEEE Trans. Autom. Contr. AC-24 (1979) 741–747.

    Google Scholar 

  53. Langholz G., Bistritz Y.: Model reduction of dynamic systems over a frequency interval. Int. J. Control 31 (1980) 51–62.

    Google Scholar 

  54. Dewilde P., Vieira A., Kailath T.: On a general Szegö-Levinson realization algorithm for optimal linear predictors based on a network synthesis approach. IEEE Trans. Circuits Syst. CAS-25 (1978) 663–675.

    Google Scholar 

  55. Dewilde P., Dym M.: Lossless chain scattering matrices and optimum linear prediction: the vector case. Circuit Theory Appl. 9 (1981) 135–175.

    Google Scholar 

  56. Chui C., Chan A.: Application of approximation theory methods to recursive digital filter design. IEEE Trans. Acoustics, Speech, Signal Proc. ASSP-30 (1982) 18–24.

    Google Scholar 

  57. Cybenko G.: Restrictions of normal operators, Padé approximation and auto-regressive time series. Preprint, Tufts University, 1982.

    Google Scholar 

  58. Kalman R.: Realization of covariance sequences. In Toeplitz Centenial, I. Gohberg ed., Birkhäuser, 1982, 331–342.

    Google Scholar 

  59. Mullis C.T., Roberts R.A.: The use of second-order information in the approximation of discrete-time linear systems. IEEE Trans. Acoustics, Speech, Signal Proc. ASSP-24 (1976) 226–238.

    Google Scholar 

  60. Mitra S.K., Sherwood R.J.: Canonical realizations of digital filters using the continued fraction expansion. IEEE Trans. Audio electroacoust. AU-20 (1972) 185–194.

    Google Scholar 

  61. Jones W.B., Steinhardt A.: Digital filters and continued fractions. In Analytic theory of continued fractions, LNM 932, Springer Verlag, 1982, 129–151.

    Google Scholar 

  62. Cichocki A.: Nested-feedback-loops realization of 2-D systems. Circuits, Systems Signal Proc. 1 (1982) 321–343.

    Google Scholar 

  63. Belevitch V.: Classical network theory. Holden-Day, San Francisco, 1968.

    Google Scholar 

  64. Morimoto K., Matsumoto N., Takahashi S.: Matrix Padé approximants and multiport networks. Electr. and Communic. Japan 61A (1978) 28–36.

    Google Scholar 

  65. Basu S., Bose N.K.: Matrix Stieltjes series and network models. SIAM J. Math. Anal. 14 (1983) 209–222.

    Google Scholar 

  66. Bose N.K.: Applied multidimensional systems theory. Van Nostrand Reinhold, New York, 1982.

    Google Scholar 

  67. Brezinski C. A bibliography on Padé approximation and related subjects. Publ. 96 Labor. de Calcul, Univ. de Lille, 1977, (1502 titles), Addendum 1 (1978) (359 titles), Addendum 2 (1980) (471 titles).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. Computer Science, K.U. Leuven, Celestijnenlaan 200A, B-3030, Leuven, Heverlee

    A. Bultheel

Authors
  1. A. Bultheel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

P. A. Fuhrmann

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag

About this paper

Cite this paper

Bultheel, A. (1984). Applications of Pade approximants and continued fractions in systems theory. In: Fuhrmann, P.A. (eds) Mathematical Theory of Networks and Systems. Lecture Notes in Control and Information Sciences, vol 58. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0031049

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13168-7

  • Online ISBN: 978-3-540-38826-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation