On the Realization Theory of Polynomial Matrices and the Algebraic Structure of Pure Generalized State Space Systems A.I.G. Vardulakis, N.P. Karampetakis.

Slides:



Advertisements
Similar presentations
Chapter 6 Matrix Algebra.
Advertisements

Vector Spaces A set V is called a vector space over a set K denoted V(K) if is an Abelian group, is a field, and For every element vV and K there exists.
Shuijing Crystal Li Rice University Mathematics Department 1 Rational Points on del Pezzo Surfaces of degree 1 and 2.
Properties of State Variables
RATRIX : A RATional matRIX calculator for computer aided analysis and synthesis of linear multivariable control systems P. Tzekis, N.P. Karampetakis and.
© Goodwin, Graebe, Salgado, Prentice Hall 2000 Chapter7 Synthesis of SISO Controllers.
I. Homomorphisms & Isomorphisms II. Computing Linear Maps III. Matrix Operations VI. Change of Basis V. Projection Topics: Line of Best Fit Geometry of.
An equivalent reduction of a 2-D symmetric polynomial matrix N. P. Karampetakis Department of Mathematics Aristotle University of Thessaloniki Thessaloniki.
Chapter 6 Eigenvalues.
5.II. Similarity 5.II.1. Definition and Examples
Multivariable Control Systems
Ch 7.3: Systems of Linear Equations, Linear Independence, Eigenvalues
Multivariable Control Systems
On the Solution of the General Singular Model of 2-D Systems Nikos Karampetakis Department of Mathematics, Aristotle University of Thessaloniki, Thessaloniki.
N. Karampetakis, S. Vologiannidis
5.IV. Jordan Form 5.IV.1. Polynomials of Maps and Matrices 5.IV.2. Jordan Canonical Form.
A DESCRIPTOR SYSTEMS PACKAGE FOR MATHEMATICA
4 4.6 © 2012 Pearson Education, Inc. Vector Spaces RANK.
MOHAMMAD IMRAN DEPARTMENT OF APPLIED SCIENCES JAHANGIRABAD EDUCATIONAL GROUP OF INSTITUTES.
Control Systems and Adaptive Process. Design, and control methods and strategies 1.
Digital Control Systems
5. Similarity I.Complex Vector Spaces II.Similarity III.Nilpotence IV.Jordan Form Topics Goal: Given H = h B → B, find D s.t. K = h D → D has a simple.
On the fundamental matrix of the inverse of a polynomial matrix and applications N. P. Karampetakis S. Vologiannidis Department of Mathematics Aristotle.
F.B. Yeh & H.N. Huang, Dept. of Mathematics, Tunghai Univ Nov.8 Fang-Bo Yeh and Huang-Nan Huang Department of Mathematic Tunghai University The 2.
Multivariable Control Systems
Chapter 3 Limits and the Derivative
1 MAC 2103 Module 10 lnner Product Spaces I. 2 Rev.F09 Learning Objectives Upon completing this module, you should be able to: 1. Define and find the.
Boyce/DiPrima 9th ed, Ch 7.3: Systems of Linear Equations, Linear Independence, Eigenvalues Elementary Differential Equations and Boundary Value Problems,
GROUPS & THEIR REPRESENTATIONS: a card shuffling approach Wayne Lawton Department of Mathematics National University of Singapore S ,
Linear Algebra/Eigenvalues and eigenvectors. One mathematical tool, which has applications not only for Linear Algebra but for differential equations,
1 MAC 2103 Module 9 General Vector Spaces II. 2 Rev.F09 Learning Objectives Upon completing this module, you should be able to: 1. Find the coordinate.
Chapter 5: The Orthogonality and Least Squares
Linear Algebra (Aljabar Linier) Week 10 Universitas Multimedia Nusantara Serpong, Tangerang Dr. Ananda Kusuma
Controllability and Observability
INTRODUCTORY MATHEMATICAL ANALYSIS For Business, Economics, and the Life and Social Sciences  2007 Pearson Education Asia Chapter 10 Limits and Continuity.
MA5242 Wavelets Lecture 3 Discrete Wavelet Transform Wayne M. Lawton Department of Mathematics National University of Singapore 2 Science Drive 2 Singapore.
Today’s Goal: Proof of Extension Theorem If a partial solution fails to extend, then Corollary. If is constant for some i, then all partial solutions extend.
§10.2 Infinite Limits and Limits at Infinity
Chapter 2 Nonnegative Matrices. 2-1 Introduction.
2.4 Irreducible Matrices. Reducible is reducible if there is a permutation P such that where A 11 and A 22 are square matrices each of size at least one;
4 4.6 © 2012 Pearson Education, Inc. Vector Spaces RANK.
Eigenvectors and Linear Transformations Recall the definition of similar matrices: Let A and C be n  n matrices. We say that A is similar to C in case.
Chap. 5 Inner Product Spaces 5.1 Length and Dot Product in R n 5.2 Inner Product Spaces 5.3 Orthonormal Bases: Gram-Schmidt Process 5.4 Mathematical Models.
2 2.9 © 2016 Pearson Education, Inc. Matrix Algebra DIMENSION AND RANK.
3.4 Introduction to Eigenvalues
4.8 Rank Rank enables one to relate matrices to vectors, and vice versa. Definition Let A be an m  n matrix. The rows of A may be viewed as row vectors.
Lesson 7 Controllability & Observability Linear system 1. Analysis.
Linear Algebra Engineering Mathematics-I. Linear Systems in Two Unknowns Engineering Mathematics-I.
5 Systems of Linear Equations and Matrices
3.8 Complex Zeros; Fundamental Theorem of Algebra
Pole Placement and Decoupling by State Feedback
§3-3 realization for multivariable systems
Mathematical Descriptions of Systems
§2-3 Observability of Linear Dynamical Equations
Static Output Feedback and Estimators
§1-3 Solution of a Dynamical Equation
§3-2 Realization of single variable systems
§1-2 State-Space Description
Limits and Continuity A BRIEF PREVIEW OF CALCULUS: TANGENT LINES AND THE LENGTH OF A CURVE 1.2 THE CONCEPT OF LIMIT 1.3 COMPUTATION OF LIMITS 1.4.
8. Stability, controllability and observability
Controllability and Observability of Linear Dynamical Equations
Synthesis of SISO Controllers
Chapter 3 Canonical Form and Irreducible Realization of Linear Time-invariant Systems.
Note Please review 組合矩陣理論筆記(4) 1-3 about
Linear Algebra Lecture 24.
Quantum Foundations Lecture 2
§1—2 State-Variable Description The concept of state
RAYAT SHIKSHAN SANSTHA’S S.M.JOSHI COLLEGE, HADAPSAR, PUNE
§3-2 Realization of single variable systems
Presentation transcript:

