Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Boole's rule

Numerical Algorithm

Boole's rule is a method of numerical quadrature from calculus, named after the mathematician George Boole. It approximates the area under a curve over a fixed interval by sampling the function at five equally spaced points and combining the five values with fixed weights, so that polynomials up to the fifth order are integrated exactly over that interval. It belongs to the Newton-Cotes family of rules, the same family that contains the trapezoid rule and Simpson's rule. When an interval is split into equal sections whose count is a multiple of four, a composite version applies the same weighting to each group of four sections and adds the results, which gives a more accurate estimate of a long integral. The form printed in Abramowitz and Stegun's Handbook of Mathematical Functions has a small typographical slip that led many later writers to call it Bode's rule by mistake. Its references include Boole's Treatise on the Calculus of Finite Differences.

Connections

Credited To

George Boole, Pioneers
Source Boole's rule (Wikipedia)

In Field

Source Boole's rule (Wikipedia)
Sources
Boole's rule (Wikipedia)
  • In Group: Numerical Integration and Differential Equations, Lead
    numerical quadrature arising in calculus
  • In Field: Numerical analysis, Lead, field
    numerical quadrature
  • Credited To: George Boole, Lead, namesake
    named after George Boole
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.