Computing Atlas

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

Simpson's Rule

Numerical Algorithm

Simpson's rules are numerical methods for approximating definite integrals, named after Thomas Simpson; the most basic, Simpson's one-third rule, approximates the integral of a function over an interval using the values of the function at the endpoints and the midpoint. The approximation is exact when the function is a polynomial of degree three or lower, and applying the rule to many equal subdivisions of the interval produces the composite Simpson's rule; a related Simpson's three-eighths rule uses one additional evaluation point for a lower error bound.

Facts
Time Complexity
Time Complexity (category)
Linear Time -- O(n) 1
Connections

In Field

Source Simpson's Rule (Wikipedia)
Sources
1. Simpson's Rule (Wikipedia)
  • Wikipedia infobox: time complexity linear
    linear
  • In Field: Computational Science, Lead sentence
    Simpson's rules are several approximations for definite integrals, named after Thomas Simpson (1710-1761).
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.