CMLab 1 Some basic Applications of Digital filters : Least-square fitting of polynomials Given M data points (t m, u m ), m=1,2,…,M wish to fit (approximate)

Slides:



Advertisements
Similar presentations
Approximating the area under a curve using Riemann Sums
Advertisements

Chapter 2: Frequency Distributions
Numerical Integration
Interpolation A standard idea in interpolation now is to find a polynomial pn(x) of degree n (or less) that assumes the given values; thus (1) We call.
ES 240: Scientific and Engineering Computation. Chapter 17: Numerical IntegrationIntegration  Definition –Total area within a region –In mathematical.
Splash Screen.
Rational Root Theorem.
Polynomials and Polynomial Functions
DFT/FFT and Wavelets ● Additive Synthesis demonstration (wave addition) ● Standard Definitions ● Computing the DFT and FFT ● Sine and cosine wave multiplication.
Section 5.7 Numerical Integration. Approximations for integrals: Riemann Sums, Trapezoidal Rule, Simpson's Rule Riemann Sum: Trapezoidal Rule: Simpson’s.
x – independent variable (input)
Lecture 3: Integration. Integration of discrete functions
Curve-Fitting Regression
MANE 4240 & CIVL 4240 Introduction to Finite Elements Numerical Integration in 1D Prof. Suvranu De.
Zeros of Polynomial Functions
Chapter 6 Numerical Interpolation
Dividing Polynomials.
Quadrature Greg Beckham. Quadrature Numerical Integration Goal is to obtain the integral with as few computations of the integrand as possible.
Polynomial and Rational Functions
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Numerical Differentiation and Integration Part 6 Calculus.
Unit 3: Lesson 1: 3.1 Polynomial Basics (4-1)
CpE- 310B Engineering Computation and Simulation Dr. Manal Al-Bzoor
19.5 Numeric Integration and Differentiation
Integration. Problem: An experiment has measured the number of particles entering a counter per unit time dN(t)/dt, as a function of time. The problem.
Integrals 5.
3. Numerical integration (Numerical quadrature) .
1 Chapter 7 NUMERICAL INTEGRATION. 2 PRELIMINARIES We use numerical integration when the function f(x) may not be integrable in closed form or even in.
1 Numerical Analysis Lecture 12 Numerical Integration Dr. Nader Okasha.
CMPS1371 Introduction to Computing for Engineers NUMERICAL METHODS.
D MANCHE Finding the area under curves:  There are many mathematical applications which require finding the area under a curve.  The area “under”
Chapters 5 and 6: Numerical Integration
1 Trapezoidal Rule of Integration. What is Integration Integration: The process of measuring the area under a function.
Dr. Richard Young Optronic Laboratories, Inc..  Uncertainty budgets are a growing requirement of measurements.  Multiple measurements are generally.
MAT 150 – Class #20 Topics: Identify Graphs of Higher-Degree Polynomials Functions Graph Cubic and Quartic Functions Find Local Extrema and Absolute Extrema.
“Limits and Continuity”:.  Calculus,10/E by Howard Anton, Irl Bivens, and Stephen Davis Copyright © 2009 by John Wiley & Sons, Inc. All rights reserved.
What are quadratic equations, and how can we solve them? Do Now: (To turn in) What do you know about quadratic equations? Have you worked with them before?
Simpson Rule For Integration.
The importance of sequences and infinite series in calculus stems from Newton’s idea of representing functions as sums of infinite series.  For instance,
COURSE: JUST 3900 INTRODUCTORY STATISTICS FOR CRIMINAL JUSTICE Instructor: Dr. John J. Kerbs, Associate Professor Joint Ph.D. in Social Work and Sociology.
Copyright © 2014, 2010 Pearson Education, Inc. Chapter 2 Polynomials and Rational Functions Copyright © 2014, 2010 Pearson Education, Inc.
Homework questions thus far??? Section 4.10? 5.1? 5.2?
Today’s class Spline Interpolation Quadratic Spline Cubic Spline Fourier Approximation Numerical Methods Lecture 21 Prof. Jinbo Bi CSE, UConn 1.
Key Concept 1. Example 1 Leading Coefficient Equal to 1 A. List all possible rational zeros of f (x) = x 3 – 3x 2 – 2x + 4. Then determine which, if any,
Riemann Sums, Trapezoidal Rule, and Simpson’s Rule Haley Scruggs 1 st Period 3/7/11.
The first column shows a sequence of numbers. Second column shows the first difference. (-6) – (-4) = -2 If the pattern continues, what is the 8 th number.
CHAPTER 7 Polynomial and Rational Functions. Ch 7.1 Polynomial Functions ( Pg 565) Linear functions f(x) = ax + b Quadratic functions f(x) = ax 2 + bx+
Trapezoidal Rule of Integration
6.1 Inference for a Single Proportion  Statistical confidence  Confidence intervals  How confidence intervals behave.
CHAPTER 3 NUMERICAL METHODS
Numerical Integration
Interval Notation Interval Notation to/from Inequalities Number Line Plots open & closed endpoint conventions Unions and Intersections Bounded vs. unbounded.
Channel capacity A very important consideration in data communications is how fast we can send data, in bits per second, over a channel.
Apply polynomial models to real- world situations by fitting data to linear, quadratic, cubic, or quartic models.
Chapter 5. Polynomial Operations.
Chapter 2: Frequency Distributions. Frequency Distributions After collecting data, the first task for a researcher is to organize and simplify the data.
3 Polynomial and Rational Functions © 2008 Pearson Addison-Wesley. All rights reserved Sections 3.1–3.4.
Lecture 3: The Sampling Process and Aliasing 1. Introduction A digital or sampled-data control system operates on discrete- time rather than continuous-time.
Air Force Admin College, Coimbatore
Frequency response I As the frequency of the processed signals increases, the effects of parasitic capacitance in (BJT/MOS) transistors start to manifest.
Chapter 7 Numerical Differentiation and Integration
Least Squares Fitting A mathematical procedure for finding the best-fitting curve to a given set of points by minimizing the sum of the squares of the.
Summation Formulas Constant Series.
Rational Root Theorem.
9.5 Least-Squares Digital Filters
SKTN 2393 Numerical Methods for Nuclear Engineers
4.3: Polynomial Functions
Numerical Computation and Optimization
Frequency response I As the frequency of the processed signals increases, the effects of parasitic capacitance in (BJT/MOS) transistors start to manifest.
Air Force Admin College, Coimbatore
Presentation transcript:

