CHAPTER 6c. NUMERICAL INTERPOLATION

Similar documents
CHAPTER 6d. NUMERICAL INTERPOLATION

Numerical Integration Formulas

CS321. Numerical Analysis and Computing

TAYLOR AND MACLAURIN SERIES

CS537. Numerical Analysis and Computing

Taylor Polynomials and Approximations - Classwork

g () n = g () n () f, f n = f () n () x ( n =1,2,3, ) j 1 + j 2 + +nj n = n +2j j n = r & j 1 j 1, j 2, j 3, j 4 = ( 4, 0, 0, 0) f 4 f 3 3!

Topic 9 - Taylor and MacLaurin Series

Modification of Weerakoon-Fernando s Method with Fourth-Order of Convergence for Solving Nonlinear Equation

Some Variants of Newton's Method with Fifth-Order and Fourth-Order Convergence for Solving Nonlinear Equations

A NUMERICAL METHOD OF SOLVING CAUCHY PROBLEM FOR DIFFERENTIAL EQUATIONS BASED ON A LINEAR APPROXIMATION

Solving third order boundary value problem with fifth order block method

Lecture 11. Solution of Nonlinear Equations - III

Castiel, Supernatural, Season 6, Episode 18

The Discrete-Time Fourier Transform (DTFT)

Phys. 201 Mathematical Physics 1 Dr. Nidal M. Ershaidat Doc. 12

Mathematical Expressions for Estimation of Errors in the Formulas which are used to obtaining intermediate values of Biological Activity in QSAR

Representing Functions as Power Series. 3 n ...

Hyperbolic Heat Equation in Bar and Finite Difference Schemes of Exact Spectrum

SIDDHARTH GROUP OF INSTITUTIONS :: PUTTUR Siddharth Nagar, Narayanavanam Road QUESTION BANK (DESCRIPTIVE)

Mon Apr Second derivative test, and maybe another conic diagonalization example. Announcements: Warm-up Exercise:

ECE Spring Prof. David R. Jackson ECE Dept. Notes 20

A widely used display of protein shapes is based on the coordinates of the alpha carbons - - C α

Chapter 2: Numerical Methods

GRAPHING LINEAR EQUATIONS. Linear Equations ( 3,1 ) _x-axis. Origin ( 0, 0 ) Slope = change in y change in x. Equation for l 1.

Root Finding COS 323

Computation Sessional. Numerical Differentiation and Integration

FAILURE CRITERIA: MOHR S CIRCLE AND PRINCIPAL STRESSES

This chapter describes different methods to discretize the diffusion equation. f z 2 = 0. y ) x f

PRELIMINARY MATHEMATICS LECTURE 5

MATH 31B: MIDTERM 2 REVIEW

Maclaurin and Taylor series

AE/ME 339 Computational Fluid Dynamics (CFD)

Where do eigenvalues/eigenvectors/eigenfunctions come from, and why are they important anyway?

Linear Differential Equations of Higher Order Basic Theory: Initial-Value Problems d y d y dy

McGill University Math 354: Honors Analysis 3 Fall 2012 Solutions to selected problems. x y

Polynomial Generalizations and Combinatorial Interpretations for Sequences Including the Fibonacci and Pell Numbers

Solving Third Order Boundary Value Problem Using. Fourth Order Block Method

DECOMPOSITION METHOD FOR SOLVING A SYSTEM OF THIRD-ORDER BOUNDARY VALUE PROBLEMS. Park Road, Islamabad, Pakistan

CS475 Parallel Programming

Interpolation. 1. What is interpolation?

Fourier Series and Transforms

Probability, Statistics, and Reliability for Engineers and Scientists MULTIPLE RANDOM VARIABLES

NUMERICAL DIFFERENTIAL 1

Chapter 9: Numerical Differentiation

-ORDER CONVERGENCE FOR FINDING SIMPLE ROOT OF A POLYNOMIAL EQUATION

Euler-MacLaurin using the ZETA-matrix

