where: u: input y: output x: state vector A, B, C, D are const matrices

Similar documents
CSE 245: Computer Aided Circuit Simulation and Verification

DEPARTMENT OF ELECTRICAL &ELECTRONICS ENGINEERING SIGNALS AND SYSTEMS. Assoc. Prof. Dr. Burak Kelleci. Spring 2018

Chapter 5 The Laplace Transform. x(t) input y(t) output Dynamic System

Boyce/DiPrima 9 th ed, Ch 7.8: Repeated Eigenvalues

Poisson process Markov process

SOLUTIONS. 1. Consider two continuous random variables X and Y with joint p.d.f. f ( x, y ) = = = 15. Stepanov Dalpiaz

REPETITION before the exam PART 2, Transform Methods. Laplace transforms: τ dτ. L1. Derive the formulas : L2. Find the Laplace transform F(s) if.

Midterm exam 2, April 7, 2009 (solutions)

fiziks Institute for NET/JRF, GATE, IIT JAM, JEST, TIFR and GRE in PHYSICAL SCIENCES MATEMATICAL PHYSICS SOLUTIONS are

Transfer function and the Laplace transformation

CHAPTER. Linear Systems of Differential Equations. 6.1 Theory of Linear DE Systems. ! Nullcline Sketching. Equilibrium (unstable) at (0, 0)

CONTROL SYSTEMS. Chapter 10 : State Space Response

UNIT #5 EXPONENTIAL AND LOGARITHMIC FUNCTIONS

Instructors Solution for Assignment 3 Chapter 3: Time Domain Analysis of LTIC Systems

Elementary Differential Equations and Boundary Value Problems

On the Speed of Heat Wave. Mihály Makai

Chapter 3: Fourier Representation of Signals and LTI Systems. Chih-Wei Liu

[ ] 1+ lim G( s) 1+ s + s G s s G s Kacc SYSTEM PERFORMANCE. Since. Lecture 10: Steady-state Errors. Steady-state Errors. Then

EXERCISE - 01 CHECK YOUR GRASP

Charging of capacitor through inductor and resistor

C From Faraday's Law, the induced voltage is, C The effect of electromagnetic induction in the coil itself is called selfinduction.

Chapter 12 Introduction To The Laplace Transform

ECE Connections: What do Roots of Unity have to do with OP-AMPs? Louis Scharf, Colorado State University PART 1: Why Complex?

Wave Equation (2 Week)

Final Exam : Solutions

Summary: Solving a Homogeneous System of Two Linear First Order Equations in Two Unknowns

Why Laplace transforms?

Consider a system of 2 simultaneous first order linear equations

14.02 Principles of Macroeconomics Fall 2005 Quiz 3 Solutions

INTRODUCTION TO AUTOMATIC CONTROLS INDEX LAPLACE TRANSFORMS

Applied Statistics and Probability for Engineers, 6 th edition October 17, 2016

ECE602 Exam 1 April 5, You must show ALL of your work for full credit.

Chapter 7: Inverse-Response Systems

Control System Engineering (EE301T) Assignment: 2

AR(1) Process. The first-order autoregressive process, AR(1) is. where e t is WN(0, σ 2 )

State Observer Design

Boyce/DiPrima 9 th ed, Ch 2.1: Linear Equations; Method of Integrating Factors

symmetric/hermitian matrices, and similarity transformations

Linear Control System EE 711. Design. Lecture 8 Dr. Mostafa Abdel-geliel

with Dirichlet boundary conditions on the rectangle Ω = [0, 1] [0, 2]. Here,

Linear Algebra Primer

LaPlace Transform in Circuit Analysis

EE 350 Signals and Systems Spring 2005 Sample Exam #2 - Solutions

Lecture 2: Current in RC circuit D.K.Pandey

Note 6 Frequency Response

Lecture 1: Numerical Integration The Trapezoidal and Simpson s Rule

Microscopic Flow Characteristics Time Headway - Distribution

Control Systems -- Final Exam (Spring 2006)

