Jump to content

Talk:Adaptive Simpson's method

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Ezander~enwiki (talk | contribs) at 09:50, 21 October 2010 (Relation to McKeeman's algorithm?: new section). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconMathematics Stub‑class Low‑priority
WikiProject iconThis 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.
StubThis article has been rated as Stub-class on Wikipedia's content assessment scale.
LowThis 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.