Talk:Adaptive Simpson's method

Mathematics Start‑class Low‑priority

	Mathematics portal This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
Start	This article has been rated as Start-class on Wikipedia's content assessment scale.
Low	This article has been rated as Low-priority on the project's priority scale.

Relation to McKeeman's algorithm?

The proposed algorithm is totally unrelated to that stated in McKeeman's article. McKeeman subdivides the interval into *three* subintervals, and recurses on them. Further, error estimates are based on some difference between certain estimates, however not on asymptotic expansion, where the 15 in this article stems from. Certainly, this algorithm will work. It's much more straightforward and easier to grasp as McKeeman's is, however, they're not the same. —Preceding unsigned comment added by Ezander (talk • contribs) 09:50, 21 October 2010 (UTC)[reply]

Accuracy

At the end of the first paragraph "quadratic" should be "cubic" since Simpson's rule is exact for cubic polynomials. — Preceding unsigned comment added by 86.150.236.89 (talk) 22:05, 21 February 2012 (UTC)[reply]

C code

Shouldn't these two lines double Sleft = (h/12)*(fa + 4*fd + fc); double Sright = (h/12)*(fc + 4*fe + fb);

be: double Sleft = (h/6)*(fa + 4*fd + fc); double Sright = (h/6)*(fc + 4*fe + fb);

? — Preceding unsigned comment added by 81.251.150.71 (talk) 19:38, 23 September 2013 (UTC)[reply]