LECTURE 16 GAUSS QUADRATURE In general for Newton-Cotes (equispaced interpolation points/ data points/ integration points/ nodes).
|
|
- Darlene Cross
- 6 years ago
- Views:
Transcription
1 CE Lecture 6 LECTURE 6 GAUSS QUADRATURE In general for ewton-cotes (equispaced interpolation points/ data points/ integration points/ nodes). x E x S fx dx hw' o f o + w' f + + w' f + E 84 f 0 f f f 2 closed formula x s x 0 x x 2 x E x h ote that for ewton-cotes formulae only the weighting coefficients w i were unknown and the were fixed x i p. 6.
2 CE Lecture 6 However the number of and placement of the integration points influences the accuracy of the ewton-cotes formulae: even th degree interpolation function exactly integrates an + th degree polynomial This is due to the placement of one of the data points. odd th degree interpolation function exactly integrates an th degree polynomial. Concept: Let s allow the placement of the integration points to vary such that we further increase the degree of the polynomial we can integrate exactly for a given number of integration points. In fact we can integrate an 2 + degree polynomial exactly with only + integration points p. 6.2
3 CE Lecture 6 Assume that for Gauss Quadrature the form of the integration rule is x E fx dx w o f o + w f + + w f + E x S 85 f 0 f f f f2 x s x 0 x x 2 x x x E In deriving (not applying) these integration formulae Location of the integration points, x i i O are unknown Integration formulae weights, w i i O are unknown 2 + unknowns we will be able to exactly integrate any 2 + degree polynomial! p. 6.
4 CE Lecture 6 Derivation of Gauss Quadrature by Integrating Exact Polynomials and Matching Derive point Gauss-Quadrature 2 unknowns, which will exactly integrate any linear function w o x o Let the general polynomial be fx Ax + B where the coefficients A Bcan equal any value Also consider the integration interval to be + such that x S and x E + (no loss in generality since we can always transform coordinates). + fx dx w o fx o Substituting in the form of fx + Ax + B d x w o Ax o + B p. 6.4
5 CE Lecture 6 A x Bx 2 + w o Ax o + B In order for this to be true for any st degree polynomial (i.e. any A and B). Therefore x o 0, w o 2 for point Gauss Quadrature. 86 A0 + B2 Ax o w o + Bw o 0 x o w o 2 w o f 0 f(x) - x 0 + We can integrate exactly with only point for a linear function while for ewton-cotes we needed two points! p. 6.5
6 CE Lecture 6 Derive a 2 point Gauss Quadrature Formula 87 - x 0 x + The general form of the integration formula is w o, x o, w, x are all unknowns I w o f o + w f 4 unknowns we can fit a rd degree polynomial exactly fx Ax + Bx 2 + Cx + D Substituting in for fx into the general form of the integration rule + fx dx w o fx o + w fx p. 6.6
7 CE Lecture 6 + Ax + Bx 2 + Cx + D d x w o Ax o + Bx 2 o + Cx o + D + w Ax + Bx 2 + Cx + D Ax Bx Cx Dx 2 + w o Axo + Bx 2 o + Cx o + D + w Ax + Bx 2 + Cx + D Aw o xo + w x B w o x 2 o w x Cw o x o + w x + Dw o + w 2 0 In order for this to be true for any third degree polynomial (i.e. all arbitrary coefficients, A, B, C, D), we must have: w o xo + w x 0 w o xo 2 w x w o x o + w x 0 w o + w 2 0 p. 6.7
8 CE Lecture 6 4 nonlinear equations 4 unknowns w o and w x o -- and x + -- All polynomials of degree or less will be exactly integrated with a Gauss-Legendre 2 point formula. p. 6.8
9 CE Lecture 6 Gauss Legendre Formulae I + fxdx i 0 w i f i + E + x i, , --, , 0, i 0 w i , , Exact for polynomials of degree p. 6.9
10 CE Lecture 6 + x i, i 0 w i Exact for polynomials of degree 7 9 p. 6.0
11 CE Lecture 6 otes + the number of integration points Integration points are symmetrical on + Formulae can be applied on any interval using a coordinatetransformation + integration points will integrate polynomials of up to degree 2 + exactly. Recall that ewton Cotes + integration points only integrates an th / + th degree polynomial exactly depending on being odd or even. For Gauss-Legendre integration, we allowed both weights and integration point locations to vary to match an integral exactly more d.o.f. allows you to match a higher degree polynomial! An alternative way of looking at Gauss-Legendre integration formulae is that we use Hermite interpolation instead of Lagrange interpolation! (How can this be since Hermite interpolation involves derivatives let s examine this!) p. 6.
12 CE Lecture 6 Derivation of Gauss Quadrature by Integrating Hermite Interpolating Functions Hermite interpolation formulae Hermite interpolation which matches the function and the first derivative at + interpolation points is expressed as: gx i 0 i xf i + i 0 i xf i 88 () () () () () () () f 0 f 0 f f f 2 f 2 f f f 4 f 4 f5 f 5 f f x 0 x x 2 x x 4 x 5 x It can be shown that in general for non-equispaced points i x t i xl i xl i x i 0 i x s i xl i xl i x i 0 p. 6.2
13 CE Lecture 6 where p x x x o x x x x l i x p x i 0 x p x i x i xi t i x x x i 2 l i s i x x x i p. 6.
14 CE Lecture 6 Example of defining a cubic Hermite interpolating function Derive Hermite interpolating functions for 2 interpolation points located at and + for the interval () f 0 f 0 () f f x 0 x + x + 2 points Establish p x p x x x o x x p x x x o + x x p. 6.4
15 CE Lecture 6 Establish l i x l i x l i x p x x p xi x i x x o x x x x i x i x o + x i x Let i 0 l o x x x o x x x x o 0 + x o x l o x x x x o x Substitute in x o and x + l o x -- x 2 p. 6.5
16 CE Lecture 6 Let i l x x x o x x x x x x o + 0 Substitute in values for x o, x l x -- + x 2 Taking derivatives l o x 2 -- l x p. 6.6
17 CE Lecture 6 Establish t i x t o x x x o 2l o x o t o x x t o x 2 + x t x x x 2 l x t x x t x 2 x Establish s i x s o x x + s x x p. 6.7
18 CE Lecture 6 Establish i x o x t o xl o xl o x o x 2 + x 2 -- x 2 -- x o x -- 2 x + x 4 x t xl xl x x 2 x x x x x x 4 p. 6.8
19 CE Lecture 6 Establish i x o x s o xl o xl o x o x x x 2 -- x o x -- x x x x s xl xl x x x x x x -- x + x x In general gx o x f o + x f + o x f + x f o p. 6.9
20 CE Lecture 6 90 i (x) () i (x) 0 (x) (x) () (x) i (x) x () i (x) () 0 (x) x 0 (x) () 0 () (x) x x These functions satisfy the constraints i x j ij i x j 0 i x i j 0 x j ij p. 6.20
21 CE Lecture 6 Gauss-Legendre Quadrature by integrating Hermite interpolating polynomials I otes + fx dx w i f i + E i 0 Use + without loss of generality we can always transform the interval. Approximation for I is exact for 2 + degree polynomials We can derive all Gauss-Legendre quadrature formulae by approximating fx with an 2 + th degree Hermite interpolating function using specially selected integration/ interpolation points. where I + gxdx + E gx i 0 i xf i + i 0 i xf i p. 6.2
22 CE Lecture 6 Thus I + i xf i + i xf i dx + E i 0 i 0 I A i f i + B i f i + E i 0 i 0 where A i + + i xdx and B x dx i i Furthermore we can show that E + 2 p + x ! f x o + H.O.T. dx p. 6.22
23 CE Lecture 6 ote that we are assuming Taylor series expansions about x o and using higher order terms in the expansion. Therefore E 0 for any polynomial of degree 2 + or less! The problem that we encounter is that the integration formula as it now stands in general requires us to know both functional and first derivative values at the nodes! Let us select x o x x 2 x such that B i 0 i 0 + i x dx 0 i 0 + s i x l xl xdx 0 i 0 i i + p x x x i l i x dx 0 i 0 x p xi x i p. 6.2
24 CE Lecture xi p xl i x dx 0 i 0 p + p x polynomial of degree + l i x polynomial of degree Therefore we require p x to be orthogonal on + to all polynomials of degree or less any multiple of Legendre-Polynomials will satisfy this. Let p x P + +! 2 2 +! + x where p x x x o x x x x 2 x x P + the Legendre polynomial of degree ! 2 is required to normalize the leading coefficient of 2 +! P + x p. 6.24
25 CE Lecture 6 What have we done by defining p x in this way we have selected the integration/ interpolation/data points x o x x to be the roots of P + x. In general P n x dn x 2 2 n n! dx n n P o x P x x P 2 x --x 2 2 P x --5x 2... x p. 6.25
26 CE Lecture 6 So far we have established Selecting p x to be proportional to the Legendre Polynomial of degree + this satisfies the orthogonality condition which will lead to: f i + i x dx 0 As a result terms will not appear in the Gauss-Legendre integration formula. If we select p x to be the Legendre Polynomial of degree + the roots of that polynomial will represent the interpolating/integration/data points since p x x x o x x x x has been set equal to CP + x ow we must find the weights of the integration formula. ote that A i will represent the weights! A i + i xdx p. 6.26
27 CE Lecture 6 where A i + t i x l i x l i xdx xi t i x x x i 2 l i l i x p x x p xi x i p x x x o x x and where x o x are the roots of the Legendre polynomial of degree + or p x P + +! 2 2 +! + x p. 6.27
28 CE Lecture 6 Two point Gauss-Legendre integration Develop a 2 point Gauss-Legendre integration formula for +. Let gx gx j 0 i xf i o xf o + j 0 i xf i + xf + o xf o + xf Thus I + gxdx + E I + o xf o dx + + xf dx + o xf o dx xf dx + I f o o x d x f x d x f o o x dx f xdx p. 6.28
29 CE Lecture 6 Step - Establish interpolating points Interpolation points will be the roots of the Legendre Polynomial of order 2. P 2 x --x x x 2 x 2 -- x 0 -- x p. 6.29
30 CE Lecture 6 Checking these roots P 2 x d2 x ! dx 2 P 2 x d2 8dx 2 x 4 2x 2 + P 2 x --2x P 2 x --x 2 2 p x ! 2 22! P x 2 p x x p x x 2 -- p. 6.0
31 CE Lecture 6 From formula which defines p x using the integration points p x x + -- x -- x2 -- Step 2 - Establish the coefficients of the derivative terms in the integration formula Let s demonstrate that with the roots x o we will satisfy + + o x dx 0 and x d x 0 First develop o x and x by developing s o x and s x p x, p x, lo x, l x, p x x x o x x p x x xo + x x p. 6.
32 CE Lecture 6 l j x p x x p j 0 x j x j l j x x x o x x x x j x j x o + x j x l o x x x o x x x x o x o x o + x o x l o x x x x o x l x x x o x x x x x x o + x x l x x x o x x o p. 6.2
33 CE Lecture 6 s o x x x o s x x x ow we can establish o x o x s o x l o x l o x x x o x x x o x x x o x x o x oting that x o --, x -- o x x + x x o x -- x 4 --x 2 --x / p. 6.
34 CE Lecture 6 Similarly for x x s x l x l x x x o x x o x x x x x o x x o Substituting x o --, x -- x x -- x + -- x x -- x 4 --x x -- 2 / p. 6.4
35 CE Lecture 6 ow we can develop + o xdx + o xdx + -- x 4 --x 2 --x / dx + o xdx x4 / x --x 6 2 / x o xdx / / / / + o x dx 0 p. 6.5
36 CE Lecture 6 Develop + xdx + xdx + -- x 4 --x x -- 2 / dx + xdx / x --x x4 / x + + xdx / / / / + x dx 0 p. 6.6
37 CE Lecture 6 ow our integration formula reduces to: + + I f o o xdx + f xdx I A o f o + A f where A o + o xdx and A xdx + Step - Develop A o, A Establish o x o x t o x l o x l o x xo o x x x o 2l o l o xl o x p. 6.7
38 CE Lecture 6 2 o x x x o x x x o x x x x o x x o x o x x x -- x o x 4 -- x x x + -- o x x 4 x x + -- o x -- x 4 x / p. 6.8
39 CE Lecture 6 Develop + o xdx + o xdx x x / 2 dx + o xdx -- x x / x + + o xdx / / + o xdx o x dx A o p. 6.9
40 CE Lecture 6 Similarly we can show that A + x dx Thus we have established the two point Gauss Quadrature rule I + f x dx w o f o + w f where x o -- and x are the integration points and + -- w o w We note that this integration rule was established by defining a Hermite cubic interpolating function and defining the integration points x o, x such that + o x dx 0 and x d x 0 + Therefore the functional derivative values drop out of the Gauss Legendre integration formula! p. 6.40
Simpson s 1/3 Rule Simpson s 1/3 rule assumes 3 equispaced data/interpolation/integration points
CE 05 - Lecture 5 LECTURE 5 UMERICAL ITEGRATIO COTIUED Simpson s / Rule Simpson s / rule assumes equispaced data/interpolation/integration points Te integration rule is based on approximating fx using
More informationCOURSE Numerical integration of functions (continuation) 3.3. The Romberg s iterative generation method
COURSE 7 3. Numerical integration of functions (continuation) 3.3. The Romberg s iterative generation method The presence of derivatives in the remainder difficulties in applicability to practical problems
More informationMA2501 Numerical Methods Spring 2015
Norwegian University of Science and Technology Department of Mathematics MA5 Numerical Methods Spring 5 Solutions to exercise set 9 Find approximate values of the following integrals using the adaptive
More informationCOURSE Numerical integration of functions
COURSE 6 3. Numerical integration of functions The need: for evaluating definite integrals of functions that has no explicit antiderivatives or whose antiderivatives are not easy to obtain. Let f : [a,
More informationComputational Physics
Interpolation, Extrapolation & Polynomial Approximation Lectures based on course notes by Pablo Laguna and Kostas Kokkotas revamped by Deirdre Shoemaker Spring 2014 Introduction In many cases, a function
More informationPower Series Solutions to the Legendre Equation
Department of Mathematics IIT Guwahati The Legendre equation The equation (1 x 2 )y 2xy + α(α + 1)y = 0, (1) where α is any real constant, is called Legendre s equation. When α Z +, the equation has polynomial
More informationLECTURE 14 NUMERICAL INTEGRATION. Find
LECTURE 14 NUMERCAL NTEGRATON Find b a fxdx or b a vx ux fx ydy dx Often integration is required. However te form of fx may be suc tat analytical integration would be very difficult or impossible. Use
More informationNumerical Analysis Preliminary Exam 10.00am 1.00pm, January 19, 2018
Numerical Analysis Preliminary Exam 0.00am.00pm, January 9, 208 Instructions. You have three hours to complete this exam. Submit solutions to four (and no more) of the following six problems. Please start
More informationƒ f(x)dx ~ X) ^i,nf(%i,n) -1 *=1 are the zeros of P«(#) and where the num
ZEROS OF THE HERMITE POLYNOMIALS AND WEIGHTS FOR GAUSS' MECHANICAL QUADRATURE FORMULA ROBERT E. GREENWOOD AND J. J. MILLER In the numerical integration of a function ƒ (x) it is very desirable to choose
More informationSection 6.6 Gaussian Quadrature
Section 6.6 Gaussian Quadrature Key Terms: Method of undetermined coefficients Nonlinear systems Gaussian quadrature Error Legendre polynomials Inner product Adapted from http://pathfinder.scar.utoronto.ca/~dyer/csca57/book_p/node44.html
More informationPreliminary Examination in Numerical Analysis
Department of Applied Mathematics Preliminary Examination in Numerical Analysis August 7, 06, 0 am pm. Submit solutions to four (and no more) of the following six problems. Show all your work, and justify
More informationIn numerical analysis quadrature refers to the computation of definite integrals.
Numerical Quadrature In numerical analysis quadrature refers to the computation of definite integrals. f(x) a x i x i+1 x i+2 b x A traditional way to perform numerical integration is to take a piece of
More informationExamination paper for TMA4215 Numerical Mathematics
Department of Mathematical Sciences Examination paper for TMA425 Numerical Mathematics Academic contact during examination: Trond Kvamsdal Phone: 93058702 Examination date: 6th of December 207 Examination
More informationNumerical integration - I. M. Peressi - UniTS - Laurea Magistrale in Physics Laboratory of Computational Physics - Unit V
Numerical integration - I M. Peressi - UniTS - Laurea Magistrale in Physics Laboratory of Computational Physics - Unit V deterministic methods in 1D equispaced points (trapezoidal, Simpson...), others...
More informationData Analysis-I. Interpolation. Soon-Hyung Yook. December 4, Soon-Hyung Yook Data Analysis-I December 4, / 1
Data Analysis-I Interpolation Soon-Hyung Yook December 4, 2015 Soon-Hyung Yook Data Analysis-I December 4, 2015 1 / 1 Table of Contents Soon-Hyung Yook Data Analysis-I December 4, 2015 2 / 1 Introduction
More informationScientific Computing: Numerical Integration
Scientific Computing: Numerical Integration Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 Course MATH-GA.2043 or CSCI-GA.2112, Fall 2015 Nov 5th, 2015 A. Donev (Courant Institute) Lecture
More informationLecture Note 3: Polynomial Interpolation. Xiaoqun Zhang Shanghai Jiao Tong University
Lecture Note 3: Polynomial Interpolation Xiaoqun Zhang Shanghai Jiao Tong University Last updated: October 24, 2013 1.1 Introduction We first look at some examples. Lookup table for f(x) = 2 π x 0 e x2
More informationLecture 10 Polynomial interpolation
Lecture 10 Polynomial interpolation Weinan E 1,2 and Tiejun Li 2 1 Department of Mathematics, Princeton University, weinan@princeton.edu 2 School of Mathematical Sciences, Peking University, tieli@pku.edu.cn
More informationExam 2. Average: 85.6 Median: 87.0 Maximum: Minimum: 55.0 Standard Deviation: Numerical Methods Fall 2011 Lecture 20
Exam 2 Average: 85.6 Median: 87.0 Maximum: 100.0 Minimum: 55.0 Standard Deviation: 10.42 Fall 2011 1 Today s class Multiple Variable Linear Regression Polynomial Interpolation Lagrange Interpolation Newton
More informationJim Lambers MAT 460/560 Fall Semester Practice Final Exam
Jim Lambers MAT 460/560 Fall Semester 2009-10 Practice Final Exam 1. Let f(x) = sin 2x + cos 2x. (a) Write down the 2nd Taylor polynomial P 2 (x) of f(x) centered around x 0 = 0. (b) Write down the corresponding
More informationMethod of Finite Elements I
Method of Finite Elements I PhD Candidate - Charilaos Mylonas HIL H33.1 and Boundary Conditions, 26 March, 2018 Institute of Structural Engineering Method of Finite Elements I 1 Outline 1 2 Penalty method
More informationPolynomial Functions
Polynomial Functions Equations and Graphs Characteristics The Factor Theorem The Remainder Theorem http://www.purplemath.com/modules/polyends5.htm 1 A cross-section of a honeycomb has a pattern with one
More informationDo not turn over until you are told to do so by the Invigilator.
UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 216 17 INTRODUCTION TO NUMERICAL ANALYSIS MTHE612B Time allowed: 3 Hours Attempt QUESTIONS 1 and 2, and THREE other questions.
More informationA first order divided difference
A first order divided difference For a given function f (x) and two distinct points x 0 and x 1, define f [x 0, x 1 ] = f (x 1) f (x 0 ) x 1 x 0 This is called the first order divided difference of f (x).
More informationAM205: Assignment 3 (due 5 PM, October 20)
AM25: Assignment 3 (due 5 PM, October 2) For this assignment, first complete problems 1, 2, 3, and 4, and then complete either problem 5 (on theory) or problem 6 (on an application). If you submit answers
More informationLecture Note 3: Interpolation and Polynomial Approximation. Xiaoqun Zhang Shanghai Jiao Tong University
Lecture Note 3: Interpolation and Polynomial Approximation Xiaoqun Zhang Shanghai Jiao Tong University Last updated: October 10, 2015 2 Contents 1.1 Introduction................................ 3 1.1.1
More information12.0 Properties of orthogonal polynomials
12.0 Properties of orthogonal polynomials In this section we study orthogonal polynomials to use them for the construction of quadrature formulas investigate projections on polynomial spaces and their
More information8.3 Numerical Quadrature, Continued
8.3 Numerical Quadrature, Continued Ulrich Hoensch Friday, October 31, 008 Newton-Cotes Quadrature General Idea: to approximate the integral I (f ) of a function f : [a, b] R, use equally spaced nodes
More informationNumerical Integration
Numerical Integration Sanzheng Qiao Department of Computing and Software McMaster University February, 2014 Outline 1 Introduction 2 Rectangle Rule 3 Trapezoid Rule 4 Error Estimates 5 Simpson s Rule 6
More informationScientific Computing
2301678 Scientific Computing Chapter 2 Interpolation and Approximation Paisan Nakmahachalasint Paisan.N@chula.ac.th Chapter 2 Interpolation and Approximation p. 1/66 Contents 1. Polynomial interpolation
More informationInterpolation Theory
Numerical Analysis Massoud Malek Interpolation Theory The concept of interpolation is to select a function P (x) from a given class of functions in such a way that the graph of y P (x) passes through the
More informationInput: A set (x i -yy i ) data. Output: Function value at arbitrary point x. What for x = 1.2?
Applied Numerical Analysis Interpolation Lecturer: Emad Fatemizadeh Interpolation Input: A set (x i -yy i ) data. Output: Function value at arbitrary point x. 0 1 4 1-3 3 9 What for x = 1.? Interpolation
More information3.1 Interpolation and the Lagrange Polynomial
MATH 4073 Chapter 3 Interpolation and Polynomial Approximation Fall 2003 1 Consider a sample x x 0 x 1 x n y y 0 y 1 y n. Can we get a function out of discrete data above that gives a reasonable estimate
More informationCh. 03 Numerical Quadrature. Andrea Mignone Physics Department, University of Torino AA
Ch. 03 Numerical Quadrature Andrea Mignone Physics Department, University of Torino AA 2017-2018 Numerical Quadrature In numerical analysis quadrature refers to the computation of definite integrals. y
More informationIntegration. Topic: Trapezoidal Rule. Major: General Engineering. Author: Autar Kaw, Charlie Barker.
Integration Topic: Trapezoidal Rule Major: General Engineering Author: Autar Kaw, Charlie Barker 1 What is Integration Integration: The process of measuring the area under a function plotted on a graph.
More informationPHYS-4007/5007: Computational Physics Course Lecture Notes Appendix G
PHYS-4007/5007: Computational Physics Course Lecture Notes Appendix G Dr. Donald G. Luttermoser East Tennessee State University Version 7.0 Abstract These class notes are designed for use of the instructor
More informationNUMERICAL METHODS. x n+1 = 2x n x 2 n. In particular: which of them gives faster convergence, and why? [Work to four decimal places.
NUMERICAL METHODS 1. Rearranging the equation x 3 =.5 gives the iterative formula x n+1 = g(x n ), where g(x) = (2x 2 ) 1. (a) Starting with x = 1, compute the x n up to n = 6, and describe what is happening.
More informationNumerical Analysis Preliminary Exam 10 am to 1 pm, August 20, 2018
Numerical Analysis Preliminary Exam 1 am to 1 pm, August 2, 218 Instructions. You have three hours to complete this exam. Submit solutions to four (and no more) of the following six problems. Please start
More informationPower Series Solutions to the Legendre Equation
Power Series Solutions to the Legendre Equation Department of Mathematics IIT Guwahati The Legendre equation The equation (1 x 2 )y 2xy + α(α + 1)y = 0, (1) where α is any real constant, is called Legendre
More information256 Summary. D n f(x j ) = f j+n f j n 2n x. j n=1. α m n = 2( 1) n (m!) 2 (m n)!(m + n)!. PPW = 2π k x 2 N + 1. i=0?d i,j. N/2} N + 1-dim.
56 Summary High order FD Finite-order finite differences: Points per Wavelength: Number of passes: D n f(x j ) = f j+n f j n n x df xj = m α m dx n D n f j j n= α m n = ( ) n (m!) (m n)!(m + n)!. PPW =
More informationNovember 20, Interpolation, Extrapolation & Polynomial Approximation
Interpolation, Extrapolation & Polynomial Approximation November 20, 2016 Introduction In many cases we know the values of a function f (x) at a set of points x 1, x 2,..., x N, but we don t have the analytic
More informationTwo hours. To be provided by Examinations Office: Mathematical Formula Tables. THE UNIVERSITY OF MANCHESTER. 29 May :45 11:45
Two hours MATH20602 To be provided by Examinations Office: Mathematical Formula Tables. THE UNIVERSITY OF MANCHESTER NUMERICAL ANALYSIS 1 29 May 2015 9:45 11:45 Answer THREE of the FOUR questions. If more
More informationNumerical Methods I Orthogonal Polynomials
Numerical Methods I Orthogonal Polynomials Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 Course G63.2010.001 / G22.2420-001, Fall 2010 Nov. 4th and 11th, 2010 A. Donev (Courant Institute)
More informationThe Perrin Conjugate and the Laguerre Orthogonal Polynomial
The Perrin Conjugate and the Laguerre Orthogonal Polynomial In a previous chapter I defined the conjugate of a cubic polynomial G(x) = x 3 - Bx Cx - D as G(x)c = x 3 + Bx Cx + D. By multiplying the polynomial
More informationChapter 4: Interpolation and Approximation. October 28, 2005
Chapter 4: Interpolation and Approximation October 28, 2005 Outline 1 2.4 Linear Interpolation 2 4.1 Lagrange Interpolation 3 4.2 Newton Interpolation and Divided Differences 4 4.3 Interpolation Error
More information6x 2 8x + 5 ) = 12x 8
Example. If f(x) = x 3 4x + 5x + 1, then f (x) = 6x 8x + 5 Observation: f (x) is also a differentiable function... d dx ( f (x) ) = d dx ( 6x 8x + 5 ) = 1x 8 The derivative of f (x) is called the second
More information(x x 0 )(x x 1 )... (x x n ) (x x 0 ) + y 0.
> 5. Numerical Integration Review of Interpolation Find p n (x) with p n (x j ) = y j, j = 0, 1,,..., n. Solution: p n (x) = y 0 l 0 (x) + y 1 l 1 (x) +... + y n l n (x), l k (x) = n j=1,j k Theorem Let
More informationChapter 3 Interpolation and Polynomial Approximation
Chapter 3 Interpolation and Polynomial Approximation Per-Olof Persson persson@berkeley.edu Department of Mathematics University of California, Berkeley Math 128A Numerical Analysis Polynomial Interpolation
More informationMATHEMATICAL METHODS INTERPOLATION
MATHEMATICAL METHODS INTERPOLATION I YEAR BTech By Mr Y Prabhaker Reddy Asst Professor of Mathematics Guru Nanak Engineering College Ibrahimpatnam, Hyderabad SYLLABUS OF MATHEMATICAL METHODS (as per JNTU
More informationDynamic Programming. Macro 3: Lecture 2. Mark Huggett 2. 2 Georgetown. September, 2016
Macro 3: Lecture 2 Mark Huggett 2 2 Georgetown September, 2016 Three Maps: Review of Lecture 1 X = R 1 + and X grid = {x 1,..., x n } X where x i+1 > x i 1. T (v)(x) = max u(f (x) y) + βv(y) s.t. y Γ 1
More informationBindel, Spring 2012 Intro to Scientific Computing (CS 3220) Week 12: Monday, Apr 16. f(x) dx,
Panel integration Week 12: Monday, Apr 16 Suppose we want to compute the integral b a f(x) dx In estimating a derivative, it makes sense to use a locally accurate approximation to the function around the
More information(0, 0), (1, ), (2, ), (3, ), (4, ), (5, ), (6, ).
1 Interpolation: The method of constructing new data points within the range of a finite set of known data points That is if (x i, y i ), i = 1, N are known, with y i the dependent variable and x i [x
More informationMath 4310 Solutions to homework 7 Due 10/27/16
Math 4310 Solutions to homework 7 Due 10/27/16 1. Find the gcd of x 3 + x 2 + x + 1 and x 5 + 2x 3 + x 2 + x + 1 in Rx. Use the Euclidean algorithm: x 5 + 2x 3 + x 2 + x + 1 = (x 3 + x 2 + x + 1)(x 2 x
More informationPARTIAL DIFFERENTIAL EQUATIONS
MATHEMATICAL METHODS PARTIAL DIFFERENTIAL EQUATIONS I YEAR B.Tech By Mr. Y. Prabhaker Reddy Asst. Professor of Mathematics Guru Nanak Engineering College Ibrahimpatnam, Hyderabad. SYLLABUS OF MATHEMATICAL
More informationGAUSS-LAGUERRE AND GAUSS-HERMITE QUADRATURE ON 64, 96 AND 128 NODES
GAUSS-LAGUERRE AND GAUSS-HERMITE QUADRATURE ON 64, 96 AND 128 NODES RICHARD J. MATHAR Abstract. The manuscript provides tables of abscissae and weights for Gauss- Laguerre integration on 64, 96 and 128
More informationOutline. 1 Numerical Integration. 2 Numerical Differentiation. 3 Richardson Extrapolation
Outline Numerical Integration Numerical Differentiation Numerical Integration Numerical Differentiation 3 Michael T. Heath Scientific Computing / 6 Main Ideas Quadrature based on polynomial interpolation:
More informationFast Numerical Methods for Stochastic Computations
Fast AreviewbyDongbinXiu May 16 th,2013 Outline Motivation 1 Motivation 2 3 4 5 Example: Burgers Equation Let us consider the Burger s equation: u t + uu x = νu xx, x [ 1, 1] u( 1) =1 u(1) = 1 Example:
More informationInterpolation & Polynomial Approximation. Hermite Interpolation I
Interpolation & Polynomial Approximation Hermite Interpolation I Numerical Analysis (th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University c 2011
More informationMTH5102 Spring 2017 HW Assignment 1: Prob. Set; Sec. 1.2, #7, 8, 12, 13, 20, 21 The due date for this assignment is 1/18/17.
MTH5102 Spring 2017 HW Assignment 1: Prob. Set; Sec. 1.2, #7, 8, 12, 13, 20, 21 The due date for this assignment is 1/18/17. 7. Let S = {0, 1} and F = R. In F (S, R), show that f = g and f + g = h, where
More informationyou expect to encounter difficulties when trying to solve A x = b? 4. A composite quadrature rule has error associated with it in the following form
Qualifying exam for numerical analysis (Spring 2017) Show your work for full credit. If you are unable to solve some part, attempt the subsequent parts. 1. Consider the following finite difference: f (0)
More informationCS 450 Numerical Analysis. Chapter 8: Numerical Integration and Differentiation
Lecture slides based on the textbook Scientific Computing: An Introductory Survey by Michael T. Heath, copyright c 2018 by the Society for Industrial and Applied Mathematics. http://www.siam.org/books/cl80
More informationLegendre s Equation. PHYS Southern Illinois University. October 18, 2016
Legendre s Equation PHYS 500 - Southern Illinois University October 18, 2016 PHYS 500 - Southern Illinois University Legendre s Equation October 18, 2016 1 / 11 Legendre s Equation Recall We are trying
More informationLecture 4: Fourier Transforms.
1 Definition. Lecture 4: Fourier Transforms. We now come to Fourier transforms, which we give in the form of a definition. First we define the spaces L 1 () and L 2 (). Definition 1.1 The space L 1 ()
More informationPolynomial Review Problems
Polynomial Review Problems 1. Find polynomial function formulas that could fit each of these graphs. Remember that you will need to determine the value of the leading coefficient. The point (0,-3) is on
More informationThe problems that follow illustrate the methods covered in class. They are typical of the types of problems that will be on the tests.
NUMERICAL ANALYSIS PRACTICE PROBLEMS JAMES KEESLING The problems that follow illustrate the methods covered in class. They are typical of the types of problems that will be on the tests.. Solving Equations
More informationApplications of Differentiation
Applications of Differentiation Definitions. A function f has an absolute maximum (or global maximum) at c if for all x in the domain D of f, f(c) f(x). The number f(c) is called the maximum value of f
More informationNumerical integration and differentiation. Unit IV. Numerical Integration and Differentiation. Plan of attack. Numerical integration.
Unit IV Numerical Integration and Differentiation Numerical integration and differentiation quadrature classical formulas for equally spaced nodes improper integrals Gaussian quadrature and orthogonal
More informationSeries Solutions of Differential Equations
Chapter 6 Series Solutions of Differential Equations In this chapter we consider methods for solving differential equations using power series. Sequences and infinite series are also involved in this treatment.
More informationLecture : The Indefinite Integral MTH 124
Up to this point we have investigated the definite integral of a function over an interval. In particular we have done the following. Approximated integrals using left and right Riemann sums. Defined the
More informationNUMERICAL ANALYSIS PROBLEMS
NUMERICAL ANALYSIS PROBLEMS JAMES KEESLING The problems that follow illustrate the methods covered in class. They are typical of the types of problems that will be on the tests.. Solving Equations Problem.
More informationEngg. Math. II (Unit-IV) Numerical Analysis
Dr. Satish Shukla of 33 Engg. Math. II (Unit-IV) Numerical Analysis Syllabus. Interpolation and Curve Fitting: Introduction to Interpolation; Calculus of Finite Differences; Finite Difference and Divided
More informationMath 4377/6308 Advanced Linear Algebra I Dr. Vaughn Climenhaga, PGH 651A HOMEWORK 3
Math 4377/6308 Advanced Linear Algebra I Dr. Vaughn Climenhaga, PGH 651A Fall 2013 HOMEWORK 3 Due 4pm Wednesday, September 11. You will be graded not only on the correctness of your answers but also on
More informationCURVE FITTING LEAST SQUARE LINE. Consider the class of linear function of the form. = Ax+ B...(1)
CURVE FITTIG LEAST SQUARE LIE Consider the class of linear function of the form y = f( x) = B...() In previous chapter we saw how to construct a polynomial that passes through a set of points. If all numerical
More informationMa 530 Power Series II
Ma 530 Power Series II Please note that there is material on power series at Visual Calculus. Some of this material was used as part of the presentation of the topics that follow. Operations on Power Series
More informationDepartment of Applied Mathematics Preliminary Examination in Numerical Analysis August, 2013
Department of Applied Mathematics Preliminary Examination in Numerical Analysis August, 013 August 8, 013 Solutions: 1 Root Finding (a) Let the root be x = α We subtract α from both sides of x n+1 = x
More informationExamples 2: Composite Functions, Piecewise Functions, Partial Fractions
Examples 2: Composite Functions, Piecewise Functions, Partial Fractions September 26, 206 The following are a set of examples to designed to complement a first-year calculus course. objectives are listed
More informationCubic Splines MATH 375. J. Robert Buchanan. Fall Department of Mathematics. J. Robert Buchanan Cubic Splines
Cubic Splines MATH 375 J. Robert Buchanan Department of Mathematics Fall 2006 Introduction Given data {(x 0, f(x 0 )), (x 1, f(x 1 )),...,(x n, f(x n ))} which we wish to interpolate using a polynomial...
More informationMath 255 Honors: Gram-Schmidt Orthogonalization on the Space of Polynomials
Math 55 Honors: Gram-Schmidt Orthogonalization on the Space of Polynomials David Moore May, 03 Abstract Gram-Schmidt Orthogonalization is a process to construct orthogonal vectors from some basis for a
More informationMeasure and Integration: Solutions of CW2
Measure and Integration: s of CW2 Fall 206 [G. Holzegel] December 9, 206 Problem of Sheet 5 a) Left (f n ) and (g n ) be sequences of integrable functions with f n (x) f (x) and g n (x) g (x) for almost
More information(f(x) P 3 (x)) dx. (a) The Lagrange formula for the error is given by
1. QUESTION (a) Given a nth degree Taylor polynomial P n (x) of a function f(x), expanded about x = x 0, write down the Lagrange formula for the truncation error, carefully defining all its elements. How
More informationMathematical Olympiad Training Polynomials
Mathematical Olympiad Training Polynomials Definition A polynomial over a ring R(Z, Q, R, C) in x is an expression of the form p(x) = a n x n + a n 1 x n 1 + + a 1 x + a 0, a i R, for 0 i n. If a n 0,
More informationChapter 13: Integral Calculus. SSMth2: Basic Calculus Science and Technology, Engineering and Mathematics (STEM) Strands Mr. Migo M.
Chapter 13: Integral Calculus SSMth2: Basic Calculus Science and Technology, Engineering and Mathematics (STEM) Strands Mr. Migo M. Mendoza Chapter 13: Integral Calculus Lecture 13.1: The Integrals Lecture
More informationWe consider the problem of finding a polynomial that interpolates a given set of values:
Chapter 5 Interpolation 5. Polynomial Interpolation We consider the problem of finding a polynomial that interpolates a given set of values: x x 0 x... x n y y 0 y... y n where the x i are all distinct.
More informationFast Convolution; Strassen s Method
Fast Convolution; Strassen s Method 1 Fast Convolution reduction to subquadratic time polynomial evaluation at complex roots of unity interpolation via evaluation at complex roots of unity 2 The Master
More informationFixed point iteration and root finding
Fixed point iteration and root finding The sign function is defined as x > 0 sign(x) = 0 x = 0 x < 0. It can be evaluated via an iteration which is useful for some problems. One such iteration is given
More informationDepartment of Applied Mathematics and Theoretical Physics. AMA 204 Numerical analysis. Exam Winter 2004
Department of Applied Mathematics and Theoretical Physics AMA 204 Numerical analysis Exam Winter 2004 The best six answers will be credited All questions carry equal marks Answer all parts of each question
More informationMathematics Notes for Class 12 chapter 7. Integrals
1 P a g e Mathematics Notes for Class 12 chapter 7. Integrals Let f(x) be a function. Then, the collection of all its primitives is called the indefinite integral of f(x) and is denoted by f(x)dx. Integration
More informationMath 660-Lecture 15: Finite element spaces (I)
Math 660-Lecture 15: Finite element spaces (I) (Chapter 3, 4.2, 4.3) Before we introduce the concrete spaces, let s first of all introduce the following important lemma. Theorem 1. Let V h consists of
More informationMultistage Methods I: Runge-Kutta Methods
Multistage Methods I: Runge-Kutta Methods Varun Shankar January, 0 Introduction Previously, we saw that explicit multistep methods (AB methods) have shrinking stability regions as their orders are increased.
More informationInterpolation and Approximation
Interpolation and Approximation The Basic Problem: Approximate a continuous function f(x), by a polynomial p(x), over [a, b]. f(x) may only be known in tabular form. f(x) may be expensive to compute. Definition:
More informationInterpolation. Chapter Interpolation. 7.2 Existence, Uniqueness and conditioning
76 Chapter 7 Interpolation 7.1 Interpolation Definition 7.1.1. Interpolation of a given function f defined on an interval [a,b] by a polynomial p: Given a set of specified points {(t i,y i } n with {t
More information6x 2 8x + 5 ) = 12x 8. f (x) ) = d (12x 8) = 12
AMS/ECON 11A Class Notes 11/6/17 UCSC *) Higher order derivatives Example. If f = x 3 x + 5x + 1, then f = 6x 8x + 5 Observation: f is also a differentiable function... d f ) = d 6x 8x + 5 ) = 1x 8 dx
More informationRoot Finding (and Optimisation)
Root Finding (and Optimisation) M.Sc. in Mathematical Modelling & Scientific Computing, Practical Numerical Analysis Michaelmas Term 2018, Lecture 4 Root Finding The idea of root finding is simple we want
More informationCalculus I Sample Exam #01
Calculus I Sample Exam #01 1. Sketch the graph of the function and define the domain and range. 1 a) f( x) 3 b) g( x) x 1 x c) hx ( ) x x 1 5x6 d) jx ( ) x x x 3 6 . Evaluate the following. a) 5 sin 6
More informationExercise 11. Isao Sasano
Exercise Isao Sasano Exercise Calculate the value of the following series by using the Parseval s equality for the Fourier series of f(x) x on the range [, π] following the steps ()-(5). () Calculate the
More information5. Hand in the entire exam booklet and your computer score sheet.
WINTER 2016 MATH*2130 Final Exam Last name: (PRINT) First name: Student #: Instructor: M. R. Garvie 19 April, 2016 INSTRUCTIONS: 1. This is a closed book examination, but a calculator is allowed. The test
More informationKey Words: cardinal B-spline, coefficients, moments, rectangular rule, interpolating quadratic spline, hat function, cubic B-spline.
M a t h e m a t i c a B a l a n i c a New Series Vol. 24, 2, Fasc.3-4 Splines in Numerical Integration Zlato Udovičić We gave a short review of several results which are related to the role of splines
More informationExam in TMA4215 December 7th 2012
Norwegian University of Science and Technology Department of Mathematical Sciences Page of 9 Contact during the exam: Elena Celledoni, tlf. 7359354, cell phone 48238584 Exam in TMA425 December 7th 22 Allowed
More informationFundamentals of Numerical Mathematics. Charles University Prague Faculty of Mathematics and Physics Czech Republic
Fundamentals of Numerical Mathematics Vít Dolejší Charles University Prague Faculty of Mathematics and Physics Czech Republic dolejsi@karlin.mff.cuni.cz December 18, 2017 Preface These lecture notes more
More information2
1 Notes for Numerical Analysis Math 54 by S. Adjerid Virginia Polytechnic Institute and State University (A Rough Draft) 2 Contents 1 Polynomial Interpolation 5 1.1 Review...............................
More information