Optimizing Polynomial Approximations for C2 Functions on Closed Intervals

  • Thread starter Thread starter Demon117
  • Start date Start date
  • Tags Tags
    Polynomial
Demon117
Messages
162
Reaction score
1
1. Suppose that f:R-->R is of class C2. Given b>0 and a positive number \epsilon, show that there is a polynomial p such that

|p(x)-f(x)|<\epsilon, |p'(x)-f'(x)|<\epsilon, |p"(x)-f"(x)|<\epsilon for all x in [0,b].



The Attempt at a Solution



First I choose a polynomial q that approximates f''. If |q - f''|<\eta throughout [0,b], and if p is the polynomial such that p''=q, p(0)=f(0), and p'(0)=f'(0), then I come to this question: How big can |p' - f'| and |p - f| be in terms of \eta and b? I think I am thinking about this correctly, but I cannot come to a conclusion. Should I use the definition of the derivative namely:

For all \epsilon>0, there is a \delta>0, such that when 0<|t-x|<\delta, this guarantees that |(p(t)-p(x))/(t-x) - L|<\epsilon; where L is the derivative at x.
 
Physics news on Phys.org
Observe that (p&#039; - f&#039;)&#039; = p&#039;&#039; - f&#039;&#039;; what does this tell you about the accumulated error in approximating f&#039; by p&#039;, as you move across the interval from 0 to b?
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top