How Do You Determine Partition Points Using the Composite Trapezoidal Rule?

  • Context: Undergrad 
  • Thread starter Thread starter Hiche
  • Start date Start date
  • Tags Tags
    Partition Point
Click For Summary
SUMMARY

The discussion focuses on determining partition points using the composite trapezoidal rule for the integral I = 3∫xexdx from 0 to 2, which evaluates to approximately 25.1671683. It emphasizes that partition points can be chosen based on the behavior of the function, particularly where the nth derivative changes sharply. The conversation also touches on Euler's method, highlighting that while smaller step sizes (h) yield better approximations, the choice of h is subjective and depends on the desired accuracy and computational effort. The accuracy of trapezoidal methods improves with the square of the number of intervals, while Simpson's method improves with the cube.

PREREQUISITES
  • Understanding of the composite trapezoidal rule
  • Knowledge of Euler's method for numerical approximation
  • Familiarity with integral calculus and anti-derivatives
  • Concept of error analysis in numerical methods
NEXT STEPS
  • Study the implementation of the composite trapezoidal rule in numerical analysis
  • Learn about error estimation techniques for numerical integration
  • Explore the differences between Euler's method and higher-order methods like the trapezoidal rule and Simpson's rule
  • Investigate how to choose optimal partition points based on function behavior
USEFUL FOR

Students and professionals in mathematics, engineering, and computer science who are involved in numerical methods and integration techniques, particularly those looking to enhance their understanding of approximation methods.

Hiche
Messages
82
Reaction score
0
I'm not sure if this is the right place to ask..

Anyway.

Assume we have some integral I with 0 and 2 as limits. I = 3∫xexdx from 0 to 2. What exactly do we have to do to find the partition points (and what are they?) but using the composite trapezoidal rule? I = 25.1671683 upon computing normally.

Another unrelated question. In Euler's method for approximation, how do we choose our h value? The smaller the h is, the better the approximation, but is there a way to compute it from a given IVP?
 
Physics news on Phys.org
We don't, We can use whatever number of partitions we want (the more partitions the better the approximation) and whatever partition points we want. For simplicity we often choose them equally spaced but for some functions we might be guided by the function. For example, the error in using a "nth" order method (Euler's method is 1st order, trapezoidal rule is 2nd order, Simpson's rule is 3rd order) is proportional to the nth derivative. if there are some intervals on which that nth derivative changes sharply, and others where it is close to level, we might choose more partition points in those intervals with sharp increase or decrease, fewer where the derivative doesn't change much. But we choose those points, we don't "calculate" them.

As for Euler's method, as you say, the smaller h is, the better the approximation. But also, of course, since you have to do the same calculations on each interval, the more work you do. There is no way to "compute it from the given IVP" because the IVP does not know how accurate a solution you need or how much work you are willing to do. Those are things you have to decide.

In fact, the accuracy of the trapezoid methods increases as the number of intervals squared, Simpson's method as the number of intervals cubed which is why we would prefer to use Simpson's method- but the number of intervals still depends on how much accuracy you want and how much work you are willing to do.

I = 3∫xexdx from 0 to 2. What exactly do we have to do to find the partition points (and what are they?) but using the composite trapezoidal rule? I = 25.1671683 upon computing normally.
I take it that by "computing normally", you mean "finding and evaluating an anti-derivative". It's easy to integrate that "by parts" to get the exact answer [itex]3(e^2+ 1)[/itex] which, evaluated at 2 and 0, is just about that number you give.
Again, the more partitions you use (and I would use equally spaced partition points for simplicity) the more accurate your result but the more work you will have to do.
 
Last edited by a moderator:

Similar threads

  • · Replies 2 ·
Replies
2
Views
4K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 5 ·
Replies
5
Views
5K
  • · Replies 18 ·
Replies
18
Views
3K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 2 ·
Replies
2
Views
4K
Replies
5
Views
3K