WEEK 3 Effective Stress and Pore Water Pressure Changes

a dt a dt a dt dt If 1, then the poles in the transfer function are complex conjugates. Let s look at f t H t f s / s. So, for a 2 nd order system:

Decline Curves. Exponential decline (constant fractional decline) Harmonic decline, and Hyperbolic decline.

S.Y. B.Sc. (IT) : Sem. III. Applied Mathematics. Q.1 Attempt the following (any THREE) [15]

That is, we start with a general matrix: And end with a simpler matrix:

d 1 = c 1 b 2 - b 1 c 2 d 2 = c 1 b 3 - b 1 c 3

On the Derivatives of Bessel and Modified Bessel Functions with Respect to the Order and the Argument

Hydrogen Atom and One Electron Ions

Discussion 06 Solutions

XV Exponential and Logarithmic Functions

Review Lecture 5. The source-free R-C/R-L circuit Step response of an RC/RL circuit. The time constant = RC The final capacitor voltage v( )

Lecture 1: Growth and decay of current in RL circuit. Growth of current in LR Circuit. D.K.Pandey

3(8 ) (8 x x ) 3x x (8 )

nd the particular orthogonal trajectory from the family of orthogonal trajectories passing through point (0; 1).

Control Systems. Modelling Physical Systems. Assoc.Prof. Haluk Görgün. Gears DC Motors. Lecture #5. Control Systems. 10 March 2013

MEM 355 Performance Enhancement of Dynamical Systems A First Control Problem - Cruise Control

Ma/CS 6a Class 15: Flows and Bipartite Graphs

Lecture 1: Contents of the course. Advanced Digital Control. IT tools CCSDEMO

Physics 160 Lecture 3. R. Johnson April 6, 2015

(1) Then we could wave our hands over this and it would become:

10. The Discrete-Time Fourier Transform (DTFT)

Math 266, Practice Midterm Exam 2

Laplace Transform. National Chiao Tung University Chun-Jen Tsai 10/19/2011

Problem Set If all directed edges in a network have distinct capacities, then there is a unique maximum flow.

2.1. Differential Equations and Solutions #3, 4, 17, 20, 24, 35

1 Finite Automata and Regular Expressions

CONTROL SYSTEMS. Chapter 3 Mathematical Modelling of Physical Systems-Laplace Transforms. Prof.Dr. Fatih Mehmet Botsalı

5. Response of Linear Time-Invariant Systems to Random Inputs

Spring 2006 Process Dynamics, Operations, and Control Lesson 2: Mathematics Review

2. The Laplace Transform

Let s look again at the first order linear differential equation we are attempting to solve, in its standard form:

EE 315 Notes. Gürdal Arslan CLASS 1. (Sections ) What is a signal?

Basic Polyhedral theory

An Indian Journal FULL PAPER. Trade Science Inc. A stage-structured model of a single-species with density-dependent and birth pulses ABSTRACT

Self-Adjointness and Its Relationship to Quantum Mechanics. Ronald I. Frank 2016

Chapter 9 The Laplace Transform

EECE 301 Signals & Systems Prof. Mark Fowler

ECEN620: Network Theory Broadband Circuit Design Fall 2014

To become more mathematically correct, Circuit equations are Algebraic Differential equations. from KVL, KCL from the constitutive relationship

, the. L and the L. x x. max. i n. It is easy to show that these two norms satisfy the following relation: x x n x = (17.3) max