CMLab 1 Some basic Applications of Digital filters : Least-square fitting of polynomials Given M data points (t m, u m ), m=1,2,…,M wish to fit (approximate) these data, in some sense, by a polynomial u=u(t) of degree N where M ≧ N+1 Principle of least square : the sum of the squares of the residuals is the least

CMLab 2 Ex: consider a set of 5 equally spaced data points. t m =m for m=-2, -1, 0, 1, 2 u m unspecified fit the above data by a straight line u=A+Bt in least-square sense.

CMLab 3 From the frequency point of view : S’pose the input function is one of the eigenfunctions in the complex form e iwt of frequency w. Since the system is linear, the same function will emerge at the output except that it is multiplied by its eigenvalue H(w).

CMLab 4 In general : : transfer function

CMLab 5 the more terms used, the more rapid are the wiggles of H(w), and the more the envelope of the wiggles is squeezed toward the frequency axis.

CMLab 6 Least-squares Quadratics and Quartics Instead of a straight line, fit by a quardratic (or a cubic) u(t)=A+Bt+Ct 2

CMLab 7 The effect of the higher-degree polynomial is a higher degree of tangency at w=0 The use of more terms in the smoothing formula makes the curve come down sooner.

CMLab 8 Modified least squares : Smoothing Window for 2N+1 points modified Smoothing Windows for 2N+1 points : reduce the two end values to one-half their assigned values

CMLab 9 The curve will come down more rapidly The main lobe is slightly wider. ★ the end constants can be chosen as a parameter

CMLab 10 Differences and Derivatives The difference operator the operator annihilates a polynomial P n (x) of degree n in X; that is

CMLab 11 from frequency point of view :

CMLab 12 Since, so the amplification at frequency w is contained in the factor ; △ decreases the amplitude of any frequency ; there is an amplification

CMLab 13 high-pass behavior of the difference operator Δ k

CMLab 14 Differences are also used to approximate derivatives. Central difference formula from the formula (with h=1)

CMLab 15 The ratio of the calculated to the true answer (which is iw) is : w=0, R=1 w  0, |R|<1  the formula underestimates the value of the derivatives for all other freqs. For the 2 nd derivate :

CMLab 16 Spencer’s smoothing formula: 15-point: 21-point: not informative

CMLab 17 plot the logs of the numbers |H(w)| 20 log|ratio| = decibel units (dB) 20 dB = factor of 10

CMLab 18 Missing Data and Interpolation : The reasons or situations for the occurrence of “missing data” in a long record of data : the measurements may never have been made; they may have been misrecorded and thus later removed the formula used to compute successive values of the function may have involved an indeterminate form, such as at x=0, and the computer refused to divide by zero.

CMLab 19 Usually, an interpolation formula based on the assumption that the data locally is a polynomial of some odd degree. This is equivalent to the assumption that the next higher-order difference is zero.

CMLab 20 For instance, k=4 note: the sum of the sequences of the binomial coeffs. of order N is. Hence for the 2k th difference formula, the noise amplification is

CMLab 21 If set then

CMLab 22 H(0)=1 However, for high freqs, the value is not too good, particularly for very high freqs. Negative values on the graph of the transfer function imply a change in sign. The above figure points out the damager of interpolating a missing value when the data is noisy, which means that the data has numerous high frequencies.

CMLab 23 Interpolation midpoint values : linear interpolation gives if 4 adjacent points are used

CMLab 24 A Class of Nonre cursive Smoothing Filters Design of filters : H(0)=1 exact at dc(lowest freq.) H(  )=0 no highest freq. get through L.P.

CMLab 25 Since H(  )=0 the factor [cos w+1] had to occur Now one can select a filter that approximately meets the requirement.

CMLab 26 for Ex.1, if we require Ex.2 if we set

CMLab 27 Ex. 3. S’pose that we try to do as well as possible in the neighborhood of zero freq.

CMLab 28 Ex: we pick our filter form as

CMLab 29 Integration : Recursive Filters Trapezoid Rule (using y 0 =0)

CMLab 30 The true answer for integration of is

CMLab 31 Simpson’s Rule : w=0, R=1 and has a tangency through the 3 rd derivative

CMLab 32 Midpoint integration formula (using y 0 =0)

CMLab 33 Leo Tick Formula

CMLab 34 Simpson’s formula amplifies the upper part of Nyquist interval (the higher frequencies) where as the trapezoid rule damps them out. In the presence of noise. Simpson’s formula is more dangerous to use than are the trapezoid or midpoint formulas. But when there is relatively little high freq. In the function being integrated, then the flatness of Simpson’s formula for low freqs. show why it is superior.