EE16B - Spring 17 - Lecture 12A Notes 1

Size: px
Start display at page:

Download "EE16B - Spring 17 - Lecture 12A Notes 1"

Transcription

1 EE6B - Spring 7 - Lecture 2A Notes Murat Arcak April 27 Licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4. International License. Sampling and Discrete Time Signals Discrete-Time Control of Continuous-Time Systems In a typical application the control algorithm for a continuous-time physical system is executed in discrete-time. Thus, the measured output must be sampled before being fed to the control algorithm. Conversely, the discrete-time control input generated by the algorithm must be interpolated into a continuous-time function, typically with a zero order hold, before being applied back to the system. This scheme is depicted in the block diagram below. We let T denote the sampling period and represent the samples of the output y(t) at t = kt, k =,, 2,... by y d (k) = y(kt) where the subscript d" stands for discrete-time. The control sequence generated in discrete time is denoted u d (k) and is interpolated by the zero order hold block to the continuous-time input u(t) = u d (k) t [kt, (k + )T). () u d (k) zero order hold u(t) continuous-time system y(t) sampling y d (k) = y(kt) discrete-time control To design a discrete-time control algorithm we need to represent the continuous-time system, combined with the zero order hold and sampling blocks, with a discrete-time model. This combination is depicted with the dashed box in the figure above, with input u d (k) and output y d (k). Suppose the continuous-time system model is d x(t) = A x(t) + Bu(t) dt y(t) = C x(t) (2)