whereby we can express the phase by any one of the formulas cos ( 3 whereby we can express the phase by any one of the formulas

Lecture 26: Leapers and Creepers

Additional Methods for Solving DSGE Models

u r du = ur+1 r + 1 du = ln u + C u sin u du = cos u + C cos u du = sin u + C sec u tan u du = sec u + C e u du = e u + C

Partial Fraction Expansion

Chapter 10. The singular integral Introducing S(n) and J(n)

Problemas das Aulas Práticas

6.302 Feedback Systems Recitation : Phase-locked Loops Prof. Joel L. Dawson

Chapter 1 Fundamental Concepts

Chapter 7 Stead St y- ate Errors

The graph of y = x (or y = ) consists of two branches, As x 0, y + ; as x 0, y +. x = 0 is the

Southern Taiwan University

Transcription:

Sa pac modl: linar: y or in om : Sa q : f, u Oupu q : y h, u u Du F Gu y H Ju whr: u: inpu y: oupu : a vcor,,, D ar con maric

Eampl " $ & ' " $ & 'u y " & * * * * [ ],, D

H D I " $ " & $ ' " & $ ' " & & $ ' ' " & $ ' " $ " & $ ' " & $ ' " $ " & $ ' " & $ ' " $ " & $ ' " $ " & $ '

Sa raniion, mari ponnial Scalr ca : a bu Homogniou : a oluion : a Mari ca : u Homogniou : oluion :, by linariy icalldh a raniion mari

Sa raniion mari: oluion : I i an nn mari L - I- -, or L I- - d d i invribl: - - I... n n n...

Eampl, u I I

I/O modl o a pac Infini many oluion, all quivaln. onrollr canonical form: d n d n y a n d n d n y a $ y b b b $ n d d y a y b n " " " " " a a a n & ' []u d n d u b n & & u ' $ ' d d u b u

I/O modl o a pac onrollr canonical form i no uniqu Thi i alo conrollr canonical form d n d n y a n d n d n y a d d y a y d b n n d u b d n d u b u a n a n a a " " " " $ y b n b n b b $ & ' []u & ' $ & u '

Eampl d d d y d 4 d y 4 d d y dy 5 y ydτ d d d y d y dy 5 y d d d : dr d r n4 a a a a b b b b " * $ $ * $ * $ * * 5 y " & " ' $ ' $ ' $ ' $ & ' ' u ' ' &

haracriic valu har. q of a ym i di- h polynomial di- i calld char. pol. h roo of char. q. ar char. valu hy ar alo h ign-valu of.g. i h char. pol. i h char. q. -, -, - ar char. valu or ignvalu u d d I

I u u u u L

can S I No can a : y, d d???

Soluion of a pac modl u y Du Rcall: X-XU I-XU XI- - UI- - L - I- - *u L - I- - y -τ uτd τ -τ uτd τ Du

u don u ho for hand calculaion u:xi- - UI- - L - {I- - U}{L - I- - } & YI- - UDUI- - y L - {I- - UDU}{L - I- - }.g. [ ] y u, If u uni p X

u u u [ ] DU X Y u u y No: T.F.D I- -

Eignvalu, ignvcor Givn a nn quar mari, nonzro vcor p i calld an ignvcor of if p p i.... p p i an ignvalu of Eampl:, L, p i an -vcor, & h -valu L, p i alo an -vcor, aoc. wih h - p p p p p

Eignvalu, ignvcor For a givn nn mari, if, p i an ign-pair, hn p p p-p Ip-p I-p p di- i a oluion o h char. q of : di- char. pol. of nn ha dgn ha n ign-valu..g., di--, -

If hn h corrponding p, p, will b linarly indpndn, i.., h mari [p p p n ] will b invribl. Thn: p p p p [p p ][p p ] [ p p ] [p p ] " " " $ & & & & &

Λ - Λdiag,, If ha n linarly indpndn Eignvcor, hn can b diagonalizd. No: No all quar maric can b diagonalizd.

Eampl work or : for, d d I I I

[ ] work : for I

, diag Λ, diag, diag

In Malab >> [ ; ; 4]; >> [,D]ig.68.77.5.68 -.77.5 -.4597 -..888 p p p D.679. 4.7

If do no hav n linarly indpndn ign-vcor om of h ignvalu ar idnical, hn can no b diagonalizd E.g. di- 4 56 5 4768-8 -6-6 4-6 by olving I- 9 9 4 9 6 4 4 4 4 4 4 8, p p Thr ar only wo linarly indpndn ign-vcor

>> [- 8-4 -4; 4-4 4 4; - -6 - ; 9-4 9-9] - 8-4 -4 4-4 4 4 - -6-9 -4 9-9 >> [,D]ig -.77..i. -.i. -..447 -.i.447.i -.447.77 -..i -. -.i -. -..8944.8944 -.8944 D -8. -6..i -6. -.i -6.

Should u: >>[,J]jordan J.75.65 8 4 -.75.75 6 9-8 -6-6 -6 a Jordan block aociad wih -6

Mor Malab Eampl >> ym''; >> [ ;- -]; >> d*y- an ^* I >> facoran an *

>> [,D]ig.77 -.447 -.77.8944 D - -, >> [,D]jordan - -.77.77 cal o.447.8944 cal o D - -

- - >> p an..78.5.498 >> pm an.64.5 -.465 -.97 >> ym'' >> pm* an [ -p-**p-, p--p-*] [ -*p-*p-*, *p-*-p-]

d d 4 4 } { } { 4 4 : : chck

Similariy ranformaion D D Du y Du y u u u Du y u,,,, w l If am ym a

Eampl [ ] [ ], l y u u y u y u diagonalizd dcoupld

Invarianc: d I d I d d d d I I d I d char.poly or char.q. no changd afr ranformaion char. valu & ignvalu no changd u ignvcor changd

] [ Tranfr funcion : H I D I D I D D I D I D H

onrollabiliy: " u y Du i complly conrollabl if any, conrol u which can bring o in fini im. Thm : c.c. iff rank[ n ] n or d[ n ] if i n or rank [ I - ] n

Eampl: or d rank linarly ind. rank ] [, n

In Malab: >> Scrb, >> rranks S [ ].g. rank If S i quar whn i n >> ds

" u y Du i complly obrrabl if Wihou loof Thm : c.o. or iff Obrvabiliy ovr a fini im can nabl u o drmin. rank n I - rank h knowldg of gnraliy, can u n, n, or d n u, y if i n

Eampl: [ ] [ ] c.o. d, n

In Malab: >> Vobv, >> rrankv rank mu n V Lookfor conrollabiliy Lookfor obrvabiliy Or if ingl oupu i V i quar, can u >> dv d mu b nonzro

[ ] ; oupu ; ;,, I c I b D u y y r d d a r y y y r y d d y d d d d y y y r y d dy d y d d y d - - L L φ φ

Rcall linar ranformaion: u u y Du y Du onrollabiliybing abl o u u o driv any a o origin in fini im n S [ ] ha rank n Obrvabiliybing abl o compur any from obrvd y fr ranformaion, ignvalu, char. poly, char. q, char. valu, T.F., pol, zro unchangd, bu ignvcor changd,,, D D V n O ha full rank n

onrollabiliy i invarian undr ranf. { } { } rank,rank min,rank rank min rank ] [ ] [ ] [ ] [ afr ] [ : bfor roof n n n n n

{ } { } onrollabiliy no changd rank rank rank rank,rank min,rank rank min rank rank u rank rank n

Obrvabiliy invarian undr ranf. afr, : bfor roof O O O O O O

{ } { } Obrvabiliy no changd rank rank,rank rank min rank rank rank,rank rank min rank O O O O O O O O

Sa Fdback u Givn y Du h law : u k r i calld a a fdback conrol law D r u - K y fdback from a o conrol u

clod - loop a pacquaion u k r k r k r y Du only h Mari changd o k ignvalu/char. valu changd by a fdback o ho of k

Thm : If h ym i complly conrollabl hn a fdback can chang h char.valu or ignvalu o any arbirary locaion. Th convr i alo ru. i.. rank n ignvalu of k can b changd o any by choic of k

In Malab: Givn,,,D ompu crb, hck rank If i i n, hn Slc any n ignvalumu b in compl conjuga pair v[ ; ; ; ; n ] 4ompu: Kplac,,v k will hav ignvalu a

Thm: onrollabiliy i unchangd afr a fdback. u obrvabiliy may chang