FIR Filter Design: Part I

3.3 Rules for Differentiation Calculus. Drum Roll please [In a Deep Announcer Voice] And now the moment YOU VE ALL been waiting for

An Extension of the Szász-Mirakjan Operators

Northwest High School s Algebra 2/Honors Algebra 2 Summer Review Packet

Polynomials with Rational Roots that Differ by a Non-zero Constant. Generalities

Numerical Derivatives by Symbolic Tools in MATLAB

MATH 10550, EXAM 3 SOLUTIONS

On maximally nonlinear and extremal balanced Boolean functions

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting

Worksheet: Taylor Series, Lagrange Error Bound ilearnmath.net

International Journal of Mathematical Archive-4(9), 2013, 1-5 Available online through ISSN

9.3 Taylor s Theorem: Error Analysis for Series. Tacoma Narrows Bridge: November 7, 1940

Quiz. Use either the RATIO or ROOT TEST to determine whether the series is convergent or not.

TIME-PERIODIC SOLUTIONS OF A PROBLEM OF PHASE TRANSITIONS

μ are complex parameters. Other

Mth 95 Notes Module 1 Spring Section 4.1- Solving Systems of Linear Equations in Two Variables by Graphing, Substitution, and Elimination

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018

A collocation method for singular integral equations with cosecant kernel via Semi-trigonometric interpolation

Chapter 4. Fourier Series

Polynomials. Computer Programming for Engineers (2014 Spring)

Recursive Algorithms. Recurrences. Recursive Algorithms Analysis

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs

Accuracy. Computational Fluid Dynamics. Computational Fluid Dynamics. Computational Fluid Dynamics

Notes 19 Bessel Functions

CHAPTER 5. Theory and Solution Using Matrix Techniques

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

Newton s Method. y f x 1 x x 1 f x 1. Letting y 0 and solving for x produces. x x 1 f x 1. x 1. x 2 x 1 f x 1. f x 1. x 3 x 2 f x 2 f x 2.

CALCULATING FIBONACCI VECTORS

Solution of Differential Equation from the Transform Technique

An Improved Self-Starting Implicit Hybrid Method

TECHNIQUES OF INTEGRATION

SHAFTS: STATICALLY INDETERMINATE SHAFTS

STAT 516 Answers Homework 6 April 2, 2008 Solutions by Mark Daniel Ward PROBLEMS

Eigenvalues and Eigenvectors

Math 475, Problem Set #12: Answers

CHAPTER 5: FOURIER SERIES PROPERTIES OF EVEN & ODD FUNCTION PLOT PERIODIC GRAPH

I v r e s n a d di t r th o e r m e s o f r monoton e app o r i x m t a ion b a t 1. I r n o n a

CHAPTER 6b. NUMERICAL INTERPOLATION

