Trapezoidal Rule: Maximum error in approximation?

Jess Karakov
Messages
11
Reaction score
3

Homework Statement


Suppose that T4 is used to approximate the ∫ from 0 to 3 of f(x)dx, where -2 ≤ f ''(x) ≤ 1 for all x. What is the maximum error in the approximation?

Homework Equations


|ET|≤ (K(b-a)^3)/(12n^2)

The Attempt at a Solution


So I know how to find the error of the trapezoidal rule using the above equation, but I do not understand how to find the maximum error in an approximation.
To find the max error I would find the max/mins of f ''(x), right? But I don't know how to do that when f(x) is not given
 
Physics news on Phys.org
Jess Karakov said:

Homework Statement


Suppose that T4 is used to approximate the ∫ from 0 to 3 of f(x)dx, where -2 ≤ f ''(x) ≤ 1 for all x. What is the maximum error in the approximation?

Homework Equations


|ET|≤ (K(b-a)^3)/(12n^2)

The Attempt at a Solution


So I know how to find the error of the trapezoidal rule using the above equation, but I do not understand how to find the maximum error in an approximation.
To find the max error I would find the max/mins of f ''(x), right? But I don't know how to do that when f(x) is not given

You can't. All you can do is find an upper bound on the absolute error, so your actual error may be a lot less than your bound. Just find an upper bound on ##|f''(x)|## over ##x \in [0,3]##.

Note: people hardly ever find best bounds by finding actual maxima of things like ##|f''(x)|##; typically, they are satisfied with decent bounds.
 
So K would just be 2?
 
Jess Karakov said:
So K would just be 2?

You tell me.
 
yes...:wink:
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top