Skip to main content
SpringerLink
Log in

On Recursiveness and Related Topics in Linear Systems: A Summary

  • Conference paper
Analysis and Optimization of Systems

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

Abstract

A summary of the results on the decomposition of matrix formal power series, obtained in ANTOULAS [1986], is presented. Consider the finite or infinite sequence of data points (e.g., measurements)

$$$$S{\kern 1pt} = {\kern 1pt} ({A_1},{A_2},...,{A_N},...)$$$$

where A t are p×m (constant) matrices, with real or complex entries. A fundamental problem is to reconstruct, or model, the mechanism that generates the given data S.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Anderson, B.M., Brasch, F.M., and Lopresti, P.V., “The sequential construction of minimal

    Google Scholar 

  2. partial realizations from finite input-output data,“ SIAM J. Control 13, pp.552–571 (1975).

    Google Scholar 

  3. Antoulas, A.C., “On canonical forms for linear constant systems,” Int. J. Control, 33, pp. 95–122 (1981).

    Article  MATH  MathSciNet  Google Scholar 

  4. Antoulas, A.C., “On canonical forms for linear constant systems,” Int. J. Control, 33, pp. 95–122 (1981).

    Article  MATH  MathSciNet  Google Scholar 

  5. Antoulas, A.C., “On recursiveness and related topics in linear systems,” Technical Report TR 8507, Department of Electrical and Computer Engineering, Rice University; to appear in IEEE Transactions on Automatic Control, (March 1986).

    Google Scholar 

  6. Bultheel, A. and Dewilde, P., Editors, Special issue: Rational approximations for systems, Circuits, Systems, and Signal Processing, 1, no. 3–4, (1982).

    Google Scholar 

  7. Dickinson, B.W., Morf, M., and Kailath, T., “A minimal realization algorithm for matrix sequences,” IEEE Trans. on Automatic Control, AC-19, pp. 31–38 (1974).

    Google Scholar 

  8. Euler, L., “An essay on continued fractions,” translated by M.F. Wyman and B.F. Wyman, Department of Mathematics, Ohio State University, Columbus, OH, 1985 (1737).

    Google Scholar 

  9. Fuhrmann, P.A., “A matrix Euclidean algorithm and matrix continued fraction expansion,” Systems and Control Letters, 3, pp. 263–271 (1983).

    Article  MathSciNet  Google Scholar 

  10. Gragg, W.B. and Lindquist, A., “On the partial realization problem,” Linear Algebra and Its Applications, Special volume on Linear Systems and Control, 50, pp. 277–319 (Apr. 1983).

    MATH  MathSciNet  Google Scholar 

  11. Kalman, R.E., “On partial realizations, transfer functions, and canonical forms,” Acta Polyt. Scand. Ma., 31, pp. 9–32 (1979).

    MATH  MathSciNet  Google Scholar 

  12. Magnus, A., “Certain continued fractions associated with the Padé table,” Math. Z., 78, pp. 361–374 (1962).

    Article  MATH  MathSciNet  Google Scholar 

  13. Magnus, A., “Expansion of power series into P-fractions,” Math. Z., 80, pp. 209–216 (1962).

    Article  MATH  MathSciNet  Google Scholar 

  14. Massey, J.L., “Shift register synthesis and BCH decoding,” IEEE Trans. on Information Theory, IT-15, pp. 122–127 (1969).

    Google Scholar 

  15. Padé, H., “Sur la représentation approchée d’une fonction par les fractions rationelles,” Ann. Sci. Ecole Norm. Super., 9, pp. 1–92 (1892).

    Google Scholar 

  16. Reeds, J.A. and Sloane, N.J.A., “Shift Register Synthesis Modulo m,” SIAM.1. Computation, (1984).

    Google Scholar 

  17. Sain, M.K., “Minimal torsion spaces and the partial input/output problem,” Information and Control, 29, pp. 103–124 (1975).

    Article  MATH  MathSciNet  Google Scholar 

  18. Stieltjes, T.J., “Recherches sur les fractions continues,” Ann. Fac. Sci. Toulouse Sci. Math. Sci. Phys., 8, (1894).

    Google Scholar 

  19. Welch, L.R. and, R.A. Scholtz, “Continued Fractions and Berlekamp’s Algorithm,” IEEE Trans. Information Theory, IT-25, pp. 19–27 (1979).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, Rice University, Houston, Texas, 77251-1892, USA

    A. C. Antoulas

Authors
  1. A. C. Antoulas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut National de Recherche en Informatique et en Automatique, INRIA, Domaine de Voluceau, Rocquencourt, B.P. 105, 78153, Le Chesnay, France

    A. Bensoussan  & J. L. Lions  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer Science+Business Media Dordrecht

About this paper

Cite this paper

Antoulas, A.C. (1986). On Recursiveness and Related Topics in Linear Systems: A Summary. In: Bensoussan, A., Lions, J.L. (eds) Analysis and Optimization of Systems. Lecture Notes in Control and Information Sciences, vol 83. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0007590

Download citation

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

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-39856-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation