Abstract
A brief review is given of the solution of the scalar partial realisation problem using Padé approximants. The use of simultaneous Padé approximants in the solution of the single input, multi-output partial realisation problem is then discussed. We show how analogues of Frobenius identities are derived for simultaneous Padé approximants of two series, and we give twelve such identities. We show how some of these identities are combined to construct analogues of Baker’s and Kronecker’s algorithms. These analogues are fast algorithms for simultaneous Padé approximation of two series, and so also for a solution of the single input, two output partial realisation problem.
Keywords
- Single Input
- Degree Reduction
- Reliable Algorithm
- Markov Parameter
- Denominator Polynomial
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aitken, A.C., Determinants and Matrices, Oliver and Boyd (1959).
Baker, G.A. Jr., Essentials of Padé Approximants, Academic Press (New York, 1975).
Baker, G.A. Jr. and Graves-Morris, P.R., Padé Approximants Part I in Encyclopedia of Mathematics, 13 (Addison-Wesley, 1981).
Brent, R.P., Gustavson, F.G. and Yun, D.Y.Y., Fast Solution of Toeplitz Systems of Equations and Computation of Padé Approximants, J. Algorithms 1, (1980), 259–295.
de Bruin, M.G., Generalised C-Fractions and a Multi-dimensional Padé Table, Thesis, Amsterdam University (1974).
de Bruin, M.G., Generalised Padé Tables and Some Algorithms Therein, in Proceedings of First French-Polish Meeting on Padé Approximation and Convergence Acceleration Techniques ed. J. Gilewicz CNRS (Marseille, 1982), 1–10.
de Bruin, M.G., Zeros of Polynomials Generated by 4-Term Recurrence Relations, in Rational Approximation and Interpolation eds. P.R. Graves-Morris, E.B. Saff and R.S. Varga, Springer (Heidelberg, 1984) 331–345.
Bultheel, A., Division Algorithms for Continued Fractions and the Pade Table, J. Comp. Appld. Math. 6, (1980), 259–266.
Bultheel, A. and van Barel, M., Padé Techniques for Model Reduction in Linear System Theory: a Survey, J. Comp. Appld. Math. 14, (1986), 401–438.
Gragg, W.B. and Lindquist, A., On the Partial Realisation Problem, Lin. Alg. and its Applcns. 50, (1983), 277–319.
Graves-Morris, P.R., The Numerical Calculation of Padé Approximants, in Padé Approximation and its Applications, ed. L. Wuytack, Springer (Heidelberg, 1980), 231–245.
Graves-Morris, P.R., Toeplitz Equations and Kronecker’s Algorithm, C.S.S.P. 1, (1982), 289–304.
Graves-Morris, P.R., Vector-valued Rational Interpolants II, IMA J. Numer. Analy. 4, (1984), 209–224.
Kailath, T., Linear Systems, Prentice-Hall (1980).
Kalman, R.E., On Minimal Partial Realizations of a Linear Input/Output Map, in Aspects of Network and Systems Theory, eds. R.E. Kalman and N. de Claris, Holt, Reinhart and Winston (1971), 385–407.
McEliece, R.J. and Shearer, J.B., A Property of Euclid’s Algorithm and an Application to Padé Approximation, SIAM J. Appl. Math. 34, (1978) 611–615.
MacWilliams, F.J. and Sloane, N.J.A., The theory of Error Correcting Codes, North-Holland (1983).
Massey, J.L., Shift-Register Synthesis and BCH Decoding, IEEE Trans. Info. Theory IT-15, (1969), 122–127.
Padé, H., Sur la Généralisation des Fractions Continues Algébriques, J. de Math. 10 (1894), 291–329.
Warner, D., Hermite Interpolation with Rational Functions, Thesis, University of California, (1974).
Wilkins, J.M., Thesis, University of Kent at Canterbury, in preparation. Postcript. Since original submission of this paper, we have become aware that J. van Iseghem has independently derived identity (B) in the same way. By combining it with the vector qd algorithm, she has derived an iterative construction of a different staircase sequence of denominator polynoials in the d-dimensional case [22].
van Iseghem, J., Thèse, Université de Lille, (1987); ICAM proceedings, (1987, in press).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer-Verlag
About this paper
Cite this paper
Graves-Morris, P.R., Wilkins, J.M. (1987). A fast algorithm to solve Kalman’s partial realisation problem for single input, multi-output systems. In: Saff, E.B. (eds) Approximation Theory, Tampa. Lecture Notes in Mathematics, vol 1287. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0078896
Download citation
DOI: https://doi.org/10.1007/BFb0078896
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18500-0
Online ISBN: 978-3-540-47991-8
eBook Packages: Springer Book Archive
