The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » sci.math.* » sci.math

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: Best approximation of P_n+1(x) by P_n(x)
Replies: 0  

Advanced Search

Back to Topic List Back to Topic List  

Posts: 9
Registered: 1/2/09
Best approximation of P_n+1(x) by P_n(x)
Posted: Jul 5, 2013 10:09 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

Given a polynomial of n+1th. order f(x)on -1 < x < 1, I want to find the polynomial of nth. order pn(x) that minimizes the maximum error. This is just minimax approximation, except that f(x) is a one degree higher polynomial. If f(x) = x^(n+1), then pn(x) = x^(n+1) -T_n+1(x)/2^n, where Tn(x) are the Chebyshev polynomials. My question is : If f(x) is a general polynomial of degree n+1, what is pn(x)?


Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.