Numerical Analysis
Numerical Analysis
10th Edition
ISBN: 9781305253667
Author: Richard L. Burden, J. Douglas Faires, Annette M. Burden
Publisher: Cengage Learning
bartleby

Videos

Textbook Question
Book Icon
Chapter 3.4, Problem 1ES

Use Theorem 3.9 or Algorithm 3.3 to construct an approximating polynomial for the following data.

Chapter 3.4, Problem 1ES, Use Theorem 3.9 or Algorithm 3.3 to construct an approximating polynomial for the following data. , example  1

Chapter 3.4, Problem 1ES, Use Theorem 3.9 or Algorithm 3.3 to construct an approximating polynomial for the following data. , example  2

Chapter 3.4, Problem 1ES, Use Theorem 3.9 or Algorithm 3.3 to construct an approximating polynomial for the following data. , example  3

Chapter 3.4, Problem 1ES, Use Theorem 3.9 or Algorithm 3.3 to construct an approximating polynomial for the following data. , example  4

ALGORITHM 3.3

Hermite Interpolation

To obtain the coefficients of the Hermite interpolating polynomial H(x) on the (n + 1) distinct numbers x0, …, xn for the function f:

INPUT numbers x0, x1, …, xn; values f (x0), ... , f (xn) and f′ (x0), ... , f′ (xn).

OUTPUT the numbers Q0, 0, Q1, 1, … , Q2n + 1, 2n + 1 where

H ( x ) = Q 0 , 0 + Q 1 , 1 ( x x 0 ) + Q 2 , 2 ( x x 0 ) 2 + Q 3 , 3 ( x x 0 ) 2 ( x x 1 )               + Q 4 , 4 ( x x 0 ) 2 ( x x 1 ) 2 +               + Q 2 n + 1 , 2 n + 1 ( x x 0 ) 2 ( x x 1 ) 2 ( x x n 1 ) 2 ( x x n ) .

Step 1 For i = 0, 1, … , n do Steps 2 and 3.

Step 2 S e t   z 2 i = x i ;        z 2 i + 1 = x i ;        Q 2 i , 0 = f ( x i ) ;        Q 2 i + 1 , 0 = f ( x i ) ;        Q 2 i + 1 , 1 = f ( x i ) .

Step 3 If i ≠ 0 then set

Q 2 i , 1 = Q 2 i , 0 Q 2 i 1 , 0 z 2 i z 2 i 1 .

Step 4 For i = 2, 3, … , 2n + 1

for j = 2, 3, ... , i set Q i , j = Q i , j 1 Q i 1 , j 1 z i z i j .

Step 5 OUTPUT (Q0, 0, Q1, 1, … , Q2n + 1, 2n + 1);

STOP.

Theorem 3.9 If fC1 [a, b] and x0, …, xn ∈ [a, b] are distinct, the unique polynomial of least degree agreeing with f and f′ at x0, …, xn is the Hermite polynomial of degree at most 2n + 1 given by

H 2 n + 1 ( x ) = j = 0 n f ( x j ) H n , j ( x ) + j = 0 n f ( x j ) H ^ n , j ( x ) ,

where, for Ln, j (x) denoting the jth Lagrange coefficient polynomial of degree n, we have

H n , j ( x ) = [ 1 2 ( x x j ) L n , j ( x j ) ] L n , j 2 ( x )  and  H ^ n , j ( x ) = ( x x j ) L n , j 2 ( x ) .

Moreover, if fC2n + 2 [a, b], then

f ( x ) = H 2 n + 1 ( x ) + ( x x 0 ) 2 ( x x n ) 2 ( 2 n + 2 ) ! f ( 2 n + 2 ) ( ξ ( x ) ) ,

for some (generally unknown) ξ(x) in the interval (a, b).

