hw6solns

hw6solns - 151A HW 6 Solutions Will Feldman 1. Let f C n+1...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
151A HW 6 Solutions Will Feldman 1. Let f C n +1 ([ a,b ]) and p be the interpolating polynomial at the n + 1 equally spaced node points a = x 0 ,...,x n = b with ( b - a ) /n = h = x j +1 - x j . Recall that we have the error bound | f ( x ) - p ( x ) | ≤ | f ( n +1) ( ξ ) | ( n + 1)! Π n j =0 | x - x j | . (a) Now for x [ a,b ] arbitrary there is some j such that x j x x j +1 . We an upper bound for g ( x ) = | ( x - x j )( x - x j +1 ) | = ( x - x j )( x j +1 - x ). Just use calculus to find 0 = g 0 ( x ) = x j + x j +1 - 2 x so that the maximum value of g occurs when x = ( x j + x j +1 ) / 2. Plugging in we get that | ( x - x j )( x - x j +1 ) | ≤ ( h/ 2) 2 . (b) Now for i < j use the bound ( x - x i ) ( j - i + 1) h so that Π i<j ( x - x i ) h j Π i<j ( j - i + 1) = ( j + 1)! h j . Similarly for i > j + 1 we have that ( x i - x ) ( i - j ) h so that Π i>j +1 ( x i - x ) h n - j - 1 Π i>j +1 ( i - j ) = ( n - j )! h n - j - 1 . Combining the two above bounds with the one from (a) gives the desired result.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/30/2012 for the course MATH 131a taught by Professor Hitrik during the Spring '08 term at UCLA.

Page1 / 2

hw6solns - 151A HW 6 Solutions Will Feldman 1. Let f C n+1...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online