Describing Function: An Approximate Analysis Method

Similar documents
Chapter 4 : Laplace Transform

Definition of z-transform.

Time-Domain Representations of LTI Systems

Chapter 7: The z-transform. Chih-Wei Liu

1.3 Convergence Theorems of Fourier Series. k k k k. N N k 1. With this in mind, we state (without proof) the convergence of Fourier series.

Definition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4.

Signal Processing in Mechatronics. Lecture 3, Convolution, Fourier Series and Fourier Transform

ELEG 4603/5173L Digital Signal Processing Ch. 1 Discrete-Time Signals and Systems

Lecture 19: Convergence

EE / EEE SAMPLE STUDY MATERIAL. GATE, IES & PSUs Signal System. Electrical Engineering. Postal Correspondence Course

Ma 4121: Introduction to Lebesgue Integration Solutions to Homework Assignment 5

radians A function f ( x ) is called periodic if it is defined for all real x and if there is some positive number P such that:

Period Function of a Lienard Equation

Solutions. Number of Problems: 4. None. Use only the prepared sheets for your solutions. Additional paper is available from the supervisors.

Lecture 10: Bounded Linear Operators and Orthogonality in Hilbert Spaces

Filter banks. Separately, the lowpass and highpass filters are not invertible. removes the highest frequency 1/ 2and

ECE 308 Discrete-Time Signals and Systems

Signals and Systems. Problem Set: From Continuous-Time to Discrete-Time

Olli Simula T / Chapter 1 3. Olli Simula T / Chapter 1 5

Chapter 7 z-transform

Riesz-Fischer Sequences and Lower Frame Bounds

Discrete-Time Systems, LTI Systems, and Discrete-Time Convolution

Chapter 7 Isoperimetric problem

Fourier Series and their Applications

Chapter 10 Advanced Topics in Random Processes

Beyond simple iteration of a single function, or even a finite sequence of functions, results

Chapter 2 Systems and Signals

Abstract Vector Spaces. Abstract Vector Spaces

3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,

Analog and Digital Signals. Introduction to Digital Signal Processing. Discrete-time Sinusoids. Analog and Digital Signals

State Space Representation

Appendix: The Laplace Transform

Ch3 Discrete Time Fourier Transform

Signal Processing. Lecture 02: Discrete Time Signals and Systems. Ahmet Taha Koru, Ph. D. Yildiz Technical University.

Chapter 6 Infinite Series

The z-transform. 7.1 Introduction. 7.2 The z-transform Derivation of the z-transform: x[n] = z n LTI system, h[n] z = re j

MATH 10550, EXAM 3 SOLUTIONS

Frequency Response of FIR Filters

Z - Transform. It offers the techniques for digital filter design and frequency analysis of digital signals.

ADVANCED DIGITAL SIGNAL PROCESSING

Lecture 8: Convergence of transformations and law of large numbers

Module 18 Discrete Time Signals and Z-Transforms Objective: Introduction : Description: Discrete Time Signal representation

Chapter 3. Strong convergence. 3.1 Definition of almost sure convergence

Apply change-of-basis formula to rewrite x as a linear combination of eigenvectors v j.

Mechatronics. Time Response & Frequency Response 2 nd -Order Dynamic System 2-Pole, Low-Pass, Active Filter

1 1 2 = show that: over variables x and y. [2 marks] Write down necessary conditions involving first and second-order partial derivatives for ( x0, y

Lyapunov Stability Analysis for Feedback Control Design

Discrete-Time Signals and Systems. Discrete-Time Signals and Systems. Signal Symmetry. Elementary Discrete-Time Signals.

The Z-Transform. (t-t 0 ) Figure 1: Simplified graph of an impulse function. For an impulse, it can be shown that (1)

REGULARIZATION OF CERTAIN DIVERGENT SERIES OF POLYNOMIALS

ON CONVERGENCE OF BASIC HYPERGEOMETRIC SERIES. 1. Introduction Basic hypergeometric series (cf. [GR]) with the base q is defined by

We are mainly going to be concerned with power series in x, such as. (x)} converges - that is, lims N n

b i u x i U a i j u x i u x j

Chapter 3. z-transform

Exponential Moving Average Pieter P

Computational Fluid Dynamics. Lecture 3

EECE 301 Signals & Systems

Introduction to Functional Analysis

Discrete-Time Signals and Systems. Signals and Systems. Digital Signals. Discrete-Time Signals. Operations on Sequences: Basic Operations

Introduction to Optimization Techniques. How to Solve Equations

Introduction to Optimization Techniques