Blurred answer
Students have asked these similar questions
Let G be a connected graph that does not have P4 or C4 as an induced subgraph (i.e.,G is P4, C4 free). Prove that G has a vertex adjacent to all others
f(z) 18.7. Let f(z) = (e² + e³)/2. Evaluate dz, where y is any simple closed curve enclosing 0.
We consider a one-period market with the following properties: the current stock priceis S0 = 4. At time T = 1 year, the stock has either moved up to S1 = 8 (with probability0.7) or down towards S1 = 2 (with probability 0.3). We consider a call option on thisstock with maturity T = 1 and strike price K = 5. The interest rate on the money marketis 25% yearly.(a) Find the replicating portfolio (φ, ψ) corresponding to this call option.(b) Find the risk-neutral (no-arbitrage) price of this call option.(c) We now consider a put option with maturity T = 1 and strike price K = 3 onthe same market. Find the risk-neutral price of this put option. Reminder: A putoption gives you the right to sell the stock for the strike price K.1(d) An investor with initial capital X0 = 0 wants to invest on this market. He buysα shares of the stock (or sells them if α is negative) and buys β call options (orsells them is β is negative). He invests the cash balance on the money market (orborrows if the amount is…

Chapter 3 Solutions

Numerical Analysis

Ch. 3.1 - It is suspected that the high amounts of tannin in...Ch. 3.1 - Prob. 21ESCh. 3.1 - Prove Taylors Theorem 1.14 by following the...Ch. 3.1 - Prob. 1DQCh. 3.1 - If we decide to increase the degree of the...Ch. 3.2 - Let P3(x) be the interpolating polynomial for the...Ch. 3.2 - Nevilles method is used to approximate f(0.4),...Ch. 3.2 - Nevilles method is used to approximate f(0.5),...Ch. 3.2 - Suppose xj = j, for j = 0, 1, 2, 3, and it is...Ch. 3.2 - Nevilles Algorithm is used to approximate f(0)...Ch. 3.2 - Prob. 11ESCh. 3.2 - Prob. 13ESCh. 3.2 - Can Nevilles method be used to obtain the...Ch. 3.3 - Use Eq. (3.10) or Algorithm 3.2 to construct...Ch. 3.3 - Use Eq. (3.10) or Algorithm 3.2 to construct...Ch. 3.3 - Use the Newton forward-difference formula to...Ch. 3.3 - Use the Newton forward-difference formula to...Ch. 3.3 - Use the Newton backward-difference formula to...Ch. 3.3 - Use the Newton backward-difference formula to...Ch. 3.3 - a. Use Algorithm 3.2 to construct the...Ch. 3.3 - a. Use Algorithm 3.2 to construct the...Ch. 3.3 - a. Approximate f(0.05) using the following data...Ch. 3.3 - The following data are given for a polynomial P(x)...Ch. 3.3 - The following data are given for a polynomial P(x)...Ch. 3.3 - The Newton forward-difference formula is used to...Ch. 3.3 - Prob. 14ESCh. 3.3 - Prob. 16ESCh. 3.3 - Prob. 17ESCh. 3.3 - Show that the polynomial interpolating the...Ch. 3.3 - Prob. 20ESCh. 3.3 - Prob. 21ESCh. 3.3 - Prob. 22ESCh. 3.3 - Prob. 23ESCh. 3.3 - Compare and contrast the various...Ch. 3.3 - Is it easier to add a new data pair using...Ch. 3.3 - Prob. 3DQCh. 3.4 - Use Theorem 3.9 or Algorithm 3.3 to construct an...Ch. 3.4 - Use Theorem 3.9 or Algorithm 3.3 to construct an...Ch. 3.4 - The data in Exercise 1 were generated using the...Ch. 3.4 - The data in Exercise 2 were generated using the...Ch. 3.4 - Let f (x) = 3xex e2x. a. Approximate f (1.03) by...Ch. 3.4 - The following table lists data for the function...Ch. 3.4 - a. Show that H2n + 1 (x) is the unique polynomial...Ch. 3.4 - Prob. 1DQCh. 3.4 - Prob. 2DQCh. 3.4 - Prob. 3DQCh. 3.5 - Determine the natural cubic spline S that...Ch. 3.5 - Determine the clamped cubic spline s that...Ch. 3.5 - Construct the natural cubic spline for the...Ch. 3.5 - Construct the natural cubic spline for the...Ch. 3.5 - The data in Exercise 3 were generated using the...Ch. 3.5 - Prob. 6ESCh. 3.5 - Prob. 8ESCh. 3.5 - Prob. 11ESCh. 3.5 - Prob. 12ESCh. 3.5 - Prob. 13ESCh. 3.5 - Prob. 14ESCh. 3.5 - Given the partition x0 = 0, x1 = 0.05, and x2 =...Ch. 3.5 - Prob. 16ESCh. 3.5 - Prob. 21ESCh. 3.5 - Prob. 22ESCh. 3.5 - Prob. 23ESCh. 3.5 - It is suspected that the high amounts of tannin in...Ch. 3.5 - Prob. 29ESCh. 3.5 - Prob. 30ESCh. 3.5 - Prob. 31ESCh. 3.5 - Prob. 32ESCh. 3.5 - Let f C2[a, b] and let the nodes a = x0 x1 xn...Ch. 3.5 - Prob. 34ESCh. 3.5 - Prob. 35ESCh. 3.6 - Let (x0, y0) = (0,0) and (x1, y1) = (5, 2) be the...Ch. 3.6 - Prob. 2ESCh. 3.6 - Prob. 5ESCh. 3.6 - Prob. 1DQ
Knowledge Booster
Background pattern image
Math
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:9781133382119
Author:Swokowski
Publisher:Cengage
Text book image
Mathematics For Machine Technology
Advanced Math
ISBN:9781337798310
Author:Peterson, John.
Publisher:Cengage Learning,
Text book image
Linear Algebra: A Modern Introduction
Algebra
ISBN:9781285463247
Author:David Poole
Publisher:Cengage Learning
Text book image
Elements Of Modern Algebra
Algebra
ISBN:9781285463230
Author:Gilbert, Linda, Jimmie
Publisher:Cengage Learning,
Interpolation | Lecture 43 | Numerical Methods for Engineers; Author: Jffrey Chasnov;https://www.youtube.com/watch?v=RpxoN9-i7Jc;License: Standard YouTube License, CC-BY