please answer question 2 only, question1 is the information that might need for question 2
please answer question 2 only, question1 is the information that might need for question 2 2. Define the divided diffe...
2. Let ro < 1<..< n be n + 1 distinct points in IR. Define polynomials Co, ..., (n of degree n by (r - k) Let P, = 1,[r] be the polynomials of degree n, which is a vector space of dimension n + 1. (a) Show that the n+1 polynomials {lo, ..., Ln^ are basis for P i.e., they are linearly independent. (b) Find the coordinates [f]в of polynomial f E 1, with respect to the basis l-[10,...
Question 1 2 pts The Hermite Interpolation polynomial for 33 distinct nodes has Degree at most {Be Careful with the answer. Look at the Theorem and the Question Carefully; compare the given information} Question 2 2 pts If f € C4 [a, b] and p1, P2, P3, and p4 are Distinct Points in [a, b], Then 1. There are two 3rd divided differences 2. There is exactly one 3rd divided difference and it is equal to the value of f(iv)...
Q3 Preliminary material The homework assignment is found on the next page. Our goal in this homework is to develop an algorithm for solving equations of the form f (x) (1) = X where f is a function S S, for some S C R". This kind of problem is sometimes called fixed point problem, and a solution x of problem (1) is called a fixed point of f. The algorithm we will consider is the following: a Step 0....
I need help with question 2, 3 and 4 please. Thanks in advance. Answer the following questions: 1. Prove that any polynomial of degree k is O (nk 2. By finding appropriate values ofc and no, prove that: f(n) 4 n log2 n + 4 n2 + 4 n iso(n2). 3. Find functions fi and fi such that both fi(n) and /i(n) are O(g(n)), but fi(n) is not OG(n)) 4. Determine whether the following statements are true or false. Briefly...
Please answer all questions Q2 2015 a) show that the function f(x) = pi/2-x-sin(x) has at least one root x* in the interval [0,pi/2] b)in a fixed-point formulation of the root-finding problem, the equation f(x) = 0 is rewritten in the equivalent form x = g(x). thus the root x* satisfies the equation x* = g(x*), and then the numerical iteration scheme takes the form x(n+1) = g(x(n)) prove that the iterations converge to the root, provided that the starting...