Numerical quadrature
Numerical quadrature is the computation of integrals by numerical approximation rather than by finding an exact antiderivative. This clip introduces it as the central theme of the lecture segment.
James Freericks · YouTube · 3:54
This 120-second lecture segment introduces numerical quadrature as a way to calculate integrals numerically. It first compares three rectangle-based rules on the interval [a,b]: left-endpoint, right-endpoint, and midpoint. The lecturer stresses that the subintervals have the same width and only the sample point used for rectangle height changes. The segment then explains refinement: reduce step size until the result stops changing, with interval halving presented as efficient because earlier function evaluations can be reused. It closes by transitioning to a broader family of methods shown as Riemann, Trapezoid, and Simpson. This 114-second lecture excerpt compares three numerical integration ideas on one slide: Riemann rectangles, the trapezoidal rule, and Simpson's rule. The speaker explains that the trapezoidal rule uses the average of endpoint heights times interval width, and that in composite form the endpoint values receive weight ½. He then introduces Simpson's rule as fitting three points to a parabola and states that it integrates constants, linear functions, and parabolas exactly. The clip closes by naming Romburg integration as a higher-order extension and Gaussian integration as a different class of method, without deriving formulas for either.
Use the learning inspector for key ideas and moments, or open the reading tabs for the complete notes.
Generated from the video's visuals and explanation; not verbatim speech.
The clip opens by announcing the topic: numerical quadrature, meaning the numerical calculation of integrals.
It then presents the simplest family of methods, rectangle rules, using three side-by-side graphs over the same interval with partition points .
The left graph is the left-endpoint rule: on each subinterval, the rectangle height is evaluated at the left edge.
The middle graph is the right-endpoint rule: the rectangle height comes from the right edge of each subinterval.
The right graph is the midpoint rule: the rectangle height is taken at the center of each subinterval.
The key structural point is that the subinterval widths are the same in all three cases; only the sampling location changes, so the rules differ in how rectangle heights are chosen.
Next, the lecture explains how to improve accuracy: keep reducing the step size until the computed integral stops changing.
It recommends halving each interval at every refinement step because the old partition points remain part of the new finer partition, allowing previous function values to be reused.
This matters because function evaluation is often the dominant cost in numerical integration.
Finally, the slide broadens the perspective from rectangles to other quadrature families, showing Riemann, Trapezoid, and Simpson as successive alternatives for approximating area under a curve.
The slide opens on three side-by-side graphs titled “Then on to trapezoids and parabolas,” comparing Riemann, Trapezoid, and Simpson approximations of the area under a curve. The lecturer begins by introducing the trapezoidal rule as a familiar numerical integration method.
He immediately qualifies the claim: the trapezoidal rule works better than rectangular rules in most cases, but for the particular curved example shown, a single trapezoid is not a very good fit. He adds that subdividing the interval into two pieces would let two trapezoids follow the curve more closely.
The key geometric fact is then stated: the area of one trapezoid equals the average of the two heights multiplied by the width of the interval. In symbolic form this is the familiar expression ()/2 · (b-a), matching the middle panel’s dashed secant line over [a,b].
From there he explains the composite structure. Interior sample points belong to two neighboring trapezoids, so their contributions combine fully, while the first and last points belong to only one trapezoid each. This is why the final summation resembles a rectangular rule except that the endpoint values are each weighted by ½.
The lecture then shifts to the rightmost panel and introduces Simpson’s rule. Instead of joining two points by a straight line, Simpson’s rule takes three points of the function and fits them to a parabola, then integrates that parabola as the approximation to the original integral.
The speaker states an important exactness property: because the approximating curve is quadratic, Simpson’s rule integrates exactly any function that is constant, linear, or a parabola.
He briefly mentions that one can go still further to higher-order fitting methods that exactly integrate higher powers, and names this family Romburg integration. No formula or algorithm is developed in this clip.
Finally, he introduces Gaussian integration as another class of numerical integration methods. He emphasizes that it works quite differently from the local fitting methods just discussed and says the details will be deferred to a later part of the course.
Numerical quadrature is the computation of integrals by numerical approximation rather than by finding an exact antiderivative. This clip introduces it as the central theme of the lecture segment.
The lecture starts with three common rectangle-based methods for approximating an integral over : left-endpoint, right-endpoint, and midpoint. All three divide the interval into equal-width subintervals and differ only in where each rectangle samples the function height.
In the left-endpoint rule, each rectangle's height is the value of at the left endpoint of its subinterval. This is shown in the leftmost panel of the "Start with rectangles" slide.
In the right-endpoint rule, each rectangle's height is the value of at the right endpoint of its subinterval. This corresponds to the middle panel of the rectangle comparison.
In the midpoint rule, each rectangle's height is the value of at the midpoint of its subinterval. The lecturer identifies this as the new rule relative to the left- and right-endpoint methods.
The three rectangle rules shown here use subintervals of exactly the same width. The distinction among them is not the spacing of the partition but the choice of sample point used to determine rectangle height.
To improve a numerical integral estimate, the lecture says to keep reducing the step size until the result stops changing. This describes convergence by successive refinement.
The lecturer recommends dividing each interval by 2 at each refinement step because earlier function values can be reused in the next computation. This avoids unnecessary repeated evaluations of .
In many numerical computations, evaluating the function is the most time-consuming operation. That practical fact motivates refinement schemes that preserve and reuse previously computed values.
After the rectangle rules, the lecture transitions to a wider family of quadrature methods illustrated as Riemann, Trapezoid, and Simpson. The visual progression contrasts rectangular approximation with trapezoidal and curved approximations.
The lecturer verbally associates the rectangle rules with the name Riemann summation and begins to mention Riemann-Stieltjes before the clip ends. The accompanying slide labels the rectangular panel "Riemann".
The trapezoidal rule approximates an integral by replacing the curve over an interval with a straight line between two sampled points and computing the area of the resulting trapezoid. The lecture states that this area is the average of the endpoint heights times the interval width, and that in composite form the rule looks like a rectangular sum except that the endpoint values are each weighted by one half.
When adjacent trapezoids are added, each interior point is shared by two neighboring trapezoids, while each outer endpoint belongs to only one. That geometric bookkeeping is why the summed trapezoidal rule assigns half weight to the endpoint function values.
Simpson's rule improves on linear approximation by fitting three points of the function to a parabola and integrating that parabola instead. The lecture explicitly states that this method integrates exactly any functions that are constants, linear, or parabolas.
The clip names Romburg integration as a higher-order family of methods that go beyond Simpson's rule by using higher-order fits capable of exactly integrating higher powers. Only the name and high-level role are given here.
Gaussian integration is mentioned as another class of numerical integration methods that works quite differently from the trapezoidal and Simpson approaches discussed earlier in the slide. The lecturer postpones details to a later part of the course.
Explore conditions, steps and evidence. Supplementary explanations are labeled separately from content shown in the video.
The vertical axis label appears on the rectangle-rule figures and again on the later Riemann/Trapezoid/Simpson figures.
The integrand function whose area under the curve is being approximated numerically.
Shown as a real-valued function of a real variable x; no explicit domain is stated in the clip.
The horizontal axis is labeled in all displayed integration diagrams.
x
Independent variable along the interval of integration.
Real variable shown on the horizontal axis.
The rectangle-rule figure marks the interval endpoints as and on the -axis.
The later trapezoid and Simpson figures also mark the integration limits as and .
a, b
Lower and upper limits of the integration interval being approximated.
Real numbers with implied by the diagrams.
The left-endpoint, right-endpoint, and midpoint panels each show interior partition points labeled , , and between and .
The clip does not state whether these are equally spaced by definition or merely drawn that way in this example.
, ,
Interior partition points used to divide into subintervals for the rectangle-rule illustrations.
Real numbers satisfying as depicted.
Each graph has a vertical axis labeled .
y
Vertical coordinate axis used to display the function value .
Real-valued axis in the plotted graphs.
All three plots label the vertical axis as .
The integrand function being numerically integrated.
Real-valued function of x.
All three plots label the horizontal axis as x.
x
Independent variable / horizontal coordinate in the integration plots.
Real interval shown on the horizontal axis.
The Trapezoid and Simpson panels mark the interval endpoints as a and b on the x-axis.
a, b
Endpoints of the integration interval.
Real numbers with .
On-screen text states that the points at the ends of the interval are each weighted by ½.
The lecturer says the endpoint values are each weighted by one half.
½
Weight applied to the endpoint function values in the trapezoidal-rule summation form described here.
Scalar weight.
The lecturer says this is the third part of lecture three, numerical quadrature, and that they will discuss how one calculates integrals using a numerical approach.
Title slide reads "Lecture 3 : Numerical quadrature" and "Calculating integrals / The numerical approach".
The clip introduces numerical quadrature as the topic concerned with computing integrals by numerical methods rather than by symbolic integration. The lecturer explicitly frames it as "how one calculates integrals using a numerical approach."
Applies when an integral is evaluated approximately by computation rather than exactly by analytic antiderivatives.
The lecturer says there are three common ways to evaluate the integral of a function numerically with rectangles: left endpoint, right endpoint, and midpoint rule.
Slide title: "Start with rectangles"; three side-by-side plots labeled "left-end point", "right-end point", and "midpoint".
On-screen text states: "There are three common ways that we can numerically approximate an integral. They are shown pictorially above. We already saw the left and right end-point rules. The new one is the midpoint rule."
The lecture presents three basic rectangle rules for approximating an integral over : the left-endpoint rule, the right-endpoint rule, and the midpoint rule. In all three, the interval is partitioned into subintervals of equal width, and the only difference is which sample point in each subinterval determines the rectangle height.
The illustrated subintervals have the same width.
The method approximates area under a curve by sums of rectangles.
"So on the left-hand rule, we take the function value on the left-hand part of the interval."
Left panel labeled "left-end point" shows rectangles whose heights match the curve at the left edge of each subinterval.
A yellow highlight box first encloses the left panel while the lecturer names the left-endpoint rule.
In the left-endpoint rule, each rectangle's height is the value of at the left endpoint of its subinterval. The diagram shows the curve sampled at the beginning of each strip, so the approximation is a sum of such rectangular areas.
Requires a partition of into subintervals.
Uses the function value at the left endpoint of each subinterval.
"For the right-hand rule, we take the function value on the right-hand side of the interval."
Middle panel labeled "right-end point" shows rectangles whose heights match the curve at the right edge of each subinterval.
The yellow highlight moves from the left panel to the middle panel as the lecturer discusses the right-endpoint rule.
In the right-endpoint rule, each rectangle's height is the value of at the right endpoint of its subinterval. This is the second of the three rectangle methods shown side by side.
Requires a partition of into subintervals.
Uses the function value at the right endpoint of each subinterval.
"And for the midpoint rule, we take the function value at the middle of the interval."
Right panel labeled "midpoint" shows rectangles whose heights match the curve at the center of each subinterval.
Text on slide: "The new one is the midpoint rule."
The yellow highlight then moves to the rightmost panel while the lecturer names the midpoint rule.
In the midpoint rule, each rectangle's height is the value of at the midpoint of its subinterval. The lecturer identifies this as the new rule relative to the previously discussed left- and right-endpoint rules.
Requires a partition of into subintervals.
Uses the function value at the midpoint of each subinterval.
"Now in a numerical calculation, what you do is you keep reducing that step size until the results stop changing."
On-screen text: "In a numerical calculation, we keep reducing the step size until the results stop changing."
The lecture states that a numerical quadrature procedure is improved by repeatedly reducing the step size until the computed result stops changing. This describes convergence testing by refinement rather than a single fixed partition.
The approximation is recomputed for smaller step sizes.
Stopping is based on the result no longer changing appreciably.
"And if you want to do it efficiently, the best way to do it is to reduce each of those intervals by a factor of two each time."
"In that way, the previous results from an earlier calculation can be employed in determining the next result, so you don't have to reevaluate the function as many different times."
On-screen text: "Efficient implementations divide each interval by 2, so the previous results can be used for the next results."
The lecturer recommends dividing each interval by 2 at each refinement step because earlier function values can be reused in the next computation. This reduces redundant evaluations of , which the lecturer says often dominate the runtime.
Refinement is by successive bisection of existing subintervals.
Benefit comes from reusing previously computed function values.
"And often in a computation, it's the function evaluation that is the thing that takes up most of the time."
The lecture notes that in many numerical computations, evaluating the function itself is the most time-consuming part. This motivates quadrature refinements that avoid unnecessary recomputation.
Stated as a general practical observation about computational cost, not as a theorem.
Slide title changes to "Then on to trapezoids and parabolas".
Three new panels appear labeled "Riemann", "Trapezoid", and "Simpson".
The lecturer says, "You've probably heard of some of the other rules. We've just been discussing the rectangular rules, which go under the name of Riemann summation or Riemann-Stieltjes."
The spoken phrase after "Riemann summation or Riemann" is cut off before the full term is completed in the audio transcript available here.
After introducing rectangle-based methods, the lecture moves to a broader family of quadrature rules illustrated as Riemann, Trapezoid, and Simpson. The visual progression contrasts rectangular approximation with trapezoidal and curved (parabolic) approximation.
This is an overview slide introducing alternative quadrature families.
The lecturer says the rectangular rules "go under the name of Riemann summation or Riemann-Stieltjes"; the final word is partially cut off in the available speech record.
The left panel on the new slide is labeled "Riemann" and shows stacked rectangles under a curve.
The exact spoken completion of "Riemann-Stieltjes" is not fully audible within the clip boundary.
The clip does not define Riemann-Stieltjes integration; it only names it in connection with rectangular rules.
The lecturer associates the rectangle rules just discussed with the name "Riemann summation" and begins to mention "Riemann-Stieltjes" before the clip ends. The accompanying "Riemann" panel visually reinforces that rectangular area sums are a classical starting point for numerical integration.
This is a naming association made in the lecture, not a formal definition in this clip.
The lecturer introduces the trapezoidal rule and explains it as averaging heights times width.
Middle panel labeled Trapezoid shows a straight dashed segment joining two points on the curve and a shaded trapezoidal area under it.
Text appears stating: The trapezoidal rule works better than the rectangular rules for most functions, and ends up being the same as the rectangular rules, except, the points at the ends of the interval are each weighted by ½.
The video presents the trapezoidal rule as a numerical integration method that replaces the curved integrand over an interval by a straight line between two sampled points, then uses the area of the resulting trapezoid. The lecturer states that the area of a trapezoid equals the average of the heights multiplied by the width, and that summing adjacent trapezoids gives a rule very similar to the rectangular rule except that the endpoint values are each weighted by one half.
Applied to numerical integration over an interval [a,b].
Uses function values at the interval endpoints.
For composite use, adjacent subinterval endpoints are shared, producing half weights at the outer endpoints.
The lecturer says Simpson's rule fits three points of the function to a parabola and integrates constants, linear functions, or parabolas exactly.
Right panel labeled Simpson shows a dashed parabolic arc through three marked points on the curve and a shaded region beneath it.
Text appears stating: Simpson's rule fits each three points to a parabola for the integration.
The video defines Simpson's rule as a numerical integration method that fits three points of the function to a parabola and integrates that parabola. The lecturer explicitly states that this method integrates exactly any functions that are constants, linear, or parabolas.
Uses three points of the function on the integration interval.
Exact for constant, linear, and quadratic functions according to the lecture statement.
The lecturer says: Now it turns out the area of a trapezoid is equal to the average of the height multiplied by the width of the rectangle.
The wording mixes trapezoid and rectangle; the intended meaning is the trapezoid width along the x-axis.
The area of a trapezoid is the average of the two heights multiplied by the width.
There are two endpoint heights over a common interval width.
For the trapezoid determined by two endpoint function values over an interval.
The lecturer explains that interior points contribute averages from neighboring trapezoids, so the final rule resembles the rectangular rule except the endpoint values are each weighted by one half.
On-screen text states that the points at the ends of the interval are each weighted by ½.
When adjacent trapezoids are summed, the resulting rule is like the rectangular rule except that the endpoint values are each weighted by one half.
Composite use of trapezoids over adjacent subintervals.
Shared interior vertices contribute to two neighboring trapezoids.
For the composite trapezoidal summation described in the lecture.
The lecturer says Simpson's rule will integrate exactly any functions that are constants, linear, or parabolas.
The displayed sentence states that Simpson's rule fits each three points to a parabola for the integration.
The exactness claim is spoken but not written in the visible caption.
Simpson's rule integrates exactly any functions that are constants, linear, or parabolas.
The method fits three points to a parabola and integrates that parabola.
For constant, linear, and quadratic functions as stated in the lecture.
"All of the intervals are exactly the same width, and the only difference is the question of how tall is the rectangle depending upon what value of the function we're going to take for determining the height of the rectangle."
Three panels share the same partition points but differ in where each rectangle touches the curve.
The three illustrated rules use subintervals of the same width.
Stated directly by the lecturer and visible from the aligned partitions in the figure.
Therefore the approximation difference comes from the choice of sample point that sets rectangle height.
Explicitly stated: the only difference is how tall the rectangle is, depending on which function value is taken.
Left rule uses the left endpoint value, right rule uses the right endpoint value, and midpoint rule uses the center value.
Each choice is named in the audio and shown in the corresponding panel.
The three rectangle quadrature rules are distinguished solely by the sample point used to determine rectangle height on equal-width subintervals.
The lecturer explains that halving each interval lets previous results be employed in determining the next result, so the function need not be reevaluated as many times.
Text states: "Efficient implementations divide each interval by 2, so the previous results can be used for the next results."
Start from a set of computed function values on a current partition.
Implicit in the discussion of reusing previous results.
Refine by dividing each interval by 2.
Explicitly recommended by the lecturer as the efficient way to reduce step size.
The old partition points remain part of the new, finer partition, so their function values can be reused.
Stated directly: previous results from an earlier calculation can be employed in determining the next result.
This reduces repeated function evaluations, which are often the dominant cost.
Follows from the lecturer's statement that function evaluation often takes up most of the time.
Successive bisection is presented as an efficient refinement strategy because it preserves previously computed function values and reduces redundant evaluations.
The lecturer derives the endpoint-half weighting by discussing how interior points belong to two neighboring trapezoids while endpoints belong to only one.
Start from the area formula for a single trapezoid over an interval.
Stated directly by the lecturer as the average of the heights times the width.
When the interval is subdivided, each interior sample point is shared by the trapezoid on its left and the trapezoid on its right.
Explained verbally by the lecturer using the geometry of adjacent trapezoids.
The first and last sample points are used by only one neighboring trapezoid each.
Follows from the same geometric description of adjacent trapezoids.
After adding all trapezoid areas, interior contributions combine fully while endpoint contributions remain halved.
This is the lecturer's stated conclusion about why the final rule resembles the rectangular rule except at the endpoints.
The composite trapezoidal rule can be viewed as a rectangular-type sum in which the endpoint function values are each weighted by one half.
The lecturer explains Simpson's rule by saying that three points of the function are fitted to a parabola and that the integral of that parabola is used.
The Simpson panel visually shows three marked points and a dashed parabolic fit.
Simpson's rule begins by sampling the function at three points.
Stated directly in the lecture and shown in the diagram.
A quadratic interpolant is constructed through the three sampled points.
Explicitly stated by the lecturer and visible as the dashed curve in the Simpson panel.
The numerical integral is obtained by integrating the fitted quadratic rather than the original function.
Stated by the lecturer as the method used for doing the integration.
Because the interpolant is quadratic, the method reproduces the integral exactly for polynomial degrees up to two.
The lecturer states exactness for constants, linear functions, or parabolas.
Simpson's rule approximates the integral by replacing the integrand locally with a parabola through three points, and it is exact for constant, linear, and quadratic functions according to the lecture.
A single slide shows three side-by-side plots labeled Riemann, Trapezoid, and Simpson, each shading an approximate area under a curve.
The lecturer refers to the particular example depicted and comments that the trapezoidal rule does not work so well for that example unless the interval is divided in half.
No explicit numeric integral value is computed on screen; the example is illustrative rather than a worked numerical exercise.
Compare three graphical numerical-integration approaches on the same curved function over an interval.
Left panel: Riemann approximation using rectangles.
Middle panel: Trapezoid approximation using a straight segment between two points.
Right panel: Simpson approximation using a parabola through three points.
The lecturer notes that for the displayed example the single trapezoid does not fit the curved function very well.
Understand how rectangle-based, trapezoid-based, and parabola-based quadrature differ geometrically.
The left plot illustrates approximation by vertical rectangles beneath the curve.
Shown visually in the Riemann panel and referenced by the lecturer as the prior method.
The middle plot shows a dashed straight line connecting two points on the curve, with the area below it shaded.
Visible in the Trapezoid panel and explained verbally as averaging endpoint heights.
The right plot shows a dashed parabolic arc through three marked points, with the area below it shaded.
Visible in the Simpson panel and explained verbally as fitting three points to a parabola.
The lecturer remarks that dividing the interval in half would let two trapezoids fit the curved function much better.
Stated directly in the audio.
The clip uses the three-panel figure to contrast rectangular, trapezoidal, and parabolic quadrature geometrically rather than to compute a specific numerical answer.
Verification is visual: the shaded regions show different approximating shapes under the same curve, and the spoken commentary explicitly compares their fit quality.
Opening title card shows "Lecture 3 : Numerical quadrature" over a chalkboard background, with course banner "Physics 155: Mathematical and Computational Physics" and subtitle "Calculating integrals / The numerical approach".
Title text
Course banner
Chalkboard background
No mathematical animation yet; the slide establishes the lecture topic.
Topic remains numerical integration / quadrature.
The opening frame frames the clip as a lecture segment on computing integrals numerically.
A white slide titled "Start with rectangles" displays three side-by-side coordinate plots labeled "left-end point", "right-end point", and "midpoint", each with axes and and partition labels .
A yellow rectangular highlight moves across the three panels in sequence while the lecturer names them.
Later, yellow arrows point to the top corners or midpoints of rectangles in each panel to indicate the chosen sample point.
Three coordinate plots
Curve
Rectangles under the curve
Partition labels
Yellow highlight boxes
Yellow arrows
Highlight shifts from left panel to middle panel to right panel.
Arrows indicate different sampling locations: left edge, right edge, and midpoint.
Explanatory text appears progressively beneath the figure.
The underlying curve and interval endpoints remain the same across the three panels.
The subinterval widths are shown as equal.
The visual comparison shows that the three rectangle rules differ only in where each rectangle samples the function height.
Text appears line by line under the figure: first introducing three common numerical approximation methods, then naming the midpoint rule as the new one, then stating that numerical calculations reduce step size until results stop changing, and finally noting that efficient implementations divide each interval by 2 so previous results can be reused.
Caption lines appearing sequentially
The text builds from method identification to refinement strategy to efficiency rationale.
All text refers to the same rectangle-rule slide.
The caption structure mirrors the lecture progression: define the three rules, then explain convergence by refinement, then explain why halving is efficient.
New slide titled "Then on to trapezoids and parabolas" shows three panels labeled "Riemann", "Trapezoid", and "Simpson".
The left "Riemann" panel is enlarged/highlighted while the other two dim slightly.
Riemann panel with rectangles
Trapezoid panel with straight-line top
Simpson panel with dashed parabolic arc
Axes labeled and
Interval endpoints and
Slide changes from rectangle-only comparison to a broader taxonomy of quadrature methods.
Emphasis shifts to the Riemann panel as the lecturer names rectangular rules as Riemann-type sums.
All three panels approximate area under the same type of curve over an interval.
The visual transition situates rectangle rules within a larger family that includes trapezoidal and parabolic (Simpson) approximations.
The slide title reads Then on to trapezoids and parabolas, with three panels labeled Riemann, Trapezoid, and Simpson.
Footer text reads Physics 155: Mathematical and Computational Physics and Calculating integrals / The numerical approach.
Title text: Then on to trapezoids and parabolas
Left panel labeled Riemann
Middle panel labeled Trapezoid
Right panel labeled Simpson
Footer course text and topic text
The slide remains structurally constant while explanatory text is added below the panels over time.
The three comparison panels stay visible throughout the clip.
Each panel continues to depict approximation of area under a curve.
The visual layout frames the lesson as a progression from rectangle-based integration to trapezoid-based and then parabola-based numerical quadrature.
Left panel shows a curve with several vertical rectangles shaded beneath it and axis labels , x, and tick marks including 0, 1, 2.
Blue curve
Several shaded rectangles
Axes labeled and x
Rectangles approximate the area under the curve by piecewise constant height.
This panel serves as the baseline rectangular method against which the trapezoidal and Simpson methods are compared.
Middle panel shows a blue curve, two marked endpoint dots, a dashed straight line connecting them, and a shaded trapezoidal region over [a,b].
Blue curve
Two endpoint markers
Dashed secant line
Shaded trapezoid region
Interval labels a and b
The dashed line replaces the curved top boundary by a straight segment between the endpoints.
The shaded region remains the area under the approximating straight line over the interval.
The picture encodes the trapezoidal rule as averaging endpoint heights and multiplying by interval width.
Right panel shows a blue curve, three marked points, a dashed parabolic arc through them, and a shaded region beneath the parabola over [a,b].
Blue curve
Three marked points
Dashed parabolic arc
Shaded region
Interval labels a and b
The approximating top boundary changes from a straight secant in the middle panel to a curved parabola in the right panel.
The shaded region represents the integral of the approximating curve rather than the original function.
The visual demonstrates Simpson's rule as quadratic interpolation followed by exact integration of the interpolant.
Explanatory text appears progressively below the panels: first the trapezoidal-rule sentence, then the Simpson sentence, then the Romburg sentence, then the Gaussian sentence.
Exact appearance times of each full sentence are approximate because the text builds incrementally.
Trapezoidal-rule sentence
Simpson's-rule sentence
Romburg-integration sentence
Gaussian-integration sentence
New sentences are added in sequence as the lecture advances from trapezoids to parabolas to higher-order and Gaussian methods.
The three comparison graphics remain above the text throughout.
The caption sequence mirrors the lecture's conceptual progression and reinforces each named method with a short written summary.
The lecturer explicitly says all intervals are exactly the same width and the only difference is the height choice.
The three rectangle panels use the same partition spacing.
One might think the left-, right-, and midpoint rules differ because they use differently sized subintervals.
The clip states and shows that the subintervals have the same width; the distinction is only which point in each subinterval is used to determine rectangle height.
The lecturer says that if intervals are reduced by a factor of two each time, previous results can be employed so one does not have to reevaluate the function as many times.
Text says efficient implementations divide each interval by 2 so previous results can be used for the next results.
One might assume that decreasing step size requires recomputing all function values from scratch.
The lecture emphasizes that bisection refinement allows reuse of earlier function evaluations, making the process more efficient.
The lecturer says the trapezoidal rule works better in most cases, but for this particular example depicted here it doesn't work so well.
The visible sentence says the trapezoidal rule works better than the rectangular rules for most functions.
One might infer from the general statement that the trapezoidal rule is universally superior on any pictured function.
The lecture explicitly qualifies the claim: it works better in most cases, but for the particular example shown it does not work so well unless the interval is subdivided.
The lecturer says Simpson's rule will integrate exactly any functions that are constants, linear, or parabolas.
This is a clarification of scope rather than a student error directly quoted in the video.
A learner may think the method matters only when the integrand itself is a parabola.
The lecture presents Simpson's rule as fitting three points to a parabola for integration, and notes exactness for constants, linear functions, and parabolas; the method is a general quadrature technique, not limited to integrands that are already drawn as parabolas.
After introducing numerical quadrature, the lecturer immediately says they have seen different ways to do this with rectangles.
Slide title changes from the general topic to "Start with rectangles".
Rectangle rules are presented as the first concrete family of methods within numerical quadrature.
The lecturer names the left-endpoint rule as one of the three common rectangle methods.
Left panel is singled out by highlight and arrow.
The left-endpoint rule is one specific member of the rectangle-rule family.
The lecturer names the right-endpoint rule as one of the three common rectangle methods.
Middle panel is highlighted and then indicated by an arrow.
The right-endpoint rule is another specific member of the rectangle-rule family.
The lecturer names the midpoint rule as the third rectangle method and calls it the new one.
Text explicitly says: "The new one is the midpoint rule."
The midpoint rule is the third specific member of the rectangle-rule family introduced in this clip.
The lecturer first says to keep reducing step size until results stop changing, then says the efficient way is to reduce each interval by a factor of two.
Halving intervals is presented as a particularly efficient special way to implement step-size refinement.
The efficiency claim about reusing previous results is followed by the statement that function evaluation often takes up most of the time.
The benefit of halving is motivated by the practical fact that function evaluations are often the dominant computational cost.
The lecturer says the rectangular rules go under the name of Riemann summation or Riemann-Stieltjes.
The new slide labels the rectangular panel "Riemann".
The clip does not formally define Riemann-Stieltjes integration.
Within this lecture segment, the rectangle rules are verbally associated with the name Riemann-type summation.
Slide title changes to "Then on to trapezoids and parabolas".
The new slide places Riemann, Trapezoid, and Simpson side by side.
The lecture broadens from rectangle-based approximation to a larger set of quadrature methods including trapezoidal and Simpson rules.
The middle and right panels compare a straight secant approximation with a parabolic approximation.
The lecturer moves from the trapezoidal rule to Simpson's rule as the next method on the right-hand side.
Simpson's rule generalizes the geometric idea of replacing the curve by a simpler shape: instead of a line through two points, it uses a parabola through three points.
The lecturer says there are techniques that go even further than this to higher order fits, called Romburg integration.
Text states: One can go even beyond this to higher order fits with a method called Romburg integration.
Romburg integration is introduced as a still higher-order extension beyond Simpson's parabolic fitting.
The lecturer says Gaussian integration is quite different from these forms of integration.
Text states: There also is another method called Gaussian integration, which is quite different in how it works.
Gaussian integration is explicitly contrasted with the previously discussed local fitting methods such as the trapezoidal rule.
The lecturer says Gaussian integration is quite different from these forms of integration.
Text states: There also is another method called Gaussian integration, which is quite different in how it works.
The lecture also contrasts Gaussian integration with Simpson's rule as a different class of numerical integration method.
The lecturer introduces the topic as numerical quadrature and says it concerns calculating integrals using a numerical approach.
The lecturer distinguishes the three rectangle rules by where the function value is taken.
Three panels labeled left-end point, right-end point, and midpoint.
The lecturer says all intervals are exactly the same width and the only difference is rectangle height.
The lecturer says to keep reducing step size until the results stop changing.
Text repeats the same convergence-by-refinement idea.
The lecturer explains that dividing each interval by 2 lets previous results be reused.
Text states that efficient implementations divide each interval by 2 so previous results can be used for the next results.
Slide shows panels labeled Riemann, Trapezoid, and Simpson.
Title reads "Then on to trapezoids and parabolas".
Lecturer introduces and explains the trapezoidal rule.
Trapezoidal-rule sentence is displayed.
The lecturer says it works better in most cases but not necessarily for the displayed example.
Text says it works better than the rectangular rules for most functions.
Lecturer explains fitting three points to a parabola.
Simpson panel shows the parabolic fit.
The lecturer states exactness for constants, linear functions, or parabolas.
Higher-order methods are introduced after Simpson's rule.
Romburg integration sentence appears.
The lecturer says Gaussian integration is quite different from these forms of integration.
Gaussian integration sentence appears.
Covered · Title slide and spoken introduction to numerical quadrature.
Covered · Three rectangle rules introduced and compared visually and verbally.
Covered · Refinement strategy and efficiency rationale for halving intervals.
Covered · Transition slide introducing Riemann, Trapezoid, and Simpson quadrature families.
Covered · Introduction and explanation of the trapezoidal rule, including its geometric picture, area formula, endpoint half-weighting, and comparison with rectangular/Riemann integration.
Covered · Introduction of Simpson's rule as a parabolic fit through three points, with the claim of exactness for constants, linear functions, and parabolas.
Covered · Brief mention of higher-order methods called Romburg integration.
Covered · Brief mention of Gaussian integration as a different class of numerical integration methods, with no detailed development in this clip.
Reviewed subject paths