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.
College and Department
Physical and Mathematical Sciences; Computer Science
BYU ScholarsArchive Citation
Paré, Philip E. Jr., "Necessary and Sufficient Conditions for State-Space Network Realization" (2014). All Theses and Dissertations. 4136.
structural identifiability, system identification, linear time-invariant systems