Abstract
The main advantage of minimal realization procedures related to balancing is that the determination of the order of the minimal realization relies on a single, numerically reliable, rank decision. Moreover, usually the same procedures can be also used to compute reduced order approximations of the given system. The paper presents eight minimal realization methods related to balancing techniques and compares their numerical performances. New derivations for some existing methods are provided and several new methods are suggested. The performed numerical tests confirm the superiority of recently developed square-root methods over other existing methods.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Barraud, A.Y., 1977, Numerical algorithms to solve A'XA-X = Q, IEEE Trans. Autom. Contr., 22, 883–885.
Bartels, R.H., and Stewart, G.W., 1972, Algorithm 432: Solution of the matrix equation AX + XB = C, Comm. ACM, 15, 820–826.
Bavely, C., and Stewart, G.W., 1979, An algorithm for computing reducing subspace by blockdiagonalization, SIAM J. Numer. Anal., 16, 359–367.
Glover, K., 1984, All optimal Hankel-norm approximations of linear multivariable systems and their L∞-error bounds, Int. J. Control 39, 1115–1193.
Hammarling, S.J., 1982, Numerical solution of the stable, non-negative definite Lyapunov equation, IMA J. Numer. Anal, 2, 303–323.
Kitagawa, G., 1977, An algorithm for solving the matrix equation X = FXF' + S, Int. J. Contr., 25, 745–753.
Laub, A.J., On computing “balancing” transformations, Proc. 1980 Joint Automat. Contr. Conf., San Francisco, CA, Aug. 1980, Session FA8-E.
Moler, C.B., Little, J.N., Bangert, S.N., and Kleinman, S., 1985, PC-MATLAB User's Guide (The Mathworks, Inc., Sherborn, MA.)
Moore, B.C., 1981, Principal component analysis in linear systems: controllability, observability and model reduction, IEEE Trans. Autom. Contr., 26, 17–32.
Safonov, M.G., and Chiang, R.Y., 1989, A Schur method for balanced-truncation model reduction, IEEE Trans. Autom. Contr., 34, 729–733.
Tombs, M.S., and Postlethwaite, I., 1987, Truncated balanced realization of a stable non-minimal state-space system, Int. J. Contr., 46, 1319–1330.
Van Dooren, P., 1981, The generalized eigenstructure problem in linear system theory, IEEE Trans. Autom. Contr., 26, 111–129.
Varga, A., 1981, Numerically stable algorithm for standard controllability form determination, Electron. Lett., 17, 74–75; 1990, A note on Hammarling's algorithm for the discrete Lyapunov equation, Syst. Contr. Lett., 15, 273–275; 1991, Efficient minimal realization procedure based on balancing, Preprints of IMACS Symp. on Modelling and Control of Technological Systems, Lille, France, May 1991.
Varga, A., and Ionescu, V., 1991, HTOOLS — A Toolbox for solving H∞ and H2 synthesis problems, Preprints of 5-th IFAC/IMACS Symp. on Computer Aided Design of Control Systems, Swansea, July 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Varga, A. (1992). Minimal realization procedures based on balancing and related techniques. In: Pichler, F., Díaz, R.M. (eds) Computer Aided Systems Theory — EUROCAST '91. EUROCAST 1991. Lecture Notes in Computer Science, vol 585. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0021056
Download citation
DOI: https://doi.org/10.1007/BFb0021056
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55354-0
Online ISBN: 978-3-540-47034-2
eBook Packages: Springer Book Archive