Generalizing the DTFT. The z Transform. Complex Exponential Excitation. The Transfer Function. Systems Described by Difference Equations

Real Numbers R ) - LUB(B) may or may not belong to B. (Ex; B= { y: y = 1 x, - Note that A B LUB( A) LUB( B)

ELEG3503 Introduction to Digital Signal Processing

ECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science. BACKGROUND EXAM September 30, 2004.

Linear Elliptic PDE s Elliptic partial differential equations frequently arise out of conservation statements of the form

Goal. Adaptive Finite Element Methods for Non-Stationary Convection-Diffusion Problems. Outline. Differential Equation

Frequency Domain Filtering

Orthogonal Gaussian Filters for Signal Processing

SCORE. Exam 2. MA 114 Exam 2 Fall 2016

Mathematical Methods for Physics and Engineering

Fall 2013 MTH431/531 Real analysis Section Notes

Indian Statistical Institute, Bangalore Centre Solution set of M.Math II Year, End-Sem Examination 2015 Fourier Analysis

Review of Discrete-time Signals. ELEC 635 Prof. Siripong Potisuk

6.003 Homework #3 Solutions

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

A Negative Result. We consider the resolvent problem for the scalar Oseen equation

Sequences and Limits

: Transforms and Partial Differential Equations

ON THE EXISTENCE OF A GROUP ORTHONORMAL BASIS. Peter Zizler (Received 20 June, 2014)

Solutions to home assignments (sketches)

Mathematical Description of Discrete-Time Signals. 9/10/16 M. J. Roberts - All Rights Reserved 1

x[0] x[1] x[2] Figure 2.1 Graphical representation of a discrete-time signal.

PH 411/511 ECE B(k) Sin k (x) dk (1)

FIR Filter Design: Part II

Measure and Measurable Functions

Sequences and Series of Functions

A) is empty. B) is a finite set. C) can be a countably infinite set. D) can be an uncountable set.

1. Hydrogen Atom: 3p State

LECTURE 21. DISCUSSION OF MIDTERM EXAM. θ [0, 2π). f(θ) = π θ 2

Dynamic Response of Linear Systems

A Note on Integrals & Hybrid Contours in the Complex Plane

LECTURE 8: ORTHOGONALITY (CHAPTER 5 IN THE BOOK)

Signals & Systems Chapter3

Brief Review of Functions of Several Variables

Practical Spectral Anaysis (continue) (from Boaz Porat s book) Frequency Measurement

Math Solutions to homework 6

Derivation of the Fourier Inversion Formula, Bochner s Theorem, and Herglotz s Theorem

DETERMINATION OF MECHANICAL PROPERTIES OF A NON- UNIFORM BEAM USING THE MEASUREMENT OF THE EXCITED LONGITUDINAL ELASTIC VIBRATIONS.

Transcription:

Describig Fuctio: A Approximate Aalysis Method his chapter presets a method for approximately aalyzig oliear dyamical systems A closed-form aalytical solutio of a oliear dyamical system (eg, a oliear differetial equatio or a oliear map) is usually ifeasible except possibly for special cases that are usually cotrived; therefore, it is a usual practice to carry out approximate aalysis of oliear dyamical systems Describig fuctio (DF) is a aalytical tool for represetatio of a oliear autoomous system as a equivalet liear time-ivariat system, which is the best liear approximatio of the oliear autoomous system i a certai sese his method ca also be used to predict the existece of periodic solutios i feedback systems although it does ot provide ay ecessary or sufficiet coditios

