2.

[ If you have any doubts then write down in the comment section ]
Let Pn be the set of real polynomials of degree at most n. Show that s (pEP5 :p(-7) (9)) is a subspace of P5
Let Pn be the set of real polynomials of degree at most n. Show that s (pEP5 :p(-7) (9)) is a subspace of P5
1. Let T : Pn(R) + Pn+1(R) be defined: T(P(x)) = (x + 1)p(x + 2) bases {1, X, ..., (a) (2 marks) Show that T is a linear transformation. (b) (3 marks) Is T one-to-one? Describe ker(T). What is the rank of T? (c) (8 marks) Find a matrix representation for T with respect to the standard xn} for Pn and {1, 2, ..., xn+1} for Pn+1 if n = 4. (d) (5 marks) Let D : Pn+1(R) +...
10. Consider the basis for P, »{1,x,x+,x"}. Let T be a transformation T:P, , where T(x*)= *t* dt. Find a standard matrix for this transformation. (Hint: You may need to review calculus and think about how P. polynomials can be represented as R"+1 vectors. n
1. Let T : P (R) Pn+1(R) be defined: T(p()) = (x + 1)p(x + 2) (a) (2 marks) Show that T is a linear transformation. (b) (3 marks) Is T one-to-one? Describe ker(T). What is the rank of T? (c) (8 marks) Find a matrix representation for T with respect to the standard bases {1, 2, ..., 2"} for Pn and {1, 2, ..., xn+1} for Pn+1 if n = 4. (d) (5 marks) Let D : Pn+1(R) +...
Let pn interpolate f at n + 1 distinct points. Consider pn in
its Lagrange and Newton forms
with
and
Suppose that we will evaluate pn many times for different values
of x. Thus, we can precompute the values of aj and cj and then can
use them without any cost. For both forms, propose efficient (in
terms of arithmetic operations) algorithms for computing pn(x).
Which form admits less expensive algorithm?
Problem 10.13. Recal that a polynomial p over R is an expression of the form p(x) an"+an--+..+ar +ao where each aj E R and n E N. The largest integer j such that a/ 0 is the degree of p. We define the degree of the constant polynomial p0 to be -. (A polynomial over R defines a function p : R R.) (a) Define a relation on the set of polynomials by p if and only if p(0) (0)...
1. Let T: Pn(R) + Pn+1(R) be defined: T(P(x)) = (x + 1)p(x + 2) (c) (8 marks) Find a matrix representation for T with respect to the standard bases {1, 2, ...,2"} for Pn and {1, 2, ...,xN+1} for Pn+1 if n = 4. (d) (5 marks) Let D : Pn+1(R) + Pn(R) be the derivative operator. What is the rank of DoT? Justify your answer. Describe ker(DoT). Is DoT one-to-one? (e) (5 marks) What is the rank of...
1. Let 21,...,m ER be m distinct real numbers. Define m (p, q)m = p(x;) g(x3), j=1 for all p, q E P = {real polynomials}. Does (-;-)m define an inner product on P? If so, then prove it. If not, then give a counterexample. For which n e N does (-:-)m define an inner product on Pn = {p € P: deg p <n}. Make sure to justify your answer fully!
Let pn = (an+bn)/2 , p = limn→∞pn, and en = p−pn. Here [an,bn],
with n ≥ 1, denotes the successive intervals that arise in the
Bisection method when it is applied to a continuous function f.
Show that |pn −pn+1| = .(b1-a1)
Let V P2(R) and let T V-V be a linear transformation defined by T(p)-q, where (x)(r p (r Let B = {x, 1 + x2, 2x-1} be a basis of V. Compute [TIB,B, and deduce if it is eigenvectors basis of