Abstract
In Chapters 6 through 10 we saw how the distance formulas and factorization theorems described in Chapter 3 provided an elegant framework for the formulation and solution of problems relating to stabilization and robustness of linear time-varying systems. Here we consider a problem that has its origins in classical network theory. A network is characterized as a stable linear systems as defined in Section 5.5.Sis passive ifI — S*S≥ 0, and lossless ifI — S*S= 0. In operator theoretic terminology, passive systems are contractions, ‖S‖ ≤ 1, and lossless systems are isometries.
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, Notes, and Remarks
Feintuch, A., Markus, A., The lossless embedding problem for time-varying contractive systemsSystem Control Lett.28 (1996), 181–187.
Feintuch, A., Markus, A., Isometric dilations in nest algebrasIntegral Equations and Operator Theory26 (1996), 346–352.
Halmos, P.A Hilbert Space Problem BookPrinceton, Van Nostrand, 1967.
Saeks, R., Synthesis of general linear networksSIAM J. Appl. Math.18 (1968), 924–930.
van der Veen, A., De Wilde, P., Embedding of time-varying contractive systems in lossless realizationsMCSS7 (1994), 306–330.
Arov, D. Z., Darlington’s method for dissipative systemsSoviet PhysicsDoklady16,11 (1972), 954–956.
Douglas, R. G. and Helton J.W., Inner dilations of analytic matrix functions and Darlington synthesisActa Szeged34 (1973), 301–310.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Feintuch, A. (1998). Orthogonal Embedding of Time-Varying Systems. In: Robust Control Theory in Hilbert Space. Applied Mathematical Sciences, vol 130. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-0591-3_11
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0591-3_11
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-6829-1
Online ISBN: 978-1-4612-0591-3
eBook Packages: Springer Book Archive