Describing Function: An Approximate Analysis Method

Size: px
Start display at page:

Download "Describing Function: An Approximate Analysis Method"

Transcription

1 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

2

3

4

5

6

7

8

9

10 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))

11 = 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=

12 π / Ω 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

13 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

Chapter 4 : Laplace Transform

Chapter 4 : Laplace Transform 4. Itroductio Laplace trasform is a alterative to solve the differetial equatio by the complex frequecy domai ( s = σ + jω), istead of the usual time domai. The DE ca be easily trasformed ito a algebraic

More information

Definition of z-transform.

Definition of z-transform. - Trasforms Frequecy domai represetatios of discretetime sigals ad LTI discrete-time systems are made possible with the use of DTFT. However ot all discrete-time sigals e.g. uit step sequece are guarateed

More information

Time-Domain Representations of LTI Systems

Time-Domain Representations of LTI Systems 2.1 Itroductio Objectives: 1. Impulse resposes of LTI systems 2. Liear costat-coefficiets differetial or differece equatios of LTI systems 3. Bloc diagram represetatios of LTI systems 4. State-variable

More information

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

Chapter 7: The z-transform. Chih-Wei Liu Chapter 7: The -Trasform Chih-Wei Liu Outlie Itroductio The -Trasform Properties of the Regio of Covergece Properties of the -Trasform Iversio of the -Trasform The Trasfer Fuctio Causality ad Stability

