A pair days in the past I wrote a put up about turning a trick into a way, discovering one other use for a intelligent strategy to assemble easy, correct approximations. I used as my instance approximating the Bessel operate J(x) with (1 + cos(x))/2. I realized by way of a useful remark on Mathstodon that my approximation was the first-order a part of a extra normal collection
The primary-order approximation has error O(x4), as proven within the earlier put up. Including the second-order time period makes the error O(x6), and including the third-order time period makes it O(x8).
I’ve written a couple of occasions about cosine approximations to the conventional chance density. For instance, see this put up. We may use the identical concept because the collection above to approximate the conventional density with a collection of powers of cosine. This provides us
and as earlier than, the primary, second, and third order truncated collection have error O(x4), O(x6), and O(x8).
The final idea behind what’s happening right here is an extension of Bürmann’s theorem. The unique model of the concept depends on a collection inversion theorem that in flip depends on the approximating operate, in our case cos(x) − 1, not having zero spinoff on the heart of the collection. However there’s a extra normal type of Bürmann’s theorem based mostly on a extra normal type of collection inversion. We’ll at all times want a extra normal model of the concept when working with even features as a result of even features have zero spinoff at zero.
Right here’s one other instance, this time utilizing the Bessel operate J1, an odd operate, which does use the unique model of Bürmann’s theorem to approximate J1 by powers of sine.
On this case truncating the collection after sinok(x) offers an error O(xok + 2).
You will discover extra on Bürmann’s theorem in Whittker and Watson.