On the Realization Theory of Polynomial Matrices and the Algebraic Structure of Pure Generalized State Space Systems A.I.G. Vardulakis, N.P. Karampetakis and E.N. Antoniou Department of Mathematics Faculty of Sciences Aristotle University of Thessaloniki Thessaloniki , Greece

Introduction  Review of the Realization Theory of Polynomial Transfer Function Matrices via “Pure" Generalized State Space Models  Study of associated concepts and features  Comparison to results from the classical State Space realization theory  Key topics: Generalized order of GSS realizations Cancellations of decoupling zeros at ∞ Irreducibility at infinity & Minimality Dynamic & Non-dynamic variables Isomorphism of spectral structures at ∞ A.I.G. Vardulakis, N.P. Karampetakis, E.N. Antoniou – Dept. of Mathematics - Aristotle University of Thessaloniki

Introduction Given a polynomial transfer function matrix One may obtain its generalized state space realization of the form: and nilpotent, where Such that A.I.G. Vardulakis, N.P. Karampetakis, E.N. Antoniou – Dept. of Mathematics - Aristotle University of Thessaloniki

Introduction Remark. A GSS realization of a polynomial matrix A(s) can be obtained from a state space realization of the strictly proper rational matrix A.I.G. Vardulakis, N.P. Karampetakis, E.N. Antoniou – Dept. of Mathematics - Aristotle University of Thessaloniki Example. Given where then

Generalized Order of a GSS Realization A.I.G. Vardulakis, N.P. Karampetakis, E.N. Antoniou – Dept. of Mathematics - Aristotle University of Thessaloniki Definition. Let be GSS realization of A(s). The generalized order f g of Σ g is defined as follows: where δ Μ (.) denotes the McMillan degree. Example. Notice that the generalized order of the example in the previous slide is f g =3.

Irreducibility at infinity A.I.G. Vardulakis, N.P. Karampetakis, E.N. Antoniou – Dept. of Mathematics - Aristotle University of Thessaloniki Let and let be a GSS realization of A(s) Definition. The input decoupling zeros (i.d.z.) at s= ∞ of Σ g are defined as the zeros at s= ∞ of the pencil: Respectively, the output decoupling zeros (o.d.z.) at s= ∞ of Σ g are defined as the zeros at s= ∞ of the pencil: Finally, the input-output decoupling zeros (i.o.d.z.) at s= ∞ of Σ g are the common zeros at s= ∞ of the pencils:

Irreducibility at infinity A.I.G. Vardulakis, N.P. Karampetakis, E.N. Antoniou – Dept. of Mathematics - Aristotle University of Thessaloniki Let where Then the Smith- McMillan form of the matrix pencil at s=∞ is

Irreducibility at infinity A.I.G. Vardulakis, N.P. Karampetakis, E.N. Antoniou – Dept. of Mathematics - Aristotle University of Thessaloniki Remark. Candidates for (i.d.z.) and (o.d.z) at s= ∞ of a GSS realization of of a polynomial matrix A(s) are the zeros at s=∞ of A(s) Example. Let i.e. A(s) has one pole at s=∞ of order q 1 =2 and no zeros at s= ∞ Continued…

