Related papers: Computing Invariant Zeros of a Linear System Using…
Poles of a multi-input multi-output (MIMO) linear system can be computed by solving an eigenvalue problem; however, the problem of computing its invariant zeros is equivalent to a generalized eigenvalue problem. This paper revisits the…
The poles and zeros of a transfer function can be studied by various means. The main motivation of the present paper is to give a state-space description of the module theoretic definition of zeros introduced and analyzed by Wyman et al.…
In the paper we consider the invariant zero assignment problem in a linear multivariable system with several inputs/outputs by constructing a system output matrix. The problem is reduced to the pole assignment problem by a state feedback…
The non-commutative nature of quantum mechanics imposes fundamental constraints on system dynamics, which in the linear realm are manifested by the physical realizability conditions on system matrices. These restrictions endow system…
This paper extends the concept of scalar cepstrum coefficients from single-input single-output linear time invariant dynamical systems to multiple-input multiple-output models, making use of the Smith-McMillan form of the transfer function.…
SISO passive systems with just one type of memory/storage element (either only inductive or only capacitative) are known to have real poles and zeros, and further, with the zeros interlacing poles (ZIP). Due to a variety of definitions of…
In this paper, a linear univariate representation for the roots of a zero-dimensional polynomial equation system is presented, where the roots of the equation system are represented as linear combinations of roots of several univariate…
Pole-zero identification refers to the obtaining of the poles and zeros of a linear (or linearized) system described by its frequency response. This is usually done using optimization techniques (such as least squares, maximum likelihood…
The normal form and zero dynamics are powerful tools useful in analysis and control of both linear and nonlinear systems. There are no simple closed form solutions to the general zero dynamics problem for nonlinear systems. A few algorithms…
In this paper, we develop a new deflation technique for refining or verifying the isolated singular zeros of polynomial systems. Starting from a polynomial system with an isolated singular zero, by computing the derivatives of the input…
This note presents some numerical examples worked out in order to show the reader how to implement, within a widely accessible computational setting, the methodology for achieving zero cancellation in linear multivariable systems discussed…
Using the local geometrical properties of a given zero-dimensional square multivariate nonlinear system inside a box, we provide a simple but effective and new criterion for the uniqueness and the existence of a real simple zero of the…
An approach is proposed for bounding the number of zeros that solutions of linear differential systems with polynomial coefficients may have. A bound is obtained in a special case which improves upon currently existing.
This paper provides a novel approach for finding sparse state-space realizations of linear systems (e.g., controllers). Sparse controllers are commonly used in distributed control, where a controller is synthesized with some sparsity…
We here characterize the minimality of realization of arbitrary linear time-invariant dynamical systems through (i) intersection of the spectra of the realization matrix and of the corresponding state submatrix and (ii) moving the poles by…
On the basis of the generalized argument principle, here we develop a numerical scheme for locating zeros and poles of a meromorphic function. A subdivision-transformation-calculation scheme is proposed to ensure the algorithm stability. A…
Zeros of rational transfer function matrices $R(\lambda)$ are the eigenvalues of associated polynomial system matrices $P(\lambda)$, under minimality conditions. In this paper we define a structured condition number for a simple eigenvalue…
Consider a higher order state space system and the aim of this paper is to linearize the system preserving system characteristics. That is, linearization preserving system characteristics(e.g, controllability, observability, various zeros…
Given a polynomial system f associated with a simple multiple zero x of multiplicity {\mu}, we give a computable lower bound on the minimal distance between the simple multiple zero x and other zeros of f. If x is only given with limited…
State space is widely used for modeling power systems and analyzing their dynamics but it is limited to representing causal and proper systems in which the number of zeros does not exceed the number of poles. In other words, the system…