[Calc II] quadratic Chebyshev approximation

In summary, to find the quadratic Chebyshev approximation of e^x on [-1, 1], we can plug in the given points (-sqrt(3)/2), 0, (sqrt(3)/2) into e^x = ax^2 + bx + c to get 3 equations with 3 unknowns. Solving these equations gives us a ≈ 0.53204, b ≈ 1.12977, and c = 1. As for part (b), we can use the Maclaurin series for the found quadratic to approximate the truncated Taylor series for e^x centered at 0.
  • #1
adillhoff
21
0

Homework Statement


(a) The quadratic Chebyshev approximation of a function on [-1, 1] can be obtained by finding the coefficients of an arbitrary quadratic y = ax^2 + bx + c which fit the function exactly at the points (-sqrt(3)/2), 0, (sqrt(3)/2). Find the quadratic Chebyshev approximation of e^x on [-1, 1]. Approximate a, b, c to 5 decimal places.

(b) Find the quadratic truncated Taylor series centered at 0 for e^x.

Homework Equations


e^x = ax^2 + bx + c
Maclaurin for e^x


The Attempt at a Solution


For part (a), I did not know how to find the quadratic Chebyshev approximation of e^x, but I plugged in the different values of x that were given into e^x = ax^2 + bx + c in order to get 3 equations with 3 unknowns. This gives me a ≈ 0.53204, b ≈ 1.12977, and c = 1.

As for part (b), since it asks for a truncated Taylor series, I assume I need a value to stop at. I really don't feel confident doing this. Do I need to simply write the Maclaurin series for e^x?
 
Physics news on Phys.org
  • #2
Just a guess, but maybe what's appropriate here is the Maclaurin series for your found quadratic. You could then compare with the series for exp(x).
 
  • #3
maclaurin series is just a taylor series about zero, and it asks for quadratic so just find terms up to x^2
 

FAQ: [Calc II] quadratic Chebyshev approximation

What is quadratic Chebyshev approximation?

Quadratic Chebyshev approximation is a mathematical method used to find the best polynomial approximation to a given function on a specified interval. It is based on the Chebyshev polynomials, which are a set of orthogonal polynomials that minimize the maximum error of the approximation.

What is the main advantage of using quadratic Chebyshev approximation?

The main advantage of using quadratic Chebyshev approximation is that it provides a more accurate approximation compared to other methods, such as linear or polynomial interpolation. It also minimizes the error over the entire interval, rather than just at a few specific points.

How is quadratic Chebyshev approximation different from other polynomial approximation methods?

Quadratic Chebyshev approximation differs from other polynomial approximation methods in that it uses a specific set of orthogonal polynomials (Chebyshev polynomials) instead of just monomials. This allows for a more efficient and accurate approximation.

In what areas of science is quadratic Chebyshev approximation commonly used?

Quadratic Chebyshev approximation is commonly used in fields such as physics, engineering, and computer science for approximating functions and data sets. It is also used in numerical analysis and signal processing.

How is the error of a quadratic Chebyshev approximation measured?

The error of a quadratic Chebyshev approximation is typically measured by the maximum deviation between the actual function and the approximation over the specified interval. This is known as the maximum error or the maximum absolute error.

Back
Top