Use Eq. (3.10) or Algorithm 3.2 to construct interpolating polynomials of degree one, two, and three for the following data. Approximate the specified value using each of the polynomials.
- a. f(8.4) if f(8.1) = 16.94410, f(8.3) = 17.56492, f(8.6) = 18.50515, f(8.7) = 18.82091
- b. f(0.9) if f(0.6) = −0.17694460, f(0.7) = 0.01375227, f(0.8) = 0.22363362, f(1.0) = 0.65809197
ALGORITHM 3.2
Newton’s Divided-Difference Formula
To obtain the divided-difference coefficients of the interpolatory polynomial P on the (n + 1) distinct numbers x0, x1, … xn, for the function f:
INPUT numbers x0, x1, … xn; values f(x0), f(x1), …, f(xn) as F0,0, F1,0, …, Fn,0.
OUTPUT the numbers F0,0, F1,1, …, Fn,n where
Step 1 For i = 1, 2, …, n
For j = 1, 2, …, i
set
Step 2 OUTPUT (F0,0, F1,1, …, Fn,n);
STOP.
Trending nowThis is a popular solution!
Chapter 3 Solutions
Numerical Analysis
Additional Math Textbook Solutions
Elementary Statistics ( 3rd International Edition ) Isbn:9781260092561
Beginning and Intermediate Algebra
Finite Mathematics for Business, Economics, Life Sciences and Social Sciences
Elementary & Intermediate Algebra
Precalculus: A Unit Circle Approach (3rd Edition)
- 30. (a) What is meant by the term "product measur"? ANDarrow_forward14. Define X-(H) for a given H E R. Provide a simple example.arrow_forwardLet G be a connected graph with n ≥ 2 vertices. Let A be the adjacency matrix of G. Prove that the diameter of G is the least number d such that all the non-diagonal entries of the matrix A are positive.arrow_forward
- find the general soultion (D-DxDy-2Dx)Z = sin(3x+4y) + x²yarrow_forward3. Show that (a) If X is a random variable, then so is |X|;arrow_forward8. [10 marks] Suppose that 15 people are at a dinner and that each person knows at least 9 of the others. Can the diners be seated around a circular table so that each person knows both of their immediate neighbors? Explain why your answer is correct.arrow_forward
- 19. Let X be a non-negative random variable. Show that lim nE (IX >n)) = 0. E lim (x)-0. = >arrow_forward9. [10 marks] Consider the following graph G. (a) Find the Hamilton closure of G. Explain why your answer is correct. (b) Is G Hamiltonian? Explain why your answer is correct.arrow_forward7. [10 marks] Let G = (V,E) be a 3-connected graph with at least 6 vertices. Let C be a cycle in G of length 5. We show how to find a longer cycle in G. Ꮖ (a) Let x be a vertex of G that is not on C. Show that there are three C-paths Po, P1, P2 that are disjoint except at the shared initial vertex x and only intersect C at their final vertices. (b) Show that at least two of Po, P1, P2 have final vertices that are adjacent along C.arrow_forward
- Algebra & Trigonometry with Analytic GeometryAlgebraISBN:9781133382119Author:SwokowskiPublisher:CengageCollege AlgebraAlgebraISBN:9781305115545Author:James Stewart, Lothar Redlin, Saleem WatsonPublisher:Cengage LearningAlgebra: Structure And Method, Book 1AlgebraISBN:9780395977224Author:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. ColePublisher:McDougal Littell