(8) 1f = f. can be viewed as a real vector space where addition is defined by ( a1+ bi

Section 11.8: Power Series

Root Finding COS 323

Comparison Study of Series Approximation. and Convergence between Chebyshev. and Legendre Series

CHAPTER 3a. INTRODUCTION TO NUMERICAL METHODS

d y f f dy Numerical Solution of Ordinary Differential Equations Consider the 1 st order ordinary differential equation (ODE) . dx

Joint Probability Distributions and Random Samples. Jointly Distributed Random Variables. Chapter { }

Assignment 5: Solutions

Fuzzy n-normed Space and Fuzzy n-inner Product Space

In algebra one spends much time finding common denominators and thus simplifying rational expressions. For example:

AP Calculus BC Review Applications of Derivatives (Chapter 4) and f,

PARTIAL DIFFERENTIAL EQUATIONS SEPARATION OF VARIABLES

Recurrence Relations

Abstract Vector Spaces. Abstract Vector Spaces

Transcription:

CHAPTER 6c. NUMERICAL INTERPOLATION A. J. Clark School o Egieerig Departmet o Civil ad Evirometal Egieerig y Dr. Irahim A. Assakka Sprig ENCE - Computatio Methods i Civil Egieerig II Departmet o Civil ad Evirometal Egieerig Uiversity o Marylad, College Park Method o Udetermied Coeiciets Eample 6 Develop a ourth-order iterpolatio polyomial or the ollowig set o data, or which we kow their origial uctio, that is, (). 4 () 8 7 64 ENCE CHAPTER 6c. NUMERICAL INTERPOLATION Slide No. 7

Fiite Dierece Iterpolatio I the values o the idepedet variales are equally spaced, a iite dierece scheme ca e used to develop a iterpolatio polyomial. I is the icremet o which the values o the idepedet variale are recorded, the the irst iite dierece o the depedet variale y () is ( ) () ENCE CHAPTER 6c. NUMERICAL INTERPOLATION Slide No. 74 Fiite Dierece Iterpolatio The secod iite dierece ca e epressed as [ ] [ ( ) ( ) ] -[ ( ) ] I geeral, the iite dierece is [ ] () () ENCE CHAPTER 6c. NUMERICAL INTERPOLATION Slide No. 75

Fiite Dierece Iterpolatio Rule The ith iite dierece, where i is less tha or equal to, o a th-degree polyomial is a polyomial o degree ( ). This rule implies that the th dierece would e a costat. Assume the ollowig th-order polyomial: () L (4) does ot equal zero. ENCE CHAPTER 6c. NUMERICAL INTERPOLATION Slide No. 76 Fiite Dierece Iterpolatio For ( ), the polyomial give y Eq. 4 ecomes ( ) ( ) ( ) ( ) L ( ) This polyomial ca e rearrage ito ( ) ( ) L (5) (6) ENCE CHAPTER 6c. NUMERICAL INTERPOLATION Slide No. 77

Fiite Dierece Iterpolatio The irst iite dierece ca e costructed y sutractig Eq. 4 rom Eq.6 as ollows: () L ( ) ( ) L Or ( ) ( ) L (7) ENCE CHAPTER 6c. NUMERICAL INTERPOLATION Slide No. 78 Fiite Dierece Iterpolatio For ( ), Eq. 5 ecomes ( ) ( ) ( ) L (8) Equatios 8, 6, ad 4 ca e sustituted ito Equatio to compute a secod iite dierece, with the ollowig result: ( )( ) L (9) ENCE CHAPTER 6c. NUMERICAL INTERPOLATION Slide No. 79 4

Fiite Dierece Iterpolatio Equatio 9 is a polyomial o order (-). By iductio,the ith iite dierece is give y i i ( )( ) L ( i ) L i () Equatio is a polyomial o order ( ). The th iite dierece equals the ollowig costat: L! () ENCE CHAPTER 6c. NUMERICAL INTERPOLATION Slide No. 8 Fiite Dierece Iterpolatio Eample Suppose that, the Eq. 4 ecomes Or () () () ENCE CHAPTER 6c. NUMERICAL INTERPOLATION Slide No. 8 5

6 Slide No. 8 ENCE CHAPTER 6c. NUMERICAL INTERPOLATION Fiite Dierece Iterpolatio Eample (cot d): For ( ), ( ) ca e deied as ollows: () Slide No. 8 ENCE CHAPTER 6c. NUMERICAL INTERPOLATION Fiite Dierece Iterpolatio Eample (cot d): For ( ), ( ) ca e deied as ollows: 4 4 4 (4) 4

Fiite Dierece Iterpolatio Eample (cot d): Recall Eq.,, ad ( ) () ( ) ( ) ( ) The irst dierece is computed as ollows: ( ) (5) ENCE CHAPTER 6c. NUMERICAL INTERPOLATION Slide No. 84 Fiite Dierece Iterpolatio Eample (cot d): Similarly, recall Eq.,,, ad 4 [ ] [ ( ) ( ) ] [ ( ) ] - () ( ) ( 4 ) ( ) ( ) The secod iite dierece is computed as ollows: ( ) ( ) ( ) (6) ENCE CHAPTER 6c. NUMERICAL INTERPOLATION Slide No. 85 7

Fiite Dierece Iterpolatio First ad Secod Fiite Dierece The a quadratic polyomial o the orm () The irst ad secod iite dierece are give as ad ( ) ( ) (8) (7) ENCE CHAPTER 6c. NUMERICAL INTERPOLATION Slide No. 86 Fiite Dierece Iterpolatio Eample Develop a iterpolatio polyomial or the ollowig data usig the iite dierece approach. Estimate the () or.7 () 5 8 ENCE CHAPTER 6c. NUMERICAL INTERPOLATION Slide No. 87 8

Fiite Dierece Iterpolatio Eample (cot d): () 5 8 () ( ) 5 ENCE CHAPTER 6c. NUMERICAL INTERPOLATION Slide No. 88 Fiite Dierece Iterpolatio Eample (cot d): The irst iite dierece ca e otaied usig Eq. as ( ) 5 This value ca e equated to Eq. 7 as ollows: ( ) ()() () () (9) ENCE CHAPTER 6c. NUMERICAL INTERPOLATION Slide No. 89 9

Fiite Dierece Iterpolatio Eample (cot d): The secod iite dierece ca e otaied usig Eq. as [ ( ) ( ) ]-[ ( ) ] [ 8 5] [ 5 ] This value ca e equated to Eq. 8 as ollows: () () ENCE CHAPTER 6c. NUMERICAL INTERPOLATION Slide No. 9 Fiite Dierece Iterpolatio Eample (cot d): Solvig Eq., gives.5 Sustitutig this result ito Eq. 9, gives Or.5 (.5) ENCE CHAPTER 6c. NUMERICAL INTERPOLATION Slide No. 9

Fiite Dierece Iterpolatio Eample (cot d): Usig these values o ad ad ay oe o the three poits, a value o ca e calculated rom Eq. as ollows: () () 8.5().5() ENCE CHAPTER 6c. NUMERICAL INTERPOLATION Slide No. 9 Fiite Dierece Iterpolatio Eample (cot d): Thus, the iterpolatio polyomial is () ().5.5 (.7) ca e estimated: (.7).5(.7).5(.7) 6. 995 ENCE CHAPTER 6c. NUMERICAL INTERPOLATION Slide No. 9

Fiite Dierece Iterpolatio Fiite-dierece Tales We see i the precedig eample that the iite dierece approach ca e used to costruct a iterpolatio polyomial. However, the procedure ca e tedious ad requires a lot o computatios. Thereore, we eed some sort o scheme to orgaize the procedure usig iitedierece tales. ENCE CHAPTER 6c. NUMERICAL INTERPOLATION Slide No. 94 Fiite Dierece Iterpolatio Fiite-dierece Tale The iite-diereces ca e orgaized ito a tale as show i the et viewgraph. The iite-dierece tale ca e used to derive a iterpolatio polyomial. As we will see, iite-dierece tales ca e used with Newto ormula to derive iterpolatio polyomials. ENCE CHAPTER 6c. NUMERICAL INTERPOLATION Slide No. 95

Fiite-dierece Tale () () () ( ) () ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) : : : : ( -) [ ( -)] [ ( -)] [ ( -)] ( -) [ ( -)] [ ( -)] [ ( -)] () ( ) ( ) : [ ( -)] ::: () ( ) ENCE CHAPTER 6c. NUMERICAL INTERPOLATION Slide No. 96 Fiite Dierece Iterpolatio Eample Costruct a iite-dierece tale or the ollowig set o data: 4 () 78 97 744 ENCE CHAPTER 6c. NUMERICAL INTERPOLATION Slide No. 97

Fiite Dierece Iterpolatio Eample (cot d): () 4 66 97 6 78 7 469 6 97 78 547 4 744 ENCE CHAPTER 6c. NUMERICAL INTERPOLATION Slide No. 98 4