Stationary trajectories, singular Hamiltonian systems and ill-posed Interconnection

Similar documents
The Kalman-Yakubovich-Popov Lemma for Differential-Algebraic Equations with Applications

6.241 Dynamic Systems and Control

Robust Control 2 Controllability, Observability & Transfer Functions

The norms can also be characterized in terms of Riccati inequalities.

Denis ARZELIER arzelier

Balancing of Lossless and Passive Systems

1. Find the solution of the following uncontrolled linear system. 2 α 1 1

Linear Hamiltonian systems

Zeros and zero dynamics

Stabilization and Passivity-Based Control

ME 234, Lyapunov and Riccati Problems. 1. This problem is to recall some facts and formulae you already know. e Aτ BB e A τ dτ

Control Systems. Frequency domain analysis. L. Lanari

1 Linear Algebra Problems

Dissipativity analysis of SISO systems using Nyquist-Plot-Compatible (NPC) supply rates

Iterative methods to compute center and center-stable manifolds with application to the optimal output regulation problem

Citation for published version (APA): Minh, H. B. (2009). Model Reduction in a Behavioral Framework s.n.

Problem Set 5 Solutions 1

Definite versus Indefinite Linear Algebra. Christian Mehl Institut für Mathematik TU Berlin Germany. 10th SIAM Conference on Applied Linear Algebra

Controllability, Observability, Full State Feedback, Observer Based Control

H 2 Optimal State Feedback Control Synthesis. Raktim Bhattacharya Aerospace Engineering, Texas A&M University

Model reduction for linear systems by balancing

Lecture 15: H Control Synthesis

Chap 4. State-Space Solutions and

POLYNOMIAL EMBEDDING ALGORITHMS FOR CONTROLLERS IN A BEHAVIORAL FRAMEWORK

Problem Set 4 Solution 1

On linear quadratic optimal control of linear time-varying singular systems

Intro. Computer Control Systems: F8

Multivariable Control. Lecture 03. Description of Linear Time Invariant Systems. John T. Wen. September 7, 2006

State Regulator. Advanced Control. design of controllers using pole placement and LQ design rules

Chapter 3. LQ, LQG and Control System Design. Dutch Institute of Systems and Control

CME 345: MODEL REDUCTION

Linear Quadratic Gausssian Control Design with Loop Transfer Recovery

SYSTEMTEORI - KALMAN FILTER VS LQ CONTROL

Approximation of the Linearized Boussinesq Equations

CDS Solutions to the Midterm Exam

Generic degree structure of the minimal polynomial nullspace basis: a block Toeplitz matrix approach

LQR, Kalman Filter, and LQG. Postgraduate Course, M.Sc. Electrical Engineering Department College of Engineering University of Salahaddin

Stability, Pole Placement, Observers and Stabilization

SYSTEMTEORI - ÖVNING Stability of linear systems Exercise 3.1 (LTI system). Consider the following matrix:

DISTANCE BETWEEN BEHAVIORS AND RATIONAL REPRESENTATIONS

Robust Multivariable Control

Introduction to Nonlinear Control Lecture # 4 Passivity

Optimization Based Output Feedback Control Design in Descriptor Systems

LQR and H 2 control problems

Structured eigenvalue/eigenvector backward errors of matrix pencils arising in optimal control

Suppose that we have a specific single stage dynamic system governed by the following equation:

18.06 Problem Set 8 - Solutions Due Wednesday, 14 November 2007 at 4 pm in

Linear System Theory

Lecture 5: Linear Systems. Transfer functions. Frequency Domain Analysis. Basic Control Design.

Problem Set (T) If A is an m n matrix, B is an n p matrix and D is a p s matrix, then show

3 Gramians and Balanced Realizations

Riccati Equations and Inequalities in Robust Control

Math 1060 Linear Algebra Homework Exercises 1 1. Find the complete solutions (if any!) to each of the following systems of simultaneous equations:

Introduction to Modern Control MT 2016

EL2520 Control Theory and Practice

Topic # Feedback Control Systems

Perturbation theory for eigenvalues of Hermitian pencils. Christian Mehl Institut für Mathematik TU Berlin, Germany. 9th Elgersburg Workshop

ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA

THE STABLE EMBEDDING PROBLEM

Stability of Feedback Solutions for Infinite Horizon Noncooperative Differential Games