Iterpretatio of Describig Fuctio as a Optimal Quasiliearizatio from a Fuctioal Aalytic Perspective Let C F be the space of almost everywhere cotiuous fuctios that have fiite average power, ie, lim d f ( ) < f CF ad (, ) τ τ [It is implied that the limit exists ad is fiite] Let I = { ψ : C F C F } be the space of causal time-ivariat bouded operators Note that the operators ψ : C F C F could be liear or oliear Remark : C F is a vector space over the real field R with a ier product defied as: f,g dτg( τ) f ( τ) f,g C F[,] ad ay fiite (, ) Accordigly, the orm o this ier product space is defied as: It follows from Cauchy-Schwarz iequality that f dτ f ( τ) for ay fiite (, ) ad f C F f,g Defiitio : he cross-correlatio of two fuctios f g f,g C F f, g C is defied as: Φ τ = ( ) f,g ( ) lim dτ g(t + τ)f (t) Let L be a subspace of I cotaiig oly the liear fiite-dimesioal operators hat is, L cosists of proper Hurwitz ratioal trasfer fuctios For example, let e(t) CF be the iput to the oliear fuctio ψ I so that its output is ψ ( e(t) ) CF If h L is a liear approximatio of ψ I, the the output correspodig to the iput t e(t) C F is ( h e) (t) dτh(t τ)e( τ) ad h L[, ) he problem is to idetify a proper Hurwitz trasfer fuctio ĥ correspodig to the impulse respose h L that approximates the oliear fuctio ψ I i the sese of miimizig the followig error fuctioal: J (h) lim dt ψ(e(t)) (h e)(t) he resultig (causal Hurwitz) impulse respose h(t) or the correspodig trasfer fuctio ĥ (s) ) is called a optimal quasi-liearizatio of the oliear operator ψ I heorem : he error fuctioal J(h) is miimized if ad oly if Φe,h e( τ) = Φe, ψ(e) ( τ) τ Proof: Let h L he objective is to idetify ad optimal idetify a optimal h Let δj ( h,h) J( h) J(h) = lim F t be aother liear approximatio of ψ I he, ( ) τ( h e (t) d h(t τ)e( τ) ) ad h L[, ) h L such that J (h) J( h) h L Let us use the variatioal approach to = lim dt ψ(e(t)) ( h e)(t) ψ(e(t)) (h e)(t) dt ( h e)(t) (h e)(t) ( ( ) h h) e (t) ψ(e(t))

