๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Algorithms for the computation of all Mathieu functions of integer orders

โœ Scribed by Alhargan, Fayez A.

Book ID
120591192
Publisher
Association for Computing Machinery
Year
2000
Tongue
English
Weight
123 KB
Volume
26
Category
Article
ISSN
0098-3500

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Algorithms for the computation of all Ma
Algorithms for the computation of all Mathieu functions of integer orders
โœ Alhargan, Fayez A. ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Association for Computing Machinery ๐ŸŒ English โš– 123 KB

The article presents methods for the computation of all Mathieu functions of integer order, which cover a large range of __n__ and __h__ ; previous algorithms were limited to small values of __n__ . The algorithms are given in sufficient detail to enable straightforward implementation. The algorithm

Parabolic cylinder functions of integer
Parabolic cylinder functions of integer and half-integer orders for nonnegative arguments
โœ J. Segura; A. Gil ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 911 KB

We present two codes to evaluate Parabolic Cylinder Functions {V(a, x), U(a, x)} for integer and half-integer positive values of a and for nonnegative x The codes are based on the forward application of the recurrence relation for V(a, x), the backward recurrence for U(a, x), the Wronskian relation