Abstract
In this chapter the notion of a minimal node is considered. If two nodes are similar, then they have the same transfer function. The converse statement is not true. In fact nodes with rather different state spaces may have the same transfer function. For minimal nodes this phenomenon does not occur. In Section 3.1 minimal nodes are defined. In the finite dimensional case the connection between a minimal node 6 and its transfer function Wθ is very close. For example in that case 9 is determined up to similarity by Wθ. Also in that case the poles and zeros of Wθ . determine completely the eigenvalue structure of the main operator and associate main operator of 6, respectively. This will be explained in Section 3–2. In Section 3.3 the notion of minimality is considered for Brodskii nodes, Krein nodes, monic nodes and polynomial nodes.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1979 Springer Basel AG
About this chapter
Cite this chapter
Bart, H., Gohberg, I., Kaashoek, M.A. (1979). Minimal Nodes. In: Minimal Factorization of Matrix and Operator Functions. Operator Theory: Advances and Applications, vol 1. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-6293-6_4
Download citation
DOI: https://doi.org/10.1007/978-3-0348-6293-6_4
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-7643-1139-1
Online ISBN: 978-3-0348-6293-6
eBook Packages: Springer Book Archive