Abstract
An algorithm is presented for the solution of the minimal Padé-sense matrix approximation problem around s = 0 and s = ∞ or what is called in linear system theory, the minimal partial realization problem with Markov parameters and time moments. It gives a solution in the form of a polynomial matrix fraction. The algorithm is a generalization of the Berlekamp-Massey algorithm for the scalar case [1,2,7]. Our approach is mainly based on the work of Dickinson, Morf and Kailath who treated the problem with Markov parameters only [6]. Y. Bistritz [3,4,5] gives a solution of the above problem in a state space setting and refers to [6] for a polynomial approach. However an extra condition should be imposed on the solution as will be shown in this paper. Our main tool is the construction of a nested basis for the null spaces of block Hankel matrices. The proof of the algorithm and other aspects of the minimal partial realization can be found in [8]. We only give the main result.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E.R. Berlekamp: ‘Nonbiliary BCH decoding’, International symposium on Information Theory, San Remo, Italy (1962).
E.R. Berlekamp: Algebraic coding theory, McGraw-Hill, New York, chapts 7 and 10(1968).
Y. Bistrttz: ‘Nested bases of invariants for minimal realizations of finite matrix sequences’, SIAM J. Control Opt., 21, 804–821 (1983).
Y. Bistrttz, U. Shared: ‘Discrete multivariable system approximations by minimal Padé type state models’, IEEE Trans. Circuits and Systems, CAS-31, 382–390 (1984).
Y. Bistrttz, U.Shaked:’Minimal Padé model reduction for multivariable systems’, Journal of Dynamic Systems, Measurement, and Control, 106, 293–299 (1984).
B.W. Dickinson, M. Morf, T. Kailath: ‘A minimal realization algorithm for matrix sequences’, IEEE Trans. Autom. Control, AC-19, 31–38 (1974).
J.L. Massey: ‘Shift register synthesis and BCH decoding’, IEEE Trans. Information Theory, IT-15, 122–127 (1969).
M. Van Barel, A. Bultheel: A minimal partial realization algorithm for MIMO systems, Report TW79, Katholieke Universiteit Leuven, Department of Computer Science (July 1986, revised: April 1987).
M. Van Barel, A. Bultheel: A minimal partial realization algorithm for MIMO systems III. A parametrization of all solutions, Report TW93, Katholieke Universiteit Leuven, Department of Computer Science (August 1987).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 D. Reidel Publishing Company
About this chapter
Cite this chapter
Van Barel, M., Bultheel, A. (1988). Minimal Pade-Sense Matrix Approximations Around s = 0 and s = ∞. In: Cuyt, A. (eds) Nonlinear Numerical Methods and Rational Approximation. Mathematics and Its Applications, vol 43. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-2901-2_8
Download citation
DOI: https://doi.org/10.1007/978-94-009-2901-2_8
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-7807-8
Online ISBN: 978-94-009-2901-2
eBook Packages: Springer Book Archive