More information

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.

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. .3 Covergece Theorems of Fourier Series I this sectio, we preset the covergece of Fourier series. A ifiite sum is, by defiitio, a limit of partial sums, that is, a cos( kx) b si( kx) lim a cos( kx) b si(

More information

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.

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. 4. BASES I BAACH SPACES 39 4. BASES I BAACH SPACES Sice a Baach space X is a vector space, it must possess a Hamel, or vector space, basis, i.e., a subset {x γ } γ Γ whose fiite liear spa is all of X ad

More information

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

Signal Processing in Mechatronics. Lecture 3, Convolution, Fourier Series and Fourier Transform Sigal Processig i Mechatroics Summer semester, 1 Lecture 3, Covolutio, Fourier Series ad Fourier rasform Dr. Zhu K.P. AIS, UM 1 1. Covolutio Covolutio Descriptio of LI Systems he mai premise is that the

More information

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

ELEG 4603/5173L Digital Signal Processing Ch. 1 Discrete-Time Signals and Systems Departmet of Electrical Egieerig Uiversity of Arasas ELEG 4603/5173L Digital Sigal Processig Ch. 1 Discrete-Time Sigals ad Systems Dr. Jigxia Wu wuj@uar.edu OUTLINE 2 Classificatios of discrete-time sigals

More information

Lecture 19: Convergence

Lecture 19: Convergence Lecture 19: Covergece Asymptotic approach I statistical aalysis or iferece, a key to the success of fidig a good procedure is beig able to fid some momets ad/or distributios of various statistics. I may

More information

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

EE / EEE SAMPLE STUDY MATERIAL. GATE, IES & PSUs Signal System. Electrical Engineering. Postal Correspondence Course Sigal-EE Postal Correspodece Course 1 SAMPLE STUDY MATERIAL Electrical Egieerig EE / EEE Postal Correspodece Course GATE, IES & PSUs Sigal System Sigal-EE Postal Correspodece Course CONTENTS 1. SIGNAL

More information

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

Ma 4121: Introduction to Lebesgue Integration Solutions to Homework Assignment 5 Ma 42: Itroductio to Lebesgue Itegratio Solutios to Homework Assigmet 5 Prof. Wickerhauser Due Thursday, April th, 23 Please retur your solutios to the istructor by the ed of class o the due date. You

More information

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:

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: Fourier Series. Graph of y Asix ad y Acos x Amplitude A ; period 36 radias. Harmoics y y six is the first harmoic y y six is the th harmoics 3. Periodic fuctio A fuctio f ( x ) is called periodic if it

More information

Period Function of a Lienard Equation

Period Function of a Lienard Equation Joural of Mathematical Scieces (4) -5 Betty Joes & Sisters Publishig Period Fuctio of a Lieard Equatio Khalil T Al-Dosary Departmet of Mathematics, Uiversity of Sharjah, Sharjah 77, Uited Arab Emirates

More information

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

Solutions. Number of Problems: 4. None. Use only the prepared sheets for your solutions. Additional paper is available from the supervisors. Quiz November 4th, 23 Sigals & Systems (5-575-) P. Reist & Prof. R. D Adrea Solutios Exam Duratio: 4 miutes Number of Problems: 4 Permitted aids: Noe. Use oly the prepared sheets for your solutios. Additioal

More information

Lecture 10: Bounded Linear Operators and Orthogonality in Hilbert Spaces

Lecture 10: Bounded Linear Operators and Orthogonality in Hilbert Spaces Lecture : Bouded Liear Operators ad Orthogoality i Hilbert Spaces 34 Bouded Liear Operator Let ( X, ), ( Y, ) i i be ored liear vector spaces ad { } X Y The, T is said to be bouded if a real uber c such

More information

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

Filter banks. Separately, the lowpass and highpass filters are not invertible. removes the highest frequency 1/ 2and Filter bas Separately, the lowpass ad highpass filters are ot ivertible T removes the highest frequecy / ad removes the lowest frequecy Together these filters separate the sigal ito low-frequecy ad high-frequecy

More information

ECE 308 Discrete-Time Signals and Systems

ECE 308 Discrete-Time Signals and Systems ECE 38-5 ECE 38 Discrete-Time Sigals ad Systems Z. Aliyazicioglu Electrical ad Computer Egieerig Departmet Cal Poly Pomoa ECE 38-5 1 Additio, Multiplicatio, ad Scalig of Sequeces Amplitude Scalig: (A Costat

More information

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

Signals and Systems. Problem Set: From Continuous-Time to Discrete-Time Sigals ad Systems Problem Set: From Cotiuous-Time to Discrete-Time Updated: October 5, 2017 Problem Set Problem 1 - Liearity ad Time-Ivariace Cosider the followig systems ad determie whether liearity ad

More information

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

Olli Simula T / Chapter 1 3. Olli Simula T / Chapter 1 5 Sigals ad Systems Sigals ad Systems Sigals are variables that carry iformatio Systemstake sigals as iputs ad produce sigals as outputs The course deals with the passage of sigals through systems T-6.4

More information

Chapter 7 z-transform

Chapter 7 z-transform Chapter 7 -Trasform Itroductio Trasform Uilateral Trasform Properties Uilateral Trasform Iversio of Uilateral Trasform Determiig the Frequecy Respose from Poles ad Zeros Itroductio Role i Discrete-Time

More information

Riesz-Fischer Sequences and Lower Frame Bounds

Riesz-Fischer Sequences and Lower Frame Bounds Zeitschrift für Aalysis ud ihre Aweduge Joural for Aalysis ad its Applicatios Volume 1 (00), No., 305 314 Riesz-Fischer Sequeces ad Lower Frame Bouds P. Casazza, O. Christese, S. Li ad A. Lider Abstract.

More information

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

Discrete-Time Systems, LTI Systems, and Discrete-Time Convolution EEL5: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we begi our mathematical treatmet of discrete-time s. As show i Figure, a discrete-time operates or trasforms some iput sequece x [

More information

Chapter 7 Isoperimetric problem

Chapter 7 Isoperimetric problem Chapter 7 Isoperimetric problem Recall that the isoperimetric problem (see the itroductio its coectio with ido s proble) is oe of the most classical problem of a shape optimizatio. It ca be formulated

More information

Fourier Series and their Applications

Fourier Series and their Applications Fourier Series ad their Applicatios The fuctios, cos x, si x, cos x, si x, are orthogoal over (, ). m cos mx cos xdx = m = m = = cos mx si xdx = for all m, { m si mx si xdx = m = I fact the fuctios satisfy

More information

Chapter 10 Advanced Topics in Random Processes

Chapter 10 Advanced Topics in Random Processes ery Stark ad Joh W. Woods, Probability, Statistics, ad Radom Variables for Egieers, 4th ed., Pearso Educatio Ic.,. ISBN 978--3-33-6 Chapter Advaced opics i Radom Processes Sectios. Mea-Square (m.s.) Calculus

More information

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

Beyond simple iteration of a single function, or even a finite sequence of functions, results A Primer o the Elemetary Theory of Ifiite Compositios of Complex Fuctios Joh Gill Sprig 07 Abstract: Elemetary meas ot requirig the complex fuctios be holomorphic Theorem proofs are fairly simple ad are

More information

Chapter 2 Systems and Signals

Chapter 2 Systems and Signals Chapter 2 Systems ad Sigals 1 Itroductio Discrete-Time Sigals: Sequeces Discrete-Time Systems Properties of Liear Time-Ivariat Systems Liear Costat-Coefficiet Differece Equatios Frequecy-Domai Represetatio

More information

Abstract Vector Spaces. Abstract Vector Spaces

Abstract Vector Spaces. Abstract Vector Spaces Astract Vector Spaces The process of astractio is critical i egieerig! Physical Device Data Storage Vector Space MRI machie Optical receiver 0 0 1 0 1 0 0 1 Icreasig astractio 6.1 Astract Vector Spaces

More information

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,

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, 3. Z Trasform Referece: Etire Chapter 3 of text. Recall that the Fourier trasform (FT) of a DT sigal x [ ] is ω ( ) [ ] X e = j jω k = xe I order for the FT to exist i the fiite magitude sese, S = x [

More information

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

Analog and Digital Signals. Introduction to Digital Signal Processing. Discrete-time Sinusoids. Analog and Digital Signals Itroductio to Digital Sigal Processig Chapter : Itroductio Aalog ad Digital Sigals aalog = cotiuous-time cotiuous amplitude digital = discrete-time discrete amplitude cotiuous amplitude discrete amplitude

More information

State Space Representation

State Space Representation Optimal Cotrol, Guidace ad Estimatio Lecture 2 Overview of SS Approach ad Matrix heory Prof. Radhakat Padhi Dept. of Aerospace Egieerig Idia Istitute of Sciece - Bagalore State Space Represetatio Prof.

More information

Appendix: The Laplace Transform

Appendix: The Laplace Transform Appedix: The Laplace Trasform The Laplace trasform is a powerful method that ca be used to solve differetial equatio, ad other mathematical problems. Its stregth lies i the fact that it allows the trasformatio

More information

Ch3 Discrete Time Fourier Transform

Ch3 Discrete Time Fourier Transform Ch3 Discrete Time Fourier Trasform 3. Show that the DTFT of [] is give by ( k). e k 3. Determie the DTFT of the two sided sigal y [ ],. 3.3 Determie the DTFT of the causal sequece x[ ] A cos( 0 ) [ ],

More information

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

Signal Processing. Lecture 02: Discrete Time Signals and Systems. Ahmet Taha Koru, Ph. D. Yildiz Technical University. Sigal Processig Lecture 02: Discrete Time Sigals ad Systems Ahmet Taha Koru, Ph. D. Yildiz Techical Uiversity 2017-2018 Fall ATK (YTU) Sigal Processig 2017-2018 Fall 1 / 51 Discrete Time Sigals Discrete

More information

Chapter 6 Infinite Series

Chapter 6 Infinite Series Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat

More information

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

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 The -Trasform 7. Itroductio Geeralie the complex siusoidal represetatio offered by DTFT to a represetatio of complex expoetial sigals. Obtai more geeral characteristics for discrete-time LTI systems. 7.

More information

MATH 10550, EXAM 3 SOLUTIONS

MATH 10550, EXAM 3 SOLUTIONS MATH 155, EXAM 3 SOLUTIONS 1. I fidig a approximate solutio to the equatio x 3 +x 4 = usig Newto s method with iitial approximatio x 1 = 1, what is x? Solutio. Recall that x +1 = x f(x ) f (x ). Hece,

More information

Frequency Response of FIR Filters

Frequency Response of FIR Filters EEL335: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we itroduce the idea of the frequecy respose of LTI systems, ad focus specifically o the frequecy respose of FIR filters.. Steady-state

More information

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

Z - Transform. It offers the techniques for digital filter design and frequency analysis of digital signals. Z - Trasform The -trasform is a very importat tool i describig ad aalyig digital systems. It offers the techiques for digital filter desig ad frequecy aalysis of digital sigals. Defiitio of -trasform:

More information

ADVANCED DIGITAL SIGNAL PROCESSING

ADVANCED DIGITAL SIGNAL PROCESSING ADVANCED DIGITAL SIGNAL PROCESSING PROF. S. C. CHAN (email : sccha@eee.hku.hk, Rm. CYC-702) DISCRETE-TIME SIGNALS AND SYSTEMS MULTI-DIMENSIONAL SIGNALS AND SYSTEMS RANDOM PROCESSES AND APPLICATIONS ADAPTIVE

More information

Lecture 8: Convergence of transformations and law of large numbers

Lecture 8: Convergence of transformations and law of large numbers Lecture 8: Covergece of trasformatios ad law of large umbers Trasformatio ad covergece Trasformatio is a importat tool i statistics. If X coverges to X i some sese, we ofte eed to check whether g(x ) coverges

More information

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

Module 18 Discrete Time Signals and Z-Transforms Objective: Introduction : Description: Discrete Time Signal representation Module 8 Discrete Time Sigals ad Z-Trasforms Objective:To uderstad represetig discrete time sigals, apply z trasform for aalyzigdiscrete time sigals ad to uderstad the relatio to Fourier trasform Itroductio

More information

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

Chapter 3. Strong convergence. 3.1 Definition of almost sure convergence Chapter 3 Strog covergece As poited out i the Chapter 2, there are multiple ways to defie the otio of covergece of a sequece of radom variables. That chapter defied covergece i probability, covergece i

More information

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

Apply change-of-basis formula to rewrite x as a linear combination of eigenvectors v j. Eigevalue-Eigevector Istructor: Nam Su Wag eigemcd Ay vector i real Euclidea space of dimesio ca be uiquely epressed as a liear combiatio of liearly idepedet vectors (ie, basis) g j, j,,, α g α g α g α

More information

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

Mechatronics. Time Response & Frequency Response 2 nd -Order Dynamic System 2-Pole, Low-Pass, Active Filter Time Respose & Frequecy Respose d -Order Dyamic System -Pole, Low-Pass, Active Filter R 4 R 7 C 5 e i R 1 C R 3 - + R 6 - + e out Assigmet: Perform a Complete Dyamic System Ivestigatio of the Two-Pole,

More information

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

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 Questio (a) A square matrix A= A is called positive defiite if the quadratic form waw > 0 for every o-zero vector w [Note: Here (.) deotes the traspose of a matrix or a vector]. Let 0 A = 0 = show that:

More information

Lyapunov Stability Analysis for Feedback Control Design

Lyapunov Stability Analysis for Feedback Control Design Copyright F.L. Lewis 008 All rights reserved Updated: uesday, November, 008 Lyapuov Stability Aalysis for Feedbac Cotrol Desig Lyapuov heorems Lyapuov Aalysis allows oe to aalyze the stability of cotiuous-time

More information

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

Discrete-Time Signals and Systems. Discrete-Time Signals and Systems. Signal Symmetry. Elementary Discrete-Time Signals. Discrete-ime Sigals ad Systems Discrete-ime Sigals ad Systems Dr. Deepa Kudur Uiversity of oroto Referece: Sectios. -.5 of Joh G. Proakis ad Dimitris G. Maolakis, Digital Sigal Processig: Priciples, Algorithms,

More information

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

The Z-Transform. (t-t 0 ) Figure 1: Simplified graph of an impulse function. For an impulse, it can be shown that (1) The Z-Trasform Sampled Data The geeralied fuctio (t) (also kow as the impulse fuctio) is useful i the defiitio ad aalysis of sampled-data sigals. Figure below shows a simplified graph of a impulse. (t-t

More information

REGULARIZATION OF CERTAIN DIVERGENT SERIES OF POLYNOMIALS

REGULARIZATION OF CERTAIN DIVERGENT SERIES OF POLYNOMIALS REGULARIZATION OF CERTAIN DIVERGENT SERIES OF POLYNOMIALS LIVIU I. NICOLAESCU ABSTRACT. We ivestigate the geeralized covergece ad sums of series of the form P at P (x, where P R[x], a R,, ad T : R[x] R[x]

More information

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

ON CONVERGENCE OF BASIC HYPERGEOMETRIC SERIES. 1. Introduction Basic hypergeometric series (cf. [GR]) with the base q is defined by ON CONVERGENCE OF BASIC HYPERGEOMETRIC SERIES TOSHIO OSHIMA Abstract. We examie the covergece of q-hypergeometric series whe q =. We give a coditio so that the radius of the covergece is positive ad get

More information

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

We are mainly going to be concerned with power series in x, such as. (x)} converges - that is, lims N n Review of Power Series, Power Series Solutios A power series i x - a is a ifiite series of the form c (x a) =c +c (x a)+(x a) +... We also call this a power series cetered at a. Ex. (x+) is cetered at

More information

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

b i u x i U a i j u x i u x j M ath 5 2 7 Fall 2 0 0 9 L ecture 1 9 N ov. 1 6, 2 0 0 9 ) S ecod- Order Elliptic Equatios: Weak S olutios 1. Defiitios. I this ad the followig two lectures we will study the boudary value problem Here

More information

Chapter 3. z-transform

Chapter 3. z-transform Chapter 3 -Trasform 3.0 Itroductio The -Trasform has the same role as that played by the Laplace Trasform i the cotiuous-time theorem. It is a liear operator that is useful for aalyig LTI systems such

More information

Exponential Moving Average Pieter P

Exponential Moving Average Pieter P Expoetial Movig Average Pieter P Differece equatio The Differece equatio of a expoetial movig average lter is very simple: y[] x[] + (1 )y[ 1] I this equatio, y[] is the curret output, y[ 1] is the previous

More information

Computational Fluid Dynamics. Lecture 3

Computational Fluid Dynamics. Lecture 3 Computatioal Fluid Dyamics Lecture 3 Discretizatio Cotiued. A fourth order approximatio to f x ca be foud usig Taylor Series. ( + ) + ( + ) + + ( ) + ( ) = a f x x b f x x c f x d f x x e f x x f x 0 0

More information

EECE 301 Signals & Systems

EECE 301 Signals & Systems EECE 301 Sigals & Systems Prof. Mark Fowler Note Set #8 D-T Covolutio: The Tool for Fidig the Zero-State Respose Readig Assigmet: Sectio 2.1-2.2 of Kame ad Heck 1/14 Course Flow Diagram The arrows here

More information

Introduction to Functional Analysis

Introduction to Functional Analysis MIT OpeCourseWare http://ocw.mit.edu 18.10 Itroductio to Fuctioal Aalysis Sprig 009 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. LECTURE OTES FOR 18.10,

More information

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

Discrete-Time Signals and Systems. Signals and Systems. Digital Signals. Discrete-Time Signals. Operations on Sequences: Basic Operations -6.3 Digital Sigal Processig ad Filterig..8 Discrete-ime Sigals ad Systems ime-domai Represetatios of Discrete-ime Sigals ad Systems ime-domai represetatio of a discrete-time sigal as a sequece of umbers

More information

Introduction to Optimization Techniques. How to Solve Equations

Introduction to Optimization Techniques. How to Solve Equations Itroductio to Optimizatio Techiques How to Solve Equatios Iterative Methods of Optimizatio Iterative methods of optimizatio Solutio of the oliear equatios resultig form a optimizatio problem is usually

More information

Introduction to Optimization Techniques

Introduction to Optimization Techniques Itroductio to Optimizatio Techiques Basic Cocepts of Aalysis - Real Aalysis, Fuctioal Aalysis 1 Basic Cocepts of Aalysis Liear Vector Spaces Defiitio: A vector space X is a set of elemets called vectors

More information

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

Generalizing the DTFT. The z Transform. Complex Exponential Excitation. The Transfer Function. Systems Described by Difference Equations Geeraliig the DTFT The Trasform M. J. Roberts - All Rights Reserved. Edited by Dr. Robert Akl 1 The forward DTFT is defied by X e jω = x e jω i which = Ω is discrete-time radia frequecy, a real variable.

More information

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)

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) Real Numbers The least upper boud - Let B be ay subset of R B is bouded above if there is a k R such that x k for all x B - A real umber, k R is a uique least upper boud of B, ie k = LUB(B), if () k is

More information

ELEG3503 Introduction to Digital Signal Processing

ELEG3503 Introduction to Digital Signal Processing ELEG3503 Itroductio to Digital Sigal Processig 1 Itroductio 2 Basics of Sigals ad Systems 3 Fourier aalysis 4 Samplig 5 Liear time-ivariat (LTI) systems 6 z-trasform 7 System Aalysis 8 System Realizatio

More information

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

ECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations ECE-S352 Itroductio to Digital Sigal Processig Lecture 3A Direct Solutio of Differece Equatios Discrete Time Systems Described by Differece Equatios Uit impulse (sample) respose h() of a DT system allows

More information

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

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science. BACKGROUND EXAM September 30, 2004. MASSACHUSETTS INSTITUTE OF TECHNOLOGY Departmet of Electrical Egieerig ad Computer Sciece 6.34 Discrete Time Sigal Processig Fall 24 BACKGROUND EXAM September 3, 24. Full Name: Note: This exam is closed

More information

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

Linear Elliptic PDE s Elliptic partial differential equations frequently arise out of conservation statements of the form Liear Elliptic PDE s Elliptic partial differetial equatios frequetly arise out of coservatio statemets of the form B F d B Sdx B cotaied i bouded ope set U R. Here F, S deote respectively, the flux desity

More information

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

Goal. Adaptive Finite Element Methods for Non-Stationary Convection-Diffusion Problems. Outline. Differential Equation Goal Adaptive Fiite Elemet Methods for No-Statioary Covectio-Diffusio Problems R. Verfürth Ruhr-Uiversität Bochum www.ruhr-ui-bochum.de/um1 Tübige / July 0th, 017 Preset space-time adaptive fiite elemet

More information

Frequency Domain Filtering

Frequency Domain Filtering Frequecy Domai Filterig Raga Rodrigo October 19, 2010 Outlie Cotets 1 Itroductio 1 2 Fourier Represetatio of Fiite-Duratio Sequeces: The Discrete Fourier Trasform 1 3 The 2-D Discrete Fourier Trasform

More information

Orthogonal Gaussian Filters for Signal Processing

Orthogonal Gaussian Filters for Signal Processing Orthogoal Gaussia Filters for Sigal Processig Mark Mackezie ad Kiet Tieu Mechaical Egieerig Uiversity of Wollogog.S.W. Australia Abstract A Gaussia filter usig the Hermite orthoormal series of fuctios

More information

SCORE. Exam 2. MA 114 Exam 2 Fall 2016

SCORE. Exam 2. MA 114 Exam 2 Fall 2016 MA 4 Exam Fall 06 Exam Name: Sectio ad/or TA: Do ot remove this aswer page you will retur the whole exam. You will be allowed two hours to complete this test. No books or otes may be used. You may use

More information

Mathematical Methods for Physics and Engineering

Mathematical Methods for Physics and Engineering Mathematical Methods for Physics ad Egieerig Lecture otes Sergei V. Shabaov Departmet of Mathematics, Uiversity of Florida, Gaiesville, FL 326 USA CHAPTER The theory of covergece. Numerical sequeces..

More information

Fall 2013 MTH431/531 Real analysis Section Notes

Fall 2013 MTH431/531 Real analysis Section Notes Fall 013 MTH431/531 Real aalysis Sectio 8.1-8. Notes Yi Su 013.11.1 1. Defiitio of uiform covergece. We look at a sequece of fuctios f (x) ad study the coverget property. Notice we have two parameters

More information

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

Indian Statistical Institute, Bangalore Centre Solution set of M.Math II Year, End-Sem Examination 2015 Fourier Analysis Idia Statistical Istitute, Bagalore Cetre Solutio set of M.Math II Year, Ed-Sem Examiatio 05 Fourier Aalysis Note: We use the followig otatios L () L ad L () L.. Prove that f, ˆf L the f L. Proof. Sice

More information

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

Review of Discrete-time Signals. ELEC 635 Prof. Siripong Potisuk Review of Discrete-time Sigals ELEC 635 Prof. Siripog Potisuk 1 Discrete-time Sigals Discrete-time, cotiuous-valued amplitude (sampled-data sigal) Discrete-time, discrete-valued amplitude (digital sigal)

More information

6.003 Homework #3 Solutions

6.003 Homework #3 Solutions 6.00 Homework # Solutios Problems. Complex umbers a. Evaluate the real ad imagiary parts of j j. π/ Real part = Imagiary part = 0 e Euler s formula says that j = e jπ/, so jπ/ j π/ j j = e = e. Thus the

More information

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 +

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 + 62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of

More information

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

A Negative Result. We consider the resolvent problem for the scalar Oseen equation O Osee Resolvet Estimates: A Negative Result Paul Deurig Werer Varhor 2 Uiversité Lille 2 Uiversität Kassel Laboratoire de Mathématiques BP 699, 62228 Calais cédex Frace paul.deurig@lmpa.uiv-littoral.fr

More information

Sequences and Limits

Sequences and Limits Chapter Sequeces ad Limits Let { a } be a sequece of real or complex umbers A ecessary ad sufficiet coditio for the sequece to coverge is that for ay ɛ > 0 there exists a iteger N > 0 such that a p a q

More information

: Transforms and Partial Differential Equations

: Transforms and Partial Differential Equations Trasforms ad Partial Differetial Equatios 018 SUBJECT NAME : Trasforms ad Partial Differetial Equatios SUBJECT CODE : MA 6351 MATERIAL NAME : Part A questios REGULATION : R013 WEBSITE : wwwharigaeshcom

More information

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

ON THE EXISTENCE OF A GROUP ORTHONORMAL BASIS. Peter Zizler (Received 20 June, 2014) NEW ZEALAND JOURNAL OF MATHEMATICS Volume 45 (2015, 45-52 ON THE EXISTENCE OF A GROUP ORTHONORMAL BASIS Peter Zizler (Received 20 Jue, 2014 Abstract. Let G be a fiite group ad let l 2 (G be a fiite dimesioal

More information

Solutions to home assignments (sketches)

Solutions to home assignments (sketches) Matematiska Istitutioe Peter Kumli 26th May 2004 TMA401 Fuctioal Aalysis MAN670 Applied Fuctioal Aalysis 4th quarter 2003/2004 All documet cocerig the course ca be foud o the course home page: http://www.math.chalmers.se/math/grudutb/cth/tma401/

More information

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

Mathematical Description of Discrete-Time Signals. 9/10/16 M. J. Roberts - All Rights Reserved 1 Mathematical Descriptio of Discrete-Time Sigals 9/10/16 M. J. Roberts - All Rights Reserved 1 Samplig ad Discrete Time Samplig is the acquisitio of the values of a cotiuous-time sigal at discrete poits

More information

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

x[0] x[1] x[2] Figure 2.1 Graphical representation of a discrete-time signal. x[ ] x[ ] x[] x[] x[] x[] 9 8 7 6 5 4 3 3 4 5 6 7 8 9 Figure. Graphical represetatio of a discrete-time sigal. From Discrete-Time Sigal Processig, e by Oppeheim, Schafer, ad Buck 999- Pretice Hall, Ic.

More information

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

PH 411/511 ECE B(k) Sin k (x) dk (1) Fall-26 PH 4/5 ECE 598 A. La Rosa Homework-2 Due -3-26 The Homework is iteded to gai a uderstadig o the Heiseberg priciple, based o a compariso betwee the width of a pulse ad the width of its spectral

More information

FIR Filter Design: Part II

FIR Filter Design: Part II EEL335: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we cosider how we might go about desigig FIR filters with arbitrary frequecy resposes, through compositio of multiple sigle-peak

More information

Measure and Measurable Functions

Measure and Measurable Functions 3 Measure ad Measurable Fuctios 3.1 Measure o a Arbitrary σ-algebra Recall from Chapter 2 that the set M of all Lebesgue measurable sets has the followig properties: R M, E M implies E c M, E M for N implies

More information

Sequences and Series of Functions

Sequences and Series of Functions Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges

More information

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

A) is empty. B) is a finite set. C) can be a countably infinite set. D) can be an uncountable set. M.A./M.Sc. (Mathematics) Etrace Examiatio 016-17 Max Time: hours Max Marks: 150 Istructios: There are 50 questios. Every questio has four choices of which exactly oe is correct. For correct aswer, 3 marks

More information

1. Hydrogen Atom: 3p State

1. Hydrogen Atom: 3p State 7633A QUANTUM MECHANICS I - solutio set - autum. Hydroge Atom: 3p State Let us assume that a hydroge atom is i a 3p state. Show that the radial part of its wave fuctio is r u 3(r) = 4 8 6 e r 3 r(6 r).

More information

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

LECTURE 21. DISCUSSION OF MIDTERM EXAM. θ [0, 2π). f(θ) = π θ 2 LECTURE. DISCUSSION OF MIDTERM EXAM FOURIER ANALYSIS (.443) PROF. QIAO ZHANG Problem. Cosider the itegrable -periodic fuctio f(θ) = θ θ [, ). () Compute the Fourier series for f(θ). () Discuss the covergece

More information

Dynamic Response of Linear Systems

Dynamic Response of Linear Systems Dyamic Respose of Liear Systems Liear System Respose Superpositio Priciple Resposes to Specific Iputs Dyamic Respose of st Order Systems Characteristic Equatio - Free Respose Stable st Order System Respose

More information

A Note on Integrals & Hybrid Contours in the Complex Plane

A Note on Integrals & Hybrid Contours in the Complex Plane A Note o Itegrals & Hybrid Cotours i the Complex Plae Joh Gill July 4 Abstract: Cotour itegrals ca be expressed graphically as simple vectors arisig from a secodary cotour. We start with a well-behaved

More information

LECTURE 8: ORTHOGONALITY (CHAPTER 5 IN THE BOOK)

LECTURE 8: ORTHOGONALITY (CHAPTER 5 IN THE BOOK) LECTURE 8: ORTHOGONALITY (CHAPTER 5 IN THE BOOK) Everythig marked by is ot required by the course syllabus I this lecture, all vector spaces is over the real umber R. All vectors i R is viewed as a colum

More information

Signals & Systems Chapter3

Signals & Systems Chapter3 Sigals & Systems Chapter3 1.2 Discrete-Time (D-T) Sigals Electroic systems do most of the processig of a sigal usig a computer. A computer ca t directly process a C-T sigal but istead eeds a stream of

More information

Brief Review of Functions of Several Variables

Brief Review of Functions of Several Variables Brief Review of Fuctios of Several Variables Differetiatio Differetiatio Recall, a fuctio f : R R is differetiable at x R if ( ) ( ) lim f x f x 0 exists df ( x) Whe this limit exists we call it or f(

More information

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

Practical Spectral Anaysis (continue) (from Boaz Porat s book) Frequency Measurement Practical Spectral Aaysis (cotiue) (from Boaz Porat s book) Frequecy Measuremet Oe of the most importat applicatios of the DFT is the measuremet of frequecies of periodic sigals (eg., siusoidal sigals),

More information

Math Solutions to homework 6

Math Solutions to homework 6 Math 175 - Solutios to homework 6 Cédric De Groote November 16, 2017 Problem 1 (8.11 i the book): Let K be a compact Hermitia operator o a Hilbert space H ad let the kerel of K be {0}. Show that there

More information

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

Derivation of the Fourier Inversion Formula, Bochner s Theorem, and Herglotz s Theorem 1 Derivatio of the Fourier Iversio Formula, Bocher s Theorem, ad Herglotz s Theorem Joh A. Guber Departmet of Electrical ad Computer Egieerig Uiversity of Wiscosi Madiso Cotets 1 Respose of Liear Time-Ivariat

More information

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

DETERMINATION OF MECHANICAL PROPERTIES OF A NON- UNIFORM BEAM USING THE MEASUREMENT OF THE EXCITED LONGITUDINAL ELASTIC VIBRATIONS. ICSV4 Cairs Australia 9- July 7 DTRMINATION OF MCHANICAL PROPRTIS OF A NON- UNIFORM BAM USING TH MASURMNT OF TH XCITD LONGITUDINAL LASTIC VIBRATIONS Pavel Aokhi ad Vladimir Gordo Departmet of the mathematics

More information