2 ee6b - spring 7 - lecture 2a notes 2 and we wish to obtain a discrete-time model x d (k + ) = A d x(k) + B d u d (k) y d (k) = C d x d (k) (3) where x d (k) is the value of the state x(t) at time t = kt. It follows that C d = C because y d (k) = y(kt) = C x(kt) = C x d (k). To see how A d and B d in (3) can be obtained let s first assume A = a and B = b are scalars. Recall from Lecture 5B that in this case the solution of the differential equation (2) with initial condition x() is t x(t) = e at x() + b e a(t s) u(s)ds. (4) Since u(s) is constant in the interval s [, T) and equal to u d (), the solution at t = T is x(t) = e at x() + eat b u }{{}}{{} a d () x d () x d () and a generalization of this argument shows Thus we conclude that x d (k + ) = e at x d (k) + eat b u a d (k). A d = e at and B d = eat b. a Next assume A is not scalar but diagonal, and B is an arbitrary column vector: A = λ... λ n B = b.. Recall that any linear system where A is diagonalizable can be brought to this form with a change of state variables. Then (2) decouples into scalar differential equations d dt x i(t) = λ i x i (t) + b i u(t) and we conclude from the arguments above that b n i =,..., n x d,i (k + ) = e λit x d,i (k) + eλit b λ i u d (k). i

3 ee6b - spring 7 - lecture 2a notes 3 Concatenating x d,i, i =,..., n, into the vector x d we obtain the discrete-time model (3) with A d = e λ T... e λ nt B = e λ T λ b. e λnt λ n b n A natural question to ask is whether stability of the continuoustime model implies stability of the discretized model. To see that the answer is yes note that an eigenvalue of A at maps to an eigenvalue of A d at whose magnitude is λ = v + jω λ d = e λt = e vt e jωt λ d = e vt. Thus, if λ satisfies the continuous-time stability criterion Re(λ) = v < then λ d satisfies the discrete-time stability criterion λ d = e vt <. Indeed, as depicted in the figure below, λ e λt maps the imaginary axis in the complex plane to the unit circle, and the left hand side of the imaginary axis to the interior of the unit circle.. Im(λ) e λt Im(e λt ) Re(λ) Re(e λt ) Although stability is maintained, controllability and observability properties may not be preserved when we control and observe a system in discrete time. You will investigate the potential loss of observability in a homework problem.

4 ee6b - spring 7 - lecture 2a notes 4 Discrete-Time Signals as Vectors Consider a discrete-time signal x(t) that consists of N samples, t =,,..., N. To prepare for Discrete Fourier Transforms to be discussed in subsequent lectures we interpret this signal as a vector, x() x() x =.. x(n ) This viewpoint allows us to define the inner product of two signals x(t) and y(t) as x T N y = x(t)y(t) t= and to declare two signals to be orthogonal when this inner product is zero. For example, you should be able to verify by inspection that the eight signals depicted below are orthogonal to each other Interpreting discrete time signals as vectors allows us to introduce new "basis signals" such as those depicted above, which provide an orthogonal basis for length-8 sequences. Special basis functions are commonly used in compressing images, videos, soundtracks, etc. As an illustration consider a -second soundtrack recorded at 44. khz, which contains 444, samples. Instead of viewing this signal

5 ee6b - spring 7 - lecture 2a notes 5 as a linear combination of the standard basis signals {,,... }, {,,,... }, {,,, },..., each multiplied by the value of the corresponding sample, we can choose a different basis where some of the signals are less important for the sound quality than others, e.g. high frequency sinusoidal signals that are inaudible. This allows one to reduce the file size by either ignoring the coefficients of the insignificant basis signals or by quantizing them with fewer bits. Example: The "Discrete Cosine Transform" (DCT) has been employed in standards for image and video compression, such as JPEG 2 and MPEG 3. One type of DCT, called DCT-2, represents a signal as a linear combination of the basis signals ( ) πk u k (t) = cos (2t + ) t =,,, N, 2N k =,,..., N, where larger k indicates a higher frequency. The first four of these basis signals (k =,, 2, 3) are depicted below. 2 Joint Photographic Experts Group 3 Moving Picture Experts Group u (t) u (t) u 2 (t) u 3 (t) The following identity, whose proof is omitted, shows that the basis signals defined above are orthogonal: u k T N ( ) πk ( πm ) u m = cos (2t + ) cos 2N 2N (2t + ) = t= N if k = m = N 2 if k = m = if k = m. It also suggests that we can make this basis orthonormal if we divide u ( ) by N, and u ( ),, u N ( ) by N/2.

EE16B - Spring 17 - Lecture 11B Notes 1

EE16B - Spring 17 - Lecture 11B Notes 1 EE6B - Spring 7 - Lecture B Notes Murat Arcak 6 April 207 Licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License. Interpolation with Basis Functions Recall that

More information

Designing Information Devices and Systems II Fall 2016 Murat Arcak and Michel Maharbiz Homework 11. This homework is due November 14, 2016, at Noon.

Designing Information Devices and Systems II Fall 2016 Murat Arcak and Michel Maharbiz Homework 11. This homework is due November 14, 2016, at Noon. EECS 16B Designing Information Devices and Systems II Fall 2016 Murat Arcak and Michel Maharbiz Homework 11 This homework is due November 14, 2016, at Noon. 1. Homework process and study group (a) Who

More information

2. the basis functions have different symmetries. 1 k = 0. x( t) 1 t 0 x(t) 0 t 1

2. the basis functions have different symmetries. 1 k = 0. x( t) 1 t 0 x(t) 0 t 1 In the next few lectures, we will look at a few examples of orthobasis expansions that are used in modern signal processing. Cosine transforms The cosine-i transform is an alternative to Fourier series;

More information

Homogeneous Linear Systems of Differential Equations with Constant Coefficients

Homogeneous Linear Systems of Differential Equations with Constant Coefficients Objective: Solve Homogeneous Linear Systems of Differential Equations with Constant Coefficients dx a x + a 2 x 2 + + a n x n, dx 2 a 2x + a 22 x 2 + + a 2n x n,. dx n = a n x + a n2 x 2 + + a nn x n.

More information

MTH 464: Computational Linear Algebra

MTH 464: Computational Linear Algebra MTH 464: Computational Linear Algebra Lecture Outlines Exam 4 Material Prof. M. Beauregard Department of Mathematics & Statistics Stephen F. Austin State University April 15, 2018 Linear Algebra (MTH 464)

More information

Eigenvalues in Applications

Eigenvalues in Applications Eigenvalues in Applications Abstract We look at the role of eigenvalues and eigenvectors in various applications. Specifically, we consider differential equations, Markov chains, population growth, and

More information

6.003: Signals and Systems. Sampling and Quantization

6.003: Signals and Systems. Sampling and Quantization 6.003: Signals and Systems Sampling and Quantization December 1, 2009 Last Time: Sampling and Reconstruction Uniform sampling (sampling interval T ): x[n] = x(nt ) t n Impulse reconstruction: x p (t) =

More information

ECE 301 Fall 2010 Division 2 Homework 10 Solutions. { 1, if 2n t < 2n + 1, for any integer n, x(t) = 0, if 2n 1 t < 2n, for any integer n.

ECE 301 Fall 2010 Division 2 Homework 10 Solutions. { 1, if 2n t < 2n + 1, for any integer n, x(t) = 0, if 2n 1 t < 2n, for any integer n. ECE 3 Fall Division Homework Solutions Problem. Reconstruction of a continuous-time signal from its samples. Consider the following periodic signal, depicted below: {, if n t < n +, for any integer n,

More information

Good Luck. EE 637 Final May 4, Spring Name: Instructions: This is a 120 minute exam containing five problems.

Good Luck. EE 637 Final May 4, Spring Name: Instructions: This is a 120 minute exam containing five problems. EE 637 Final May 4, Spring 200 Name: Instructions: This is a 20 minute exam containing five problems. Each problem is worth 20 points for a total score of 00 points You may only use your brain and a pencil

More information

CMPT 318: Lecture 5 Complex Exponentials, Spectrum Representation

CMPT 318: Lecture 5 Complex Exponentials, Spectrum Representation CMPT 318: Lecture 5 Complex Exponentials, Spectrum Representation Tamara Smyth, tamaras@cs.sfu.ca School of Computing Science, Simon Fraser University January 23, 2006 1 Exponentials The exponential is

More information

Math 304 Answers to Selected Problems

Math 304 Answers to Selected Problems Math Answers to Selected Problems Section 6.. Find the general solution to each of the following systems. a y y + y y y + y e y y y y y + y f y y + y y y + 6y y y + y Answer: a This is a system of the

More information

Matrix-Exponentials. September 7, dx dt = ax. x(t) = e at x(0)

Matrix-Exponentials. September 7, dx dt = ax. x(t) = e at x(0) Matrix-Exponentials September 7, 207 In [4]: using PyPlot INFO: Recompiling stale cache file /Users/stevenj/.julia/lib/v0.5/LaTeXStrings.ji for module LaTeXString Review: Solving ODEs via eigenvectors

More information

Lecture 8 - IIR Filters (II)

Lecture 8 - IIR Filters (II) Lecture 8 - IIR Filters (II) James Barnes (James.Barnes@colostate.edu) Spring 2009 Colorado State University Dept of Electrical and Computer Engineering ECE423 1 / 27 Lecture 8 Outline Introduction Digital

More information

Transforms and Orthogonal Bases

Transforms and Orthogonal Bases Orthogonal Bases Transforms and Orthogonal Bases We now turn back to linear algebra to understand transforms, which map signals between different domains Recall that signals can be interpreted as vectors

More information

EE222 - Spring 16 - Lecture 2 Notes 1

EE222 - Spring 16 - Lecture 2 Notes 1 EE222 - Spring 16 - Lecture 2 Notes 1 Murat Arcak January 21 2016 1 Licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License. Essentially Nonlinear Phenomena Continued

More information

The Exponential of a Matrix

The Exponential of a Matrix The Exponential of a Matrix 5-8- The solution to the exponential growth equation dx dt kx is given by x c e kt It is natural to ask whether you can solve a constant coefficient linear system x A x in a

More information

The Fourier Transform (and more )

The Fourier Transform (and more ) The Fourier Transform (and more ) imrod Peleg ov. 5 Outline Introduce Fourier series and transforms Introduce Discrete Time Fourier Transforms, (DTFT) Introduce Discrete Fourier Transforms (DFT) Consider

More information

Linear Algebra Review (Course Notes for Math 308H - Spring 2016)

Linear Algebra Review (Course Notes for Math 308H - Spring 2016) Linear Algebra Review (Course Notes for Math 308H - Spring 2016) Dr. Michael S. Pilant February 12, 2016 1 Background: We begin with one of the most fundamental notions in R 2, distance. Letting (x 1,

More information

ME Fall 2001, Fall 2002, Spring I/O Stability. Preliminaries: Vector and function norms

ME Fall 2001, Fall 2002, Spring I/O Stability. Preliminaries: Vector and function norms I/O Stability Preliminaries: Vector and function norms 1. Sup norms are used for vectors for simplicity: x = max i x i. Other norms are also okay 2. Induced matrix norms: let A R n n, (i stands for induced)

More information

X. Chen More on Sampling

X. Chen More on Sampling X. Chen More on Sampling 9 More on Sampling 9.1 Notations denotes the sampling time in second. Ω s = 2π/ and Ω s /2 are, respectively, the sampling frequency and Nyquist frequency in rad/sec. Ω and ω denote,

More information

Homework 6 EE235, Spring 2011

Homework 6 EE235, Spring 2011 Homework 6 EE235, Spring 211 1. Fourier Series. Determine w and the non-zero Fourier series coefficients for the following functions: (a 2 cos(3πt + sin(1πt + π 3 w π e j3πt + e j3πt + 1 j2 [ej(1πt+ π

More information

Signals & Systems. Lecture 5 Continuous-Time Fourier Transform. Alp Ertürk

Signals & Systems. Lecture 5 Continuous-Time Fourier Transform. Alp Ertürk Signals & Systems Lecture 5 Continuous-Time Fourier Transform Alp Ertürk alp.erturk@kocaeli.edu.tr Fourier Series Representation of Continuous-Time Periodic Signals Synthesis equation: x t = a k e jkω

More information

Chapter 3 Transformations

Chapter 3 Transformations Chapter 3 Transformations An Introduction to Optimization Spring, 2014 Wei-Ta Chu 1 Linear Transformations A function is called a linear transformation if 1. for every and 2. for every If we fix the bases

More information

Understanding the Matrix Exponential

Understanding the Matrix Exponential Transformations Understanding the Matrix Exponential Lecture 8 Math 634 9/17/99 Now that we have a representation of the solution of constant-coefficient initial-value problems, we should ask ourselves:

More information

A Brief Outline of Math 355

A Brief Outline of Math 355 A Brief Outline of Math 355 Lecture 1 The geometry of linear equations; elimination with matrices A system of m linear equations with n unknowns can be thought of geometrically as m hyperplanes intersecting

More information

systems of linear di erential If the homogeneous linear di erential system is diagonalizable,

systems of linear di erential If the homogeneous linear di erential system is diagonalizable, G. NAGY ODE October, 8.. Homogeneous Linear Differential Systems Section Objective(s): Linear Di erential Systems. Diagonalizable Systems. Real Distinct Eigenvalues. Complex Eigenvalues. Repeated Eigenvalues.

More information

Linear Algebra 2 Spectral Notes

Linear Algebra 2 Spectral Notes Linear Algebra 2 Spectral Notes In what follows, V is an inner product vector space over F, where F = R or C. We will use results seen so far; in particular that every linear operator T L(V ) has a complex

More information

Matrix Solutions to Linear Systems of ODEs

Matrix Solutions to Linear Systems of ODEs Matrix Solutions to Linear Systems of ODEs James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University November 3, 216 Outline 1 Symmetric Systems of

More information

Introduction to Signal Spaces

Introduction to Signal Spaces Introduction to Signal Spaces Selin Aviyente Department of Electrical and Computer Engineering Michigan State University January 12, 2010 Motivation Outline 1 Motivation 2 Vector Space 3 Inner Product

More information

Compressing a 1D Discrete Signal

Compressing a 1D Discrete Signal Compressing a D Discrete Signal Divide the signal into 8blocks. Subtract the sample mean from each value. Compute the 8 8covariancematrixforthe blocks. Compute the eigenvectors of the covariance matrix.

More information

Signals and Systems Lecture (S2) Orthogonal Functions and Fourier Series March 17, 2008

Signals and Systems Lecture (S2) Orthogonal Functions and Fourier Series March 17, 2008 Signals and Systems Lecture (S) Orthogonal Functions and Fourier Series March 17, 008 Today s Topics 1. Analogy between functions of time and vectors. Fourier series Take Away Periodic complex exponentials

More information

University of British Columbia Math 307, Final

University of British Columbia Math 307, Final 1 University of British Columbia Math 37, Final April 29, 214 12.-2.3pm Name: Student Number: Signature: Instructor: Instructions: 1. No notes, books or calculators are allowed. A MATLAB/Octave formula

More information

Image Data Compression

Image Data Compression Image Data Compression Image data compression is important for - image archiving e.g. satellite data - image transmission e.g. web data - multimedia applications e.g. desk-top editing Image data compression

More information

6.003: Signals and Systems Lecture 18 April 13, 2010

6.003: Signals and Systems Lecture 18 April 13, 2010 6.003: Signals and Systems Lecture 8 April 3, 200 6.003: Signals and Systems Discrete-Time Frequency Representations Signals and/or Systems Two perspectives: feedback and control (focus on systems) X +

More information

EE16B Designing Information Devices and Systems II

EE16B Designing Information Devices and Systems II EE6B M. Lustig, EECS UC Berkeley EE6B Designing Information Devices and Systems II Lecture 6B Cont. stability of Linear State Models Controllability Today Last time: Derived stability conditions for disc.

More information

MIT Final Exam Solutions, Spring 2017

MIT Final Exam Solutions, Spring 2017 MIT 8.6 Final Exam Solutions, Spring 7 Problem : For some real matrix A, the following vectors form a basis for its column space and null space: C(A) = span,, N(A) = span,,. (a) What is the size m n of

More information

Two-Dimensional Signal Processing and Image De-noising

Two-Dimensional Signal Processing and Image De-noising Two-Dimensional Signal Processing and Image De-noising Alec Koppel, Mark Eisen, Alejandro Ribeiro March 14, 2016 Before we considered (one-dimensional) discrete signals of the form x : [0, N 1] C where

More information

2. Review of Linear Algebra

2. Review of Linear Algebra 2. Review of Linear Algebra ECE 83, Spring 217 In this course we will represent signals as vectors and operators (e.g., filters, transforms, etc) as matrices. This lecture reviews basic concepts from linear

More information

MATH 20F: LINEAR ALGEBRA LECTURE B00 (T. KEMP)

MATH 20F: LINEAR ALGEBRA LECTURE B00 (T. KEMP) MATH 20F: LINEAR ALGEBRA LECTURE B00 (T KEMP) Definition 01 If T (x) = Ax is a linear transformation from R n to R m then Nul (T ) = {x R n : T (x) = 0} = Nul (A) Ran (T ) = {Ax R m : x R n } = {b R m

More information

16.362: Signals and Systems: 1.0

16.362: Signals and Systems: 1.0 16.362: Signals and Systems: 1.0 Prof. K. Chandra ECE, UMASS Lowell September 1, 2016 1 Background The pre-requisites for this course are Calculus II and Differential Equations. A basic understanding of

More information

Homework: 4.50 & 4.51 of the attachment Tutorial Problems: 7.41, 7.44, 7.47, Signals & Systems Sampling P1

Homework: 4.50 & 4.51 of the attachment Tutorial Problems: 7.41, 7.44, 7.47, Signals & Systems Sampling P1 Homework: 4.50 & 4.51 of the attachment Tutorial Problems: 7.41, 7.44, 7.47, 7.49 Signals & Systems Sampling P1 Undersampling & Aliasing Undersampling: insufficient sampling frequency ω s < 2ω M Perfect

More information

Lecture 8 - IIR Filters (II)

Lecture 8 - IIR Filters (II) Lecture 8 - IIR Filters (II) James Barnes (James.Barnes@colostate.edu) Spring 24 Colorado State University Dept of Electrical and Computer Engineering ECE423 1 / 29 Lecture 8 Outline Introduction Digital

More information

EEL3135: Homework #3 Solutions

EEL3135: Homework #3 Solutions EEL335: Homework #3 Solutions Problem : (a) Compute the CTFT for the following signal: xt () cos( πt) cos( 3t) + cos( 4πt). First, we use the trigonometric identity (easy to show by using the inverse Euler

More information

M403(2012) Solutions Problem Set 1 (c) 2012, Philip D. Loewen. = ( 1 λ) 2 k, k 1 λ

M403(2012) Solutions Problem Set 1 (c) 2012, Philip D. Loewen. = ( 1 λ) 2 k, k 1 λ M43(22) Solutions Problem Set (c) 22, Philip D. Loewen. The number λ C is an eigenvalue for A exactly when λ = det(a λi) = det = ( λ) 2 k, k λ i.e., when λ = ± k. (i) When k = 2, the eigenvalues are ±

More information

Transform coding - topics. Principle of block-wise transform coding

Transform coding - topics. Principle of block-wise transform coding Transform coding - topics Principle of block-wise transform coding Properties of orthonormal transforms Discrete cosine transform (DCT) Bit allocation for transform Threshold coding Typical coding artifacts

More information

Designing Information Devices and Systems II Spring 2017 Murat Arcak and Michel Maharbiz Homework 9

Designing Information Devices and Systems II Spring 2017 Murat Arcak and Michel Maharbiz Homework 9 EECS 16B Designing Information Devices and Systems II Spring 2017 Murat Arcak and Michel Maharbiz Homework 9 This homework is due April 5, 2017, at 17:00. 1. Midterm 2 - Question 1 Redo the midterm! 2.

More information

Topic # /31 Feedback Control Systems

Topic # /31 Feedback Control Systems Topic #7 16.30/31 Feedback Control Systems State-Space Systems What are the basic properties of a state-space model, and how do we analyze these? Time Domain Interpretations System Modes Fall 2010 16.30/31

More information

Discrete and continuous dynamic systems

Discrete and continuous dynamic systems Discrete and continuous dynamic systems Bounded input bounded output (BIBO) and asymptotic stability Continuous and discrete time linear time-invariant systems Katalin Hangos University of Pannonia Faculty

More information

The Geometry of R n. Supplemental Lecture Notes for Linear Algebra Courses at Georgia Tech

The Geometry of R n. Supplemental Lecture Notes for Linear Algebra Courses at Georgia Tech The Geometry of R n Supplemental Lecture Notes for Linear Algebra Courses at Georgia Tech Contents Vectors in R n. Vectors....................................... The Length and Direction of a Vector......................3

More information

6.003: Signals and Systems

6.003: Signals and Systems 6.003: Signals and Systems Discrete-Time Frequency Representations November 8, 2011 1 Mid-term Examination #3 Wednesday, November 16, 7:30-9:30pm, No recitations on the day of the exam. Coverage: Lectures

More information

MATH 412 Fourier Series and PDE- Spring 2010 SOLUTIONS to HOMEWORK 5

MATH 412 Fourier Series and PDE- Spring 2010 SOLUTIONS to HOMEWORK 5 MATH 4 Fourier Series PDE- Spring SOLUTIONS to HOMEWORK 5 Problem (a: Solve the following Sturm-Liouville problem { (xu + λ x u = < x < e u( = u (e = (b: Show directly that the eigenfunctions are orthogonal

More information

Lecture 6. Eigen-analysis

Lecture 6. Eigen-analysis Lecture 6 Eigen-analysis University of British Columbia, Vancouver Yue-Xian Li March 7 6 Definition of eigenvectors and eigenvalues Def: Any n n matrix A defines a LT, A : R n R n A vector v and a scalar

More information

MTH 5102 Linear Algebra Practice Final Exam April 26, 2016

MTH 5102 Linear Algebra Practice Final Exam April 26, 2016 Name (Last name, First name): MTH 5 Linear Algebra Practice Final Exam April 6, 6 Exam Instructions: You have hours to complete the exam. There are a total of 9 problems. You must show your work and write

More information

Control Systems I. Lecture 4: Diagonalization, Modal Analysis, Intro to Feedback. Readings: Emilio Frazzoli

Control Systems I. Lecture 4: Diagonalization, Modal Analysis, Intro to Feedback. Readings: Emilio Frazzoli Control Systems I Lecture 4: Diagonalization, Modal Analysis, Intro to Feedback Readings: Emilio Frazzoli Institute for Dynamic Systems and Control D-MAVT ETH Zürich October 13, 2017 E. Frazzoli (ETH)

More information

21 Linear State-Space Representations

21 Linear State-Space Representations ME 132, Spring 25, UC Berkeley, A Packard 187 21 Linear State-Space Representations First, let s describe the most general type of dynamic system that we will consider/encounter in this class Systems may

More information

L29: Fourier analysis

L29: Fourier analysis L29: Fourier analysis Introduction The discrete Fourier Transform (DFT) The DFT matrix The Fast Fourier Transform (FFT) The Short-time Fourier Transform (STFT) Fourier Descriptors CSCE 666 Pattern Analysis

More information

The integrating factor method (Sect. 1.1)

The integrating factor method (Sect. 1.1) The integrating factor method (Sect. 1.1) Overview of differential equations. Linear Ordinary Differential Equations. The integrating factor method. Constant coefficients. The Initial Value Problem. Overview

More information

01 Harmonic Oscillations

01 Harmonic Oscillations Utah State University DigitalCommons@USU Foundations of Wave Phenomena Library Digital Monographs 8-2014 01 Harmonic Oscillations Charles G. Torre Department of Physics, Utah State University, Charles.Torre@usu.edu

More information

Chap 4. Sampling of Continuous-Time Signals

Chap 4. Sampling of Continuous-Time Signals Digital Signal Processing Chap 4. Sampling of Continuous-Time Signals Chang-Su Kim Digital Processing of Continuous-Time Signals Digital processing of a CT signal involves three basic steps 1. Conversion

More information

3.2 Complex Sinusoids and Frequency Response of LTI Systems

3.2 Complex Sinusoids and Frequency Response of LTI Systems 3. Introduction. A signal can be represented as a weighted superposition of complex sinusoids. x(t) or x[n]. LTI system: LTI System Output = A weighted superposition of the system response to each complex

More information

Math 217: Eigenspaces and Characteristic Polynomials Professor Karen Smith

Math 217: Eigenspaces and Characteristic Polynomials Professor Karen Smith Math 217: Eigenspaces and Characteristic Polynomials Professor Karen Smith (c)2015 UM Math Dept licensed under a Creative Commons By-NC-SA 4.0 International License. Definition: Let V T V be a linear transformation.

More information

Homogeneous and particular LTI solutions

Homogeneous and particular LTI solutions Homogeneous and particular LTI solutions Daniele Carnevale Dipartimento di Ing. Civile ed Ing. Informatica (DICII), University of Rome Tor Vergata Fondamenti di Automatica e Controlli Automatici A.A. 2014-2015

More information

Math 24 Spring 2012 Sample Homework Solutions Week 8

Math 24 Spring 2012 Sample Homework Solutions Week 8 Math 4 Spring Sample Homework Solutions Week 8 Section 5. (.) Test A M (R) for diagonalizability, and if possible find an invertible matrix Q and a diagonal matrix D such that Q AQ = D. ( ) 4 (c) A =.

More information

Dynamic circuits: Frequency domain analysis

Dynamic circuits: Frequency domain analysis Electronic Circuits 1 Dynamic circuits: Contents Free oscillation and natural frequency Transfer functions Frequency response Bode plots 1 System behaviour: overview 2 System behaviour : review solution

More information

Lecture 15, 16: Diagonalization

Lecture 15, 16: Diagonalization Lecture 15, 16: Diagonalization Motivation: Eigenvalues and Eigenvectors are easy to compute for diagonal matrices. Hence, we would like (if possible) to convert matrix A into a diagonal matrix. Suppose

More information

EE 637 Final April 30, Spring Each problem is worth 20 points for a total score of 100 points

EE 637 Final April 30, Spring Each problem is worth 20 points for a total score of 100 points EE 637 Final April 30, Spring 2018 Name: Instructions: This is a 120 minute exam containing five problems. Each problem is worth 20 points for a total score of 100 points You may only use your brain and

More information

j=1 u 1jv 1j. 1/ 2 Lemma 1. An orthogonal set of vectors must be linearly independent.

j=1 u 1jv 1j. 1/ 2 Lemma 1. An orthogonal set of vectors must be linearly independent. Lecture Notes: Orthogonal and Symmetric Matrices Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong taoyf@cse.cuhk.edu.hk Orthogonal Matrix Definition. Let u = [u

More information

COSC460 Honours Report. A Fast Discrete Tchebichef Transform Algorithm for Image Compression

COSC460 Honours Report. A Fast Discrete Tchebichef Transform Algorithm for Image Compression COSC460 Honours Report A Fast Discrete Tchebichef Transform Algorithm for Image Compression November 2006 Kiyoyuki Nakagaki kna23@student.canterbury.ac.nz Supervisor : Dr. Ramakrishnan Mukundan mukundan@canterbury.ac.nz

More information

Homework 3 Solutions Math 309, Fall 2015

Homework 3 Solutions Math 309, Fall 2015 Homework 3 Solutions Math 39, Fall 25 782 One easily checks that the only eigenvalue of the coefficient matrix is λ To find the associated eigenvector, we have 4 2 v v 8 4 (up to scalar multiplication)

More information

22.2. Applications of Eigenvalues and Eigenvectors. Introduction. Prerequisites. Learning Outcomes

22.2. Applications of Eigenvalues and Eigenvectors. Introduction. Prerequisites. Learning Outcomes Applications of Eigenvalues and Eigenvectors 22.2 Introduction Many applications of matrices in both engineering and science utilize eigenvalues and, sometimes, eigenvectors. Control theory, vibration

More information

Homework 7 Solutions

Homework 7 Solutions Homework 7 Solutions # (Section.4: The following functions are defined on an interval of length. Sketch the even and odd etensions of each function over the interval [, ]. (a f( =, f ( Even etension of

More information

1 Separation of Variables

1 Separation of Variables Jim ambers ENERGY 281 Spring Quarter 27-8 ecture 2 Notes 1 Separation of Variables In the previous lecture, we learned how to derive a PDE that describes fluid flow. Now, we will learn a number of analytical

More information

G-MG Solar Eclipse. Task 93, 000, , Alignments to Content Standards: G-MG.A.1

G-MG Solar Eclipse. Task 93, 000, , Alignments to Content Standards: G-MG.A.1 G-MG Solar Eclipse Alignments to Content Standards: G-MG.A.1 Task A solar eclipse occurs when the moon passes between the sun and the earth. The eclipse is called partial if the moon only blocks part of

More information

Diagonalization. P. Danziger. u B = A 1. B u S.

Diagonalization. P. Danziger. u B = A 1. B u S. 7., 8., 8.2 Diagonalization P. Danziger Change of Basis Given a basis of R n, B {v,..., v n }, we have seen that the matrix whose columns consist of these vectors can be thought of as a change of basis

More information

G-GPE Explaining the equation for a circle

G-GPE Explaining the equation for a circle G-GPE Explaining the equation for a circle Alignments to Content Standards: G-GPE.A.1 Task This problem examines equations defining different circles in the - plane. a. Use the Pythagorean theorem to find

More information

Review of 1 st Order Circuit Analysis

Review of 1 st Order Circuit Analysis ECEN 60 Circuits/Electronics Spring 007-7-07 P. Mathys Review of st Order Circuit Analysis First Order Differential Equation Consider the following circuit with input voltage v S (t) and output voltage

More information

Problem Value

Problem Value GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL & COMPUTER ENGINEERING FINAL EXAM DATE: 30-Apr-04 COURSE: ECE-2025 NAME: GT #: LAST, FIRST Recitation Section: Circle the date & time when your Recitation

More information

Systems of Ordinary Differential Equations

Systems of Ordinary Differential Equations Systems of Ordinary Differential Equations MATH 365 Ordinary Differential Equations J Robert Buchanan Department of Mathematics Fall 2018 Objectives Many physical problems involve a number of separate

More information

Compressing a 1D Discrete Signal

Compressing a 1D Discrete Signal Compressing a D Discrete Signal Divide the signal into 8blocks. Subtract the sample mean from each value. Compute the 8 8covariancematrixforthe blocks. Compute the eigenvectors of the covariance matrix.

More information

Designing Information Devices and Systems I Spring 2016 Official Lecture Notes Note 21

Designing Information Devices and Systems I Spring 2016 Official Lecture Notes Note 21 EECS 6A Designing Information Devices and Systems I Spring 26 Official Lecture Notes Note 2 Introduction In this lecture note, we will introduce the last topics of this semester, change of basis and diagonalization.

More information

Lecture 6. 1 Normalization and time evolution 1. 2 The Wavefunction as a Probability Amplitude 3. 3 The Probability Current 5

Lecture 6. 1 Normalization and time evolution 1. 2 The Wavefunction as a Probability Amplitude 3. 3 The Probability Current 5 Lecture 6 B. Zwiebach February 23, 2016 Contents 1 Normalization and time evolution 1 2 The Wavefunction as a Probability Amplitude 3 3 The Probability Current 5 4 Probability current in 3D and current

More information

Review of Discrete-Time System

Review of Discrete-Time System Review of Discrete-Time System Electrical & Computer Engineering University of Maryland, College Park Acknowledgment: ENEE630 slides were based on class notes developed by Profs. K.J. Ray Liu and Min Wu.

More information

Multimedia Networking ECE 599

Multimedia Networking ECE 599 Multimedia Networking ECE 599 Prof. Thinh Nguyen School of Electrical Engineering and Computer Science Based on lectures from B. Lee, B. Girod, and A. Mukherjee 1 Outline Digital Signal Representation

More information

Recitation 9: Probability Matrices and Real Symmetric Matrices. 3 Probability Matrices: Definitions and Examples

Recitation 9: Probability Matrices and Real Symmetric Matrices. 3 Probability Matrices: Definitions and Examples Math b TA: Padraic Bartlett Recitation 9: Probability Matrices and Real Symmetric Matrices Week 9 Caltech 20 Random Question Show that + + + + +... = ϕ, the golden ratio, which is = + 5. 2 2 Homework comments

More information

which arises when we compute the orthogonal projection of a vector y in a subspace with an orthogonal basis. Hence assume that P y = A ij = x j, x i

which arises when we compute the orthogonal projection of a vector y in a subspace with an orthogonal basis. Hence assume that P y = A ij = x j, x i MODULE 6 Topics: Gram-Schmidt orthogonalization process We begin by observing that if the vectors {x j } N are mutually orthogonal in an inner product space V then they are necessarily linearly independent.

More information

3. Mathematical Properties of MDOF Systems

3. Mathematical Properties of MDOF Systems 3. Mathematical Properties of MDOF Systems 3.1 The Generalized Eigenvalue Problem Recall that the natural frequencies ω and modes a are found from [ - ω 2 M + K ] a = 0 or K a = ω 2 M a Where M and K are

More information

DSP-I DSP-I DSP-I DSP-I

DSP-I DSP-I DSP-I DSP-I NOTES FOR 8-79 LECTURES 3 and 4 Introduction to Discrete-Time Fourier Transforms (DTFTs Distributed: September 8, 2005 Notes: This handout contains in brief outline form the lecture notes used for 8-79

More information

E : Lecture 1 Introduction

E : Lecture 1 Introduction E85.2607: Lecture 1 Introduction 1 Administrivia 2 DSP review 3 Fun with Matlab E85.2607: Lecture 1 Introduction 2010-01-21 1 / 24 Course overview Advanced Digital Signal Theory Design, analysis, and implementation

More information

LINEAR ALGEBRA SUMMARY SHEET.

LINEAR ALGEBRA SUMMARY SHEET. LINEAR ALGEBRA SUMMARY SHEET RADON ROSBOROUGH https://intuitiveexplanationscom/linear-algebra-summary-sheet/ This document is a concise collection of many of the important theorems of linear algebra, organized

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science : Dynamic Systems Spring 2011

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science : Dynamic Systems Spring 2011 MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science 6.24: Dynamic Systems Spring 20 Homework 9 Solutions Exercise 2. We can use additive perturbation model with

More information

ECE504: Lecture 8. D. Richard Brown III. Worcester Polytechnic Institute. 28-Oct-2008

ECE504: Lecture 8. D. Richard Brown III. Worcester Polytechnic Institute. 28-Oct-2008 ECE504: Lecture 8 D. Richard Brown III Worcester Polytechnic Institute 28-Oct-2008 Worcester Polytechnic Institute D. Richard Brown III 28-Oct-2008 1 / 30 Lecture 8 Major Topics ECE504: Lecture 8 We are

More information

Lecture 3 January 23

Lecture 3 January 23 EE 123: Digital Signal Processing Spring 2007 Lecture 3 January 23 Lecturer: Prof. Anant Sahai Scribe: Dominic Antonelli 3.1 Outline These notes cover the following topics: Eigenvectors and Eigenvalues

More information

ECE-314 Fall 2012 Review Questions for Midterm Examination II

ECE-314 Fall 2012 Review Questions for Midterm Examination II ECE-314 Fall 2012 Review Questions for Midterm Examination II First, make sure you study all the problems and their solutions from homework sets 4-7. Then work on the following additional problems. Problem

More information

Extreme Values and Positive/ Negative Definite Matrix Conditions

Extreme Values and Positive/ Negative Definite Matrix Conditions Extreme Values and Positive/ Negative Definite Matrix Conditions James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University November 8, 016 Outline 1

More information

vibrations, light transmission, tuning guitar, design buildings and bridges, washing machine, Partial differential problems, water flow,...

vibrations, light transmission, tuning guitar, design buildings and bridges, washing machine, Partial differential problems, water flow,... 6 Eigenvalues Eigenvalues are a common part of our life: vibrations, light transmission, tuning guitar, design buildings and bridges, washing machine, Partial differential problems, water flow, The simplest

More information

Sec. 7.4: Basic Theory of Systems of First Order Linear Equations

Sec. 7.4: Basic Theory of Systems of First Order Linear Equations Sec. 7.4: Basic Theory of Systems of First Order Linear Equations MATH 351 California State University, Northridge April 2, 214 MATH 351 (Differential Equations) Sec. 7.4 April 2, 214 1 / 12 System of

More information

π 1 = tr(a), π n = ( 1) n det(a). In particular, when n = 2 one has

π 1 = tr(a), π n = ( 1) n det(a). In particular, when n = 2 one has Eigen Methods Math 246, Spring 2009, Professor David Levermore Eigenpairs Let A be a real n n matrix A number λ possibly complex is an eigenvalue of A if there exists a nonzero vector v possibly complex

More information

Mathematical Preliminaries and Review

Mathematical Preliminaries and Review Mathematical Preliminaries and Review Ruye Wang for E59 1 Complex Variables and Sinusoids AcomplexnumbercanberepresentedineitherCartesianorpolarcoordinatesystem: z = x + jy= z z = re jθ = r(cos θ + j sin

More information

MAT 22B - Lecture Notes

MAT 22B - Lecture Notes MAT 22B - Lecture Notes 2 September 2015 Systems of ODEs This is some really cool stu. Systems of ODEs are a natural and powerful way to model how multiple dierent interrelated quantities change through

More information

Chapter 7. Canonical Forms. 7.1 Eigenvalues and Eigenvectors

Chapter 7. Canonical Forms. 7.1 Eigenvalues and Eigenvectors Chapter 7 Canonical Forms 7.1 Eigenvalues and Eigenvectors Definition 7.1.1. Let V be a vector space over the field F and let T be a linear operator on V. An eigenvalue of T is a scalar λ F such that there

More information