Kalman Decomposition B 2. z = T 1 x, where C = ( C. z + u (7) T 1, and. where B = T, and

Network Reconstruction from Intrinsic Noise: Non-Minimum-Phase Systems

OPTIMAL CONTROL SYSTEMS

On Positive Real Lemma for Non-minimal Realization Systems

Lecture notes: Applied linear algebra Part 1. Version 2

Nonlinear Observers. Jaime A. Moreno. Eléctrica y Computación Instituto de Ingeniería Universidad Nacional Autónoma de México

Problem Set 2 Solutions 1

Raktim Bhattacharya. . AERO 632: Design of Advance Flight Control System. Norms for Signals and Systems

Port-Hamiltonian Realizations of Linear Time Invariant Systems

Topic # Feedback Control Systems

EL 625 Lecture 10. Pole Placement and Observer Design. ẋ = Ax (1)

Linear Quadratic Zero-Sum Two-Person Differential Games Pierre Bernhard June 15, 2013

SYSTEMTEORI - ÖVNING 5: FEEDBACK, POLE ASSIGNMENT AND OBSERVER

Linear Algebra Practice Problems

Realization theory for systems biology

Passivity Indices for Symmetrically Interconnected Distributed Systems

Stabilization, Pole Placement, and Regular Implementability

Generic degree structure of the minimal polynomial nullspace basis: a block Toeplitz matrix approach

Nonlinear Control Systems

16.31 Fall 2005 Lecture Presentation Mon 31-Oct-05 ver 1.1

Linear-quadratic control problem with a linear term on semiinfinite interval: theory and applications

Some New Results on Linear Quadratic Regulator Design for Lossless Systems

Semidefinite Programming Duality and Linear Time-invariant Systems

MIT Final Exam Solutions, Spring 2017

Grammians. Matthew M. Peet. Lecture 20: Grammians. Illinois Institute of Technology

A BEHAVIORAL APPROACH TO THE LQ OPTIMAL CONTROL PROBLEM

Singular-value-like decomposition for complex matrix triples

Subject: Optimal Control Assignment-1 (Related to Lecture notes 1-10)

Lecture 4 Continuous time linear quadratic regulator

MEM 355 Performance Enhancement of Dynamical Systems MIMO Introduction

On at systems behaviors and observable image representations

Maxwell Equations Waves Helmholtz Wave Equation Dirac Delta Sources Power Matrices Complex Analysis Optimization. EM & Math - Basics

Eigenvalue perturbation theory of classes of structured matrices under generic structured rank one perturbations

Control Design. Lecture 9: State Feedback and Observers. Two Classes of Control Problems. State Feedback: Problem Formulation

Control Systems. Laplace domain analysis

The Solvability Conditions for the Inverse Eigenvalue Problem of Hermitian and Generalized Skew-Hamiltonian Matrices and Its Approximation

Intro. Computer Control Systems: F9

Raktim Bhattacharya. . AERO 422: Active Controls for Aerospace Vehicles. Dynamic Response

Lecture 15 Review of Matrix Theory III. Dr. Radhakant Padhi Asst. Professor Dept. of Aerospace Engineering Indian Institute of Science - Bangalore

APPLIED LINEAR ALGEBRA

Transcription:

Stationary trajectories, singular Hamiltonian systems and ill-posed Interconnection S.C. Jugade, Debasattam Pal, Rachel K. Kalaimani and Madhu N. Belur Department of Electrical Engineering Indian Institute of Technology Guwahati, Indian Institute of Technology Bombay July 18, 2013 Pal,Kalaimani,Belur (IIT Bombay/Guwahati) ECC 2013 1 / 14

Outline Problem formulation: dual/adjoint system Main results: well-posed interconnection and the regular case Ill-posed interconnection & the singular case (descriptor system) Zeros at infinity, inadmissible initial conditions Necessary and sufficient conditions for no zeros at infinity (main result) Pal,Kalaimani,Belur (IIT Bombay/Guwahati) ECC 2013 2 / 14

Main issues concerned in this talk When is the interconnection of a system and its adjoint (dual) a well-posed interconnection? If ill-posed, when is the interconnection autonomous? al,kalaimani,belur (IIT Bombay/Guwahati) ECC 2013 3 / 14

Main issues concerned in this talk When is the interconnection of a system and its adjoint (dual) a well-posed interconnection? If ill-posed, when is the interconnection autonomous? Interconnection of system and its dual: kind-of stationary trajectories. al,kalaimani,belur (IIT Bombay/Guwahati) ECC 2013 3 / 14

Main issues concerned in this talk When is the interconnection of a system and its adjoint (dual) a well-posed interconnection? If ill-posed, when is the interconnection autonomous? Interconnection of system and its dual: kind-of stationary trajectories. Can the interconnection cause closed-loop to have al,kalaimani,belur (IIT Bombay/Guwahati) ECC 2013 3 / 14

Main issues concerned in this talk When is the interconnection of a system and its adjoint (dual) a well-posed interconnection? If ill-posed, when is the interconnection autonomous? Interconnection of system and its dual: kind-of stationary trajectories. Can the interconnection cause closed-loop to have impulsive initial conditions? Under what conditions will the closed-loop not have inadmissible initial conditions? al,kalaimani,belur (IIT Bombay/Guwahati) ECC 2013 3 / 14

Main issues concerned in this talk When is the interconnection of a system and its adjoint (dual) a well-posed interconnection? If ill-posed, when is the interconnection autonomous? Interconnection of system and its dual: kind-of stationary trajectories. Can the interconnection cause closed-loop to have impulsive initial conditions? Under what conditions will the closed-loop not have inadmissible initial conditions? Well-posed interconnection of a system and its adjoint gives d dt x = Hx with H: al,kalaimani,belur (IIT Bombay/Guwahati) ECC 2013 3 / 14

Main issues concerned in this talk When is the interconnection of a system and its adjoint (dual) a well-posed interconnection? If ill-posed, when is the interconnection autonomous? Interconnection of system and its dual: kind-of stationary trajectories. Can the interconnection cause closed-loop to have impulsive initial conditions? Under what conditions will the closed-loop not have inadmissible initial conditions? Well-posed interconnection of a system and its adjoint gives d dt x = Hx with H: a Hamiltonian matrix. al,kalaimani,belur (IIT Bombay/Guwahati) ECC 2013 3 / 14

Main issues concerned in this talk When is the interconnection of a system and its adjoint (dual) a well-posed interconnection? If ill-posed, when is the interconnection autonomous? Interconnection of system and its dual: kind-of stationary trajectories. Can the interconnection cause closed-loop to have impulsive initial conditions? Under what conditions will the closed-loop not have inadmissible initial conditions? Well-posed interconnection of a system and its adjoint gives d dt x = Hx with H: a Hamiltonian matrix. Analogue of Hamiltonian matrix for ill-posed case? al,kalaimani,belur (IIT Bombay/Guwahati) ECC 2013 3 / 14

Main issues concerned in this talk When is the interconnection of a system and its adjoint (dual) a well-posed interconnection? If ill-posed, when is the interconnection autonomous? Interconnection of system and its dual: kind-of stationary trajectories. Can the interconnection cause closed-loop to have impulsive initial conditions? Under what conditions will the closed-loop not have inadmissible initial conditions? Well-posed interconnection of a system and its adjoint gives d dt x = Hx with H: a Hamiltonian matrix. Analogue of Hamiltonian matrix for ill-posed case? Link with other singular Hamiltonian pencils? Skew-Hermitian Hermitian pencil? (Mehl, Mehrmann, Meerbergen, Watkins) al,kalaimani,belur (IIT Bombay/Guwahati) ECC 2013 3 / 14

Well-posed interconnection Systems B 1 and B 2 (with transfer functions G 1 & G 2 ) Call the interconnection of B 1 and B 2 d 1 u 1 y 1 G + 1 well-posed if + for each d 1, d 2 L loc 1, + y 2 u 2 there exist unique u 1, y 1, u 2 and y 2 L loc 1 G 2 such that d2 + Pal,Kalaimani,Belur (IIT Bombay/Guwahati) ECC 2013 4 / 14

Well-posed interconnection Systems B 1 and B 2 (with transfer functions G 1 & G 2 ) d 1 + u 1 G 1 y 1 well-posed if + for each d 1, d 2 L loc 1, Call the interconnection of B 1 and B 2 y 2 u + 2 d2 G 2 + such that the laws (G 1, G 2 and Σ s) are satisfied. there exist unique u 1, y 1, u 2 and y 2 L loc 1 Pal,Kalaimani,Belur (IIT Bombay/Guwahati) ECC 2013 4 / 14

Well-posed interconnection Systems B 1 and B 2 (with transfer functions G 1 & G 2 ) d 1 + u 1 G 1 y 1 well-posed if + for each d 1, d 2 L loc 1, Call the interconnection of B 1 and B 2 y 2 u + 2 d2 G 2 + such that the laws (G 1, G 2 and Σ s) are satisfied. there exist unique u 1, y 1, u 2 and y 2 L loc 1 Call the set of allowed trajectories of system 1 as behavior B 1 B 1 := {(u 1, y 1 ) y 1 = G 1 u 1 } Similarly, B 2 := {(y 2, u 2 ) y 2 = G 2 u 2 } Pal,Kalaimani,Belur (IIT Bombay/Guwahati) ECC 2013 4 / 14

Well-posed interconnection Systems B 1 and B 2 (with transfer functions G 1 & G 2 ) d 1 + u 1 G 1 y 1 well-posed if + for each d 1, d 2 L loc 1, Call the interconnection of B 1 and B 2 y 2 u + 2 d2 G 2 + such that the laws (G 1, G 2 and Σ s) are satisfied. there exist unique u 1, y 1, u 2 and y 2 L loc 1 Call the set of allowed trajectories of system 1 as behavior B 1 Similarly, For this talk: System its behavior B 1 := {(u 1, y 1 ) y 1 = G 1 u 1 } B 2 := {(y 2, u 2 ) y 2 = G 2 u 2 } Pal,Kalaimani,Belur (IIT Bombay/Guwahati) ECC 2013 4 / 14

Well-posed interconnection Systems B 1 and B 2 (with transfer functions G 1 & G 2 ) d 1 + u 1 G 1 y 1 well-posed if + for each d 1, d 2 L loc 1, Call the interconnection of B 1 and B 2 y 2 u + 2 d2 G 2 + such that the laws (G 1, G 2 and Σ s) are satisfied. there exist unique u 1, y 1, u 2 and y 2 L loc 1 Call the set of allowed trajectories of system 1 as behavior B 1 Similarly, For this talk: System its behavior B 1 := {(u 1, y 1 ) y 1 = G 1 u 1 } B 2 := {(y 2, u 2 ) y 2 = G 2 u 2 } Positive or negative feedback? Assume d 1 = 0 and d 2 = 0. Pal,Kalaimani,Belur (IIT Bombay/Guwahati) ECC 2013 4 / 14

Well-posed interconnection Interconnection of B 1 and B 2 : Pal,Kalaimani,Belur (IIT Bombay/Guwahati) ECC 2013 5 / 14

Well-posed interconnection Interconnection of B 1 and B 2 : trajectories need satisfy laws of both B 1 and B 2. Allowed trajectories of the closed loop system: intersection B 1 B 2. Pal,Kalaimani,Belur (IIT Bombay/Guwahati) ECC 2013 5 / 14

Well-posed interconnection Interconnection of B 1 and B 2 : trajectories need satisfy laws of both B 1 and B 2. Allowed trajectories of the closed loop system: intersection B 1 B 2. In this talk, B 2 is the adjoint/dual system of B 1. What is the adjoint of a system (in behavioral sense)? Pal,Kalaimani,Belur (IIT Bombay/Guwahati) ECC 2013 5 / 14

Well-posed interconnection Interconnection of B 1 and B 2 : trajectories need satisfy laws of both B 1 and B 2. Allowed trajectories of the closed loop system: intersection B 1 B 2. In this talk, B 2 is the adjoint/dual system of B 1. What is the adjoint of a system (in behavioral sense)? Consider behaviors B 1 and B 2 C (R, R w ) and Σ = B 1 and B 2 are called Σ-orthogonal if [ ] I 0. 0 I w T 1 Σw 2 dt = 0 for all w 1 B 1 and w 2 B 2. Pal,Kalaimani,Belur (IIT Bombay/Guwahati) ECC 2013 5 / 14

Well-posed interconnection Interconnection of B 1 and B 2 : trajectories need satisfy laws of both B 1 and B 2. Allowed trajectories of the closed loop system: intersection B 1 B 2. In this talk, B 2 is the adjoint/dual system of B 1. What is the adjoint of a system (in behavioral sense)? Consider behaviors B 1 and B 2 C (R, R w ) and Σ = B 1 and B 2 are called Σ-orthogonal if [ ] I 0. 0 I w T 1 Σw 2 dt = 0 for all w 1 B 1 and w 2 B 2. Above integrals could be undefined: restrict each of B 1 and B 2 to just the compactly supported trajectories, i.e. D. Pal,Kalaimani,Belur (IIT Bombay/Guwahati) ECC 2013 5 / 14

Well-posed interconnection Interconnection of B 1 and B 2 : trajectories need satisfy laws of both B 1 and B 2. Allowed trajectories of the closed loop system: intersection B 1 B 2. In this talk, B 2 is the adjoint/dual system of B 1. What is the adjoint of a system (in behavioral sense)? Consider behaviors B 1 and B 2 C (R, R w ) and Σ = B 1 and B 2 are called Σ-orthogonal if [ ] I 0. 0 I w T 1 Σw 2 dt = 0 for all w 1 B 1 and w 2 B 2. Above integrals could be undefined: restrict each of B 1 and B 2 to just the compactly supported trajectories, i.e. D. (Controllability assumed throughout this talk) al,kalaimani,belur (IIT Bombay/Guwahati) ECC 2013 5 / 14

Well-posed interconnection Interconnection of B 1 and B 2 : trajectories need satisfy laws of both B 1 and B 2. Allowed trajectories of the closed loop system: intersection B 1 B 2. In this talk, B 2 is the adjoint/dual system of B 1. What is the adjoint of a system (in behavioral sense)? Consider behaviors B 1 and B 2 C (R, R w ) and Σ = B 1 and B 2 are called Σ-orthogonal if [ ] I 0. 0 I w T 1 Σw 2 dt = 0 for all w 1 B 1 and w 2 B 2. Above integrals could be undefined: restrict each of B 1 and B 2 to just the compactly supported trajectories, i.e. D. (Controllability assumed throughout this talk) For a controllable system B 1 C (R, R w ), define its Σ-orthogonal complement B Σ 1 as: B Σ 1 := {v C (R, R w ) w T Σv dt = 0 for all w B 1 D}. R al,kalaimani,belur (IIT Bombay/Guwahati) ECC 2013 5 / 14

Hamiltonian matrix B : ẋ = Ax + Bw 1 w 2 = Cx + Dw 1 B Σ : w 1, v 1 : inputs, w 2, v 2 : outputs. Interconnect B and B Σ : w 2 = v 1 and w 1 = v 2 ẋ A BB T BD T ż = 0 A T C T 0 C DB T I p DD T B B Σ is well-posed (I p DD T ) is nonsingular. ż = A T z C T v 1 v 2 = B T z + D T v 1 x z v 1 al,kalaimani,belur (IIT Bombay/Guwahati) ECC 2013 6 / 14

Hamiltonian matrix B : ẋ = Ax + Bw 1 w 2 = Cx + Dw 1 B Σ : w 1, v 1 : inputs, w 2, v 2 : outputs. Interconnect B and B Σ : w 2 = v 1 and w 1 = v 2 ẋ A BB T BD T ż = 0 A T C T 0 C DB T I p DD T ż = A T z C T v 1 v 2 = B T z + D T v 1 B B Σ is well-posed [ẋ (I p ] DD [ T ) ] is nonsingular. x Eliminating v 1, we get I 2n = H with H R ż z 2n 2n the Hamiltonian matrix: [ ] A + BD H = T (I p DD T ) 1 C BB T + BD T (I p DD T ) 1 DB T C T (I p DD T ) 1 C (A T + C T (I p DD T ) 1 DB T. ) x z v 1 al,kalaimani,belur (IIT Bombay/Guwahati) ECC 2013 6 / 14

Hamiltonian matrix B : ẋ = Ax + Bw 1 w 2 = Cx + Dw 1 B Σ : w 1, v 1 : inputs, w 2, v 2 : outputs. Interconnect B and B Σ : w 2 = v 1 and w 1 = v 2 ẋ A BB T BD T ż = 0 A T C T 0 C DB T I p DD T ż = A T z C T v 1 v 2 = B T z + D T v 1 B B Σ is well-posed [ẋ (I p ] DD [ T ) ] is nonsingular. x Eliminating v 1, we get I 2n = H with H R ż z 2n 2n the Hamiltonian matrix: [ ] A + BD H = T (I p DD T ) 1 C BB T + BD T (I p DD T ) 1 DB T C T (I p DD T ) 1 C (A T + C T (I p DD T ) 1 DB T. ) With small variations (due to the Σ-matrix), x z v 1 al,kalaimani,belur (IIT Bombay/Guwahati) ECC 2013 6 / 14

Hamiltonian matrix B : ẋ = Ax + Bw 1 w 2 = Cx + Dw 1 B Σ : w 1, v 1 : inputs, w 2, v 2 : outputs. Interconnect B and B Σ : w 2 = v 1 and w 1 = v 2 ẋ A BB T BD T ż = 0 A T C T 0 C DB T I p DD T ż = A T z C T v 1 v 2 = B T z + D T v 1 B B Σ is well-posed [ẋ (I p ] DD [ T ) ] is nonsingular. x Eliminating v 1, we get I 2n = H with H R ż z 2n 2n the Hamiltonian matrix: [ ] A + BD H = T (I p DD T ) 1 C BB T + BD T (I p DD T ) 1 DB T C T (I p DD T ) 1 C (A T + C T (I p DD T ) 1 DB T. ) With small variations (due to the Σ-matrix), H arises in LQ, LQG, H 2 and H -control problems. For LQ control, above trajectories are stationary : Willems, CDC-92. x z v 1 al,kalaimani,belur (IIT Bombay/Guwahati) ECC 2013 6 / 14

Hamiltonian matrix B : ẋ = Ax + Bw 1 w 2 = Cx + Dw 1 B Σ : w 1, v 1 : inputs, w 2, v 2 : outputs. Interconnect B and B Σ : w 2 = v 1 and w 1 = v 2 ẋ A BB T BD T ż = 0 A T C T 0 C DB T I p DD T ż = A T z C T v 1 v 2 = B T z + D T v 1 B B Σ is well-posed [ẋ (I p ] DD [ T ) ] is nonsingular. x Eliminating v 1, we get I 2n = H with H R ż z 2n 2n the Hamiltonian matrix: [ ] A + BD H = T (I p DD T ) 1 C BB T + BD T (I p DD T ) 1 DB T C T (I p DD T ) 1 C (A T + C T (I p DD T ) 1 DB T. ) With small variations (due to the Σ-matrix), H arises in LQ, LQG, H 2 and H -control problems. For LQ control, above trajectories are stationary : Willems, CDC-92. Nonsingularity of (I p DD T ) required for Riccati (in)equality. al,kalaimani,belur (IIT Bombay/Guwahati) T ECC 2013 6 / 14 x z v 1

Extreme case: D = I We focus on the case when (I p DD T ) is singular: the ill-posed case. To understand better the ill-posed case, assume G is square and D = I. Also assume B has full column rank Pal,Kalaimani,Belur (IIT Bombay/Guwahati) ECC 2013 7 / 14

Extreme case: D = I We focus on the case when (I p DD T ) is singular: the ill-posed case. To understand better the ill-posed case, assume G is square and D = I. Also assume B has full column rank (otherwise, can show, B B Σ is non-autonomous). Under what conditions is B B Σ autonomous? Pal,Kalaimani,Belur (IIT Bombay/Guwahati) ECC 2013 7 / 14

Ill-posed interconnection B B Σ Assume D = I and B is full column rank. Define [ ] [ ] A BB T Ã := 0 A T, B B := C T, C := [ C B T ] (1) Theorem Consider the interconnection of the behaviors B and B Σ. Then the following are equivalent. 1 The interconnected system is autonomous. 2 Ce Ãt B is nonsingular for some t. 3 ker ( C B) ker ( CÃ B) ker ( CÃ2n 1 B) = 0 al,kalaimani,belur (IIT Bombay/Guwahati) ECC 2013 8 / 14

Inadmissible initial conditions For a descriptor system E d dtx = Ax, with det (se A) 0, some initial conditions x(0 ) could result in impulsive solutions x(t). Call these initial conditions inadmissible. al,kalaimani,belur (IIT Bombay/Guwahati) ECC 2013 9 / 14

Inadmissible initial conditions For a descriptor system E d dtx = Ax, with det (se A) 0, some initial conditions x(0 ) could result in impulsive solutions x(t). Call these initial conditions inadmissible. No inadmissible initial conditions (se A) has no zeros at infinity. (Like a polynomial matrix P (s) can have finite zeros, P (s) can also have zeros at s =.) Zeros at infinity generalized eigenvalue at. al,kalaimani,belur (IIT Bombay/Guwahati) ECC 2013 9 / 14

Inadmissible initial conditions For a descriptor system E d dtx = Ax, with det (se A) 0, some initial conditions x(0 ) could result in impulsive solutions x(t). Call these initial conditions inadmissible. No inadmissible initial conditions (se A) has no zeros at infinity. (Like a polynomial matrix P (s) can have finite zeros, P (s) can also have zeros at s =.) Zeros at infinity generalized eigenvalue at. When does an autonomous singular Hamiltonian system have inadmissible initial conditions? al,kalaimani,belur (IIT Bombay/Guwahati) ECC 2013 9 / 14

Main result [ A BB T Ã := 0 A T ] [, B := B C T ], C := [ C B T ] (2) Theorem Assume the singular Hamiltonian system is autonomous. The following are equivalent: 1 There are no inadmissible initial conditions. 2 Ce Ãt B is nonsingular at t = 0. 3 ker ( C B) = 0. 4 rank (CB B T C T ) = p al,kalaimani,belur (IIT Bombay/Guwahati) ECC 2013 10 / 14

Main result [ A BB T Ã := 0 A T ] [, B := B C T ], C := [ C B T ] (2) Theorem Assume the singular Hamiltonian system is autonomous. The following are equivalent: 1 There are no inadmissible initial conditions. 2 Ce Ãt B is nonsingular at t = 0. 3 ker ( C B) = 0. 4 rank (CB B T C T ) = p Recall our theorem for the interconnection of B and B Σ. The following are equivalent. 1 The interconnected system is autonomous. 2 Ce Ãt B is nonsingular for some t. 3 ker ( C B) ker ( CÃ B) ker ( CÃ2n 1 B) = 0 al,kalaimani,belur (IIT Bombay/Guwahati) ECC 2013 10 / 14

Relation with all pass MIMO transfer matrix det (CB (CB) T ) 0 is opposite to requirement for being all-pass. G(s) is all-pass I G( jω) T G(jω) = 0 for each ω R. Assumption D = I and G is all-pass CB B T C T = 0, CAB + (CAB) T B T C T CB = 0, Notice that CB is the first moment of G(s) about s =. Thus a necessary condition on the first moment for G to be all-pass is: Pal,Kalaimani,Belur (IIT Bombay/Guwahati) ECC 2013 11 / 14

Relation with all pass MIMO transfer matrix det (CB (CB) T ) 0 is opposite to requirement for being all-pass. G(s) is all-pass I G( jω) T G(jω) = 0 for each ω R. Assumption D = I and G is all-pass CB B T C T = 0, CAB + (CAB) T B T C T CB = 0, Notice that CB is the first moment of G(s) about s =. Thus a necessary condition on the first moment for G to be all-pass is: the skew-symmetric part of CB is zero. Pal,Kalaimani,Belur (IIT Bombay/Guwahati) ECC 2013 11 / 14

Relation with all pass MIMO transfer matrix det (CB (CB) T ) 0 is opposite to requirement for being all-pass. G(s) is all-pass I G( jω) T G(jω) = 0 for each ω R. Assumption D = I and G is all-pass CB B T C T = 0, CAB + (CAB) T B T C T CB = 0, Notice that CB is the first moment of G(s) about s =. Thus a necessary condition on the first moment for G to be all-pass is: the skew-symmetric part of CB is zero. In fact, the interconnection of B and B Σ is autonomous no all-pass subsystem. al,kalaimani,belur (IIT Bombay/Guwahati) ECC 2013 11 / 14

Relation with all pass MIMO transfer matrix det (CB (CB) T ) 0 is opposite to requirement for being all-pass. G(s) is all-pass I G( jω) T G(jω) = 0 for each ω R. Assumption D = I and G is all-pass CB B T C T = 0, CAB + (CAB) T B T C T CB = 0, Notice that CB is the first moment of G(s) about s =. Thus a necessary condition on the first moment for G to be all-pass is: the skew-symmetric part of CB is zero. In fact, the interconnection of B and B Σ is autonomous no all-pass subsystem. On the other hand, a singular Hamiltonian system (assumed autonomous) has no inadmissible initial conditions if and only if CB B T C T is nonsingular. al,kalaimani,belur (IIT Bombay/Guwahati) ECC 2013 11 / 14

Relation with all pass MIMO transfer matrix det (CB (CB) T ) 0 is opposite to requirement for being all-pass. G(s) is all-pass I G( jω) T G(jω) = 0 for each ω R. Assumption D = I and G is all-pass CB B T C T = 0, CAB + (CAB) T B T C T CB = 0, Notice that CB is the first moment of G(s) about s =. Thus a necessary condition on the first moment for G to be all-pass is: the skew-symmetric part of CB is zero. In fact, the interconnection of B and B Σ is autonomous no all-pass subsystem. On the other hand, a singular Hamiltonian system (assumed autonomous) has no inadmissible initial conditions if and only if CB B T C T is nonsingular. Odd number of inputs (and autonomous, ill-posed) there exist inadmissible initial conditions. al,kalaimani,belur (IIT Bombay/Guwahati) ECC 2013 11 / 14

Example G(s) := s+1 s+2 with input u and output y. State space realization : (A, B, C, D) = ( 2, 1, 1, 1). Dual system := s 1 s 2. State space realization : (A, B, C, D) = (2, 1, 1, 1). The interconnection of G and its dual: 1 0 0 x 1 1 1 x d 0 1 0 z = 0 1 1 z dt 0 0 0 y 1 1 0 y Above Es A has a zero at infinity. The differential equation in just x and z has initial conditions that have impulsive solutions. From our result too: CB B T C T = 0. al,kalaimani,belur (IIT Bombay/Guwahati) ECC 2013 12 / 14

Conclusion For the Σ we considered: B B Σ is an all-pass subsystem (possibly autonomous) In the context of Σ-dissipativity, this is set of stationary trajectories with respect to w T Σw. The stationary trajectories are interconnection of B and B Σ. Singular descriptor system if and only if ill-posed interconnection. Assuming D = I (the zeroth moment of G), no inadmissible initial conditions G s first moment has its skew-symmetric part nonsingular. al,kalaimani,belur (IIT Bombay/Guwahati) ECC 2013 13 / 14

Conclusion For the Σ we considered: B B Σ is an all-pass subsystem (possibly autonomous) In the context of Σ-dissipativity, this is set of stationary trajectories with respect to w T Σw. The stationary trajectories are interconnection of B and B Σ. Singular descriptor system if and only if ill-posed interconnection. Assuming D = I (the zeroth moment of G), no inadmissible initial conditions G s first moment has its skew-symmetric part nonsingular. Note: square MIMO all-pass G has first moment symmetric. No obvious way to have E as skew-hamitonian and H as Hamiltonian (as considered by Mehl, Mehrmann, et al.) But: for our pencil (E, H) also, generalized eigenvalues occur in quadruplets (λ, λ, λ, λ): like Mehl, Mehrmann and others. al,kalaimani,belur (IIT Bombay/Guwahati) ECC 2013 13 / 14

Questions, thank you! belur@iitb.ac.in Pal,Kalaimani,Belur (IIT Bombay/Guwahati) ECC 2013 14 / 14

Inadmissible initial condition Consider an autonomous system P ( d dt )w(t) = 0, with P (ξ) Rw w [ξ] nonsingular. A vector w(0) R zw is said to be an inadmissible initial condition vector if the corresponding solution w(t) contains the Dirac impulse δ(t) and/or its distributional derivatives. There exist no inadmissible initial conditions for P ( d dt )w = 0 P has no zeros at infinity. Pal,Kalaimani,Belur (IIT Bombay/Guwahati) ECC 2013 15 / 14

Stationary trajectories Consider a behavior B L w cont and a symmetric nonsingular matrix Σ R w w. A trajectory w B is Σ-stationary if Assume (wlog) that Σ := w T Σv dt = 0 for all v B D. [ ] Im 0 0 I p Definition a Given a controllable behavior B L w cont and Σ R w w, the Σ-orthogonal complement of B, denoted by B Σ is the set of all the trajectories v L loc 1 (R, R w ) such that vt Σw dt = 0 for all w B D. a J.C. Willems and H.L. Trentelman, On quadratic differential forms, SIAM Journal on Control and Optimization, 1998. The set of Σ-stationary trajectories is equal to B B Σ. al,kalaimani,belur (IIT Bombay/Guwahati) ECC 2013 16 / 14