NumericalAnalysis-683-2008aug - (c) What is the expected...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
MAT 683 Numerical Analysis August, 2008 NAME: 1. For which values of s [0 , 1], will there exist a unique quadratic polynomial p that satisfies the following conditions p (0) = p 0 , p (1) = p 1 , p 0 ( s ) = p 2 ? 2. Consider the equation 3 x + g ( x ) = 0 (1) with g : R R and g 0 ( x * ) = 0, where x * is the unique solution of (1). Assume the following iteration is used to obtain the solution x * x n +1 = - g ( x n ) 3 (a) What is the rate of convergence of this iteration? (b) State and prove a local convergence theorem for this iteration? 3. Consider the integration formula Z 1 - 1 f ( x ) dx f ( α 1 ) β + f ( α 2 ) β. (a) Determine α 1 , α 2 , and β so that this formula is exact for all quadratic polynomials. (b) What is the minimal degree polynomial for which the formula with the coefficients derived in (a) is not exact?
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: (c) What is the expected order of a composite integration method based upon the formula with coecients derived in (a)? 4. Let n denote the space of all polynomials of degree n . Given a function f dened on [-1 , 1], we denote dist( f, n ) = inf p n k f-p k , with k f-p k = sup x [-1 , 1] | f ( x )-p ( x ) | . (a) Given f ( x ) = x n +1 , nd p n such that k f-p k = dist( f, n ) . (2) Prove that your p indeed satises (2). (b) For the same f , compute dist( f, n ). (c) With f and p as above, discuss briey the use of the error function f-p in poly-nomial interpolation. 1...
View Full Document

Ask a homework question - tutors are online