We introduce generalized Fiedler pencil with repetition(GFPR) for an n × n rational matrix function G(λ) relative to a realization of G(λ). We show that a GFPR is a linearization… Click to show full abstract
We introduce generalized Fiedler pencil with repetition(GFPR) for an n × n rational matrix function G(λ) relative to a realization of G(λ). We show that a GFPR is a linearization of G(λ) when the realization of G(λ) is minimal and describe recovery of eigenvectors of G(λ) from those of the GFPRs. In fact, we show that a GFPR allows operation-free recovery of eigenvectors of G(λ).We describe construction of a symmetric GFPR when G(λ) is symmetric. We also construct GFPR for the Rosenbrock system matrix S(λ) associated with an linear time-invariant (LTI) state-space system and show that the GFPR are Rosenbrock linearizations of S(λ). We also describe recovery of eigenvectors of S(λ) from those of the GFPR for S(λ). Finally, We analyze operation-free Symmetric/self-adjoint structure Fiedler pencils of system matrix S(λ) and rational matrix G(λ). We show that structure pencils are linearizations of G(λ).
               
Click one of the above tabs to view related content.