= lim dt Sice h miimizes the error fuctioal J ( ) if ad oly if ( h h) e) (t) + ( h h) e) (t) ((h e)(t) ψ(e(t) ) ( ( h h) e) (t) ((h e)(t) ψ(e(t) )) = lim dt Expressig the covolutio terms as itegrals, we have: dt ( ( h h) e) (t) ((h e)(t) ψ(e(t )) ) ( ) = t dt τ τ ψ dτ ( h h)( )e(t ) (h e)(t) (e(t ) δj ( h,h) h L, we must have ( ( )) = d τ( h h)( τ) τ ψ dt e(t ) (h e)(t) (e(t ) by iterchagig the order of itegratio τ τ herefore, lim dτ( h h)( τ) dt ( e(t τ) ((h e)(t) ψ(e(t) )) = τ possible if lim dt ( e(t τ) ((h e)(t) ψ(e(t) )) = τ lim τ dt implyig that (((h e)(t + τ) ψ(e(t + τ) ) e(t) ) = τ for all fuctios ( h h) L his is Settig i place of τ whe, we have lim ( ) = ( ψ + τ ) dt (h e)(t + τ)e(t) lim dt (e(t )e(t) Hece, Φe,h e( τ) = Φe, ψ(e) ( τ) τ Remark : he optimal approximatio of the oliear fuctio ψ by a liear trasfer matrix ĥ is depedet o the give referece poit However, there is o guaratee of optimality or eve existece of such a trasfer fuctio if the referece poit is altered because the oliear fuctio ψ is also altered Example : Let the iput sigal be a o-zero costat, ie, e(t) = c t he, ψ ( e(t)) = ψ(c) t ad Φe, ψ (e)( τ) = cψ(c) which is a costat τ By the optimality coditio, the liear approximatio h(t) must satisfy Φe,h e ( τ) = cψ(c) that leads to: lim dt ((h e)(t )c) = cψ(c) lim dt (h e)(t) = ψ(c) + τ If the oliearity is memoryless, the ψ(c) is a real costat he a possible choice is ( h e)(t) = ψ(c) t (c) his implies that h(t) = ψ ψ(c) δ(t) or ĥ(s) = However, this choice may ot be uique c c Example : Let e(t) = ESi( Ω t) t he, ψ(e(t)) = A + ( AkSi(k Ω t) + BkCos(k Ω t) ) t k= Let ψ be a odd fuctio implyig that A = ad B k = k N he, Φ τ = e, ψ(e) ( ) lim dt AkSi(k Ω (t + τ ) E Si(k Ω t) k=

π / Ω Sice dtsi(k Ω t) Si( Ω t) = π δ Ω k, we have A Φ ψ ( τ) = lim e, (e) ( Ω + τ ω ) dt Si( (t ) ESi( t) A Now, if we choose ĥ(s) = A h(t) = (t), E E δ t A the (h e)(t) = d τ δ(t τ)esi( Ω t) = A Si( t) E Ω he, Φ ( ) = ( Ω + τ Ω ) ( τ) = lim Ω + τ ω dt Si( (t ) ESi( t) lim e,h e dt Si( (t ) ESi( t) τ herefore, Φe, ψ (e)( τ) = Φe,h e( τ) τ heorem : Let the iput ad output of the oliear block be e(t) = ESi( Ωt) ad ψ ( e(t)) = z(t) = zss (t) + ztr (t), respectively, where the first harmoic z is cotiuous ad ( π / Ω) periodic ad ztr L([, )) Let the oliear operator ψ ( ) be approximated by the followig trasfer fuctio ĥ (s) such that Re gre( ω) g ( ( ĥ(iω) ) = ad Im( ĥ(iω) ) = im E E where gre( ω ) ad gim ( ω) are eve ad odd fuctios of ω, respectively; ad the first harmoic of z ss (t) is give as: z ss (t) = gre( Ω) Si( Ωt) + gim ( Ω)Cos( Ω t) Proof: We have ztr L([, )), ie, dt ztr (t) = ϑ < ; ad the eergy of the iput sigal over ay fiite is: dt e(t) E dtsi ( t) E = Ω e(t) E for ay fiite Havig e,z tr dt ( ztr (t) e(t) ), it follows from Cauchy-Schwarz iequality that e, ztr e z tr for ay fiite E ϑ Now, the cross-correlatio Φe,z tr lim e,ztr lim e ztr lim = herefore, Φ e,z tr ( τ) = τ he implicatio is that ay trasiet part of the oliear block output is ucorrelated to its iput We cosider oly the periodic part z ss (t) of the output z (t) because Φ e,z ( τ) = Φe,z ( τ) + Φe,z ( τ) = Φe, z ( τ) ss tr ss Sice e(t) = ESi( Ω t), settig = π / Ω where N, we have e(t),si πk(t + θ) = ad k(t ) e(t),cos π + θ for all k N -{ } Lettig, it follows that Φ e,z ) ( ) ( τ = Φ ss e, z τ ss ê(iω ) = iπe δ( ω+ Ω) δ( ω Ω), the output of the liear approximatio block is obtaied as the Fourier Give ( ) iverse of ĥ(iω ) ê(iω) as follows: ω) ( h *e)(t) = ( Re( ĥ(iω ))Si( Ωt) + Im(ĥ(iΩ))Cos( Ωt) )E herefore, (h e)(t) = z ss (t) t Proof is thus complete Defiitio : Followig the otatios i heorem, the describig fuctio K eq (, ) of the oliear operator ψ is the complex-valued fuctio defied as: K eq (E,Ω) = gre ( Ω ) gim ( Ω) + i E E heorem 3: If the oliear operator ψ is memoryless, time-ivariat, ad cotiuous, the the describig fuctio K eq (E, Ω ) is idepedet of Ω Proof: he output i respose to the iput e(t) ESi( Ωt) = is z(t) ψ( ESi( Ωt) ) = that is decomposed as z(t) = zss (t) + ztr (t) as the steady-state ad trasiet compoets Give the operator ψ to be memoryless, time- 3

ivariat, almost everywhere cotiuous, ad bouded, the trasiet part z tr (t) of the output becomes zero g g ( ) herefore, the coditios of heorem prevail ad we have K eq (E,Ω) = re ( Ω ) im Ω + i Now cosider aother E E sigal e(t) = ESi( Ωt) of same amplitude ad differet frequecy Ω Ω so that e ca be obtaied from e by time scalig herefore, ( ψe )(t) = ( ψ e) Ωt implyig that the first harmoics are idetical after time scalig herefore, Ω K (E, ) K (E, eq Ω = eq Ω) Corollary to heorem 3: If, i additio, the operator ψ is odd, the K eq is real for E>, ie, g im ( Ω ) = Proof: For e(t) ESi( Ωt) = ad ψ beig odd, Fourier expasio of ( e) (t) ψ does ot cotai ay cosie term Corollary to heorem 3: Let, i additio to the coditios specified i heorem 3 ad Corollary, ψ be sectorbouded, ie, k,k (, ) such that k σ σψ( σ) k σ σ R he, k Keq (E) k Proof: By Corollary to heorem 3, K eq is real ad idepedet of ω because ψ is memoryless, time-ivariat, (almost everywhere) cotiuous, ad odd herefore, π / Ω Keq (E) = Ω dt πe π = d E θ π ( ψ(esi( Ω t))si( Ω t) ) π πe ( ) = k ( ψ(esi θ)si θ) dθ k ( ESiθ) π πe π πe Similarly, K (E) = dθ ( ψ(esi θ)si θ) dθ k ( ESiθ) eq ( ) = k 4