This thesis presents the formulation and solution of a new problem in systems and control theory, called the Network Realization Problem. Its relationship to other problems, such as State Realization and Structural Identifiability, is shown. The motivation for this work is the desire to completely quantify the conditions for transitioning between different mathematical representations of linear time-invariant systems. The solution to this problem is useful for theorists because it lays a foundation for quantifying the information cost of identifying a system's complete network structure from the transfer function.
| Identifer | oai:union.ndltd.org:BGMYU2/oai:scholarsarchive.byu.edu:etd-5135 |
| Date | 24 June 2014 |
| Creators | Paré, Philip E., Jr. |
| Publisher | BYU ScholarsArchive |
| Source Sets | Brigham Young University |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | Theses and Dissertations |
| Rights | http://lib.byu.edu/about/copyright/ |
Page generated in 0.0019 seconds