Irreducibility at infinity A.I.G. Vardulakis, N.P. Karampetakis, E.N. Antoniou – Dept. of Mathematics - Aristotle University of Thessaloniki …Continued A GSS realization is with The generalized order of Σ g is Continued… J ∞3 C ∞1 C ∞2 C ∞3 J ∞1 J ∞2 B ∞1 B ∞2

Irreducibility at infinity A.I.G. Vardulakis, N.P. Karampetakis, E.N. Antoniou – Dept. of Mathematics - Aristotle University of Thessaloniki …Continued Continued… It can be seen that both have a zero of order 1 at s=∞, and thus Σ g has an i.d.z., an o.d.z. and i.o.d.z.at s=∞. Now since we may easily obtain a “smaller” GSS realization of A(s), by simply eliminating the “middle” blocks from Σ g,, with

Irreducibility at infinity A.I.G. Vardulakis, N.P. Karampetakis, E.N. Antoniou – Dept. of Mathematics - Aristotle University of Thessaloniki …Continued It can be seen that both have no zeros at s=∞, which leads to the following definition

Irreducibility at infinity A.I.G. Vardulakis, N.P. Karampetakis, E.N. Antoniou – Dept. of Mathematics - Aristotle University of Thessaloniki Let and be a GSS realization of A(s) with J ∞ in Jordan normal form. Then: Corollary. (i) has no zeros at s=∞, iff (ii) has no zeros at s=∞, iff Definition. A GSS realization of a polynomial matrix A(s) is called irreducible at s=∞, iff has no input and no output decoupling zeros at s= ∞.

Minimal GSS realizations of a polynomial matrix A.I.G. Vardulakis, N.P. Karampetakis, E.N. Antoniou – Dept. of Mathematics - Aristotle University of Thessaloniki Definition. A GSS realization of a polynomial matrix A(s) is called minimal, iff it has the least number of generalized states. Theorem. Let be the Smith – McMillan form of A(s) at s=∞. A GSS realization of A(s), with J ∞ in Jordan canonical form is minimal iff:

Minimal GSS realizations of a polynomial matrix A.I.G. Vardulakis, N.P. Karampetakis, E.N. Antoniou – Dept. of Mathematics - Aristotle University of Thessaloniki Remark. (i)A necessary condition for the minimality of a GSS realization is must be irreducible at s=∞ must not have non-dynamic variables (ii)The least dimension of a GSS realization is Where q i are the non-zero orders of the poles at s=∞, of A(s). Corollary. A GSS realization of a polynomial matrix A(s) is a minimal GSS realization iff it is an irreducible at s= ∞ GSS realization and has no non-dynamic variables.

Minimal GSS realizations of a polynomial matrix A.I.G. Vardulakis, N.P. Karampetakis, E.N. Antoniou – Dept. of Mathematics - Aristotle University of Thessaloniki Example. Continuing the previous example, an irreducible at infinity GSS realization of A(s), was Obviously this realization is not minimal, since the expected least dimension of a GSS realization of A(s) should be (Recall that ) Continued…

Minimal GSS realizations of a polynomial matrix A.I.G. Vardulakis, N.P. Karampetakis, E.N. Antoniou – Dept. of Mathematics - Aristotle University of Thessaloniki This realization Σ g can be further reduced by moving its non-dynamic variables, from the state vector to the D ∞ matrix. The resulting minimal GSS realization is then given by …Continued

Minimal GSS realizations of a polynomial matrix A.I.G. Vardulakis, N.P. Karampetakis, E.N. Antoniou – Dept. of Mathematics - Aristotle University of Thessaloniki Proposition. Let A(s) be a column proper polynomial matrix with column degrees where are the columns of A(s). Then an irreducible at s=∞ GSS realization of A(s) can be obtained by inspection and is given by:

Minimal GSS realizations of a polynomial matrix A.I.G. Vardulakis, N.P. Karampetakis, E.N. Antoniou – Dept. of Mathematics - Aristotle University of Thessaloniki Theorem. Let be the Smith-McMillan form at s=∞ of A(s). If the GSS realization is irreducible at s=∞ then the zero structure at is isomorphic to the zero structure of the GSS Rosenbrock system matrix and its Smith-McMillan form at s=∞ is given by

Conclusions  We have investigated the mechanism of cancellations of zeros at s=∞.  We discussed the concepts of irreducibility and minimality of pure GSS realization.  The role of dynamic and non-dynamic variables has been examined.  The isomorphism between zeros at s=∞ of the "infinite pole pencil" and the Rosenbrock system matrix has been presented. A.I.G. Vardulakis, N.P. Karampetakis, E.N. Antoniou – Dept. of Mathematics - Aristotle University of Thessaloniki