✦ LIBER ✦

Algorithms for the computation of all Mathieu functions of integer orders

✍ Scribed by Alhargan, Fayez A.

Book ID: 120591193
Publisher: Association for Computing Machinery
Year: 2000
Tongue: English
Weight: 123 KB
Volume: 26
Category: Article
ISSN: 0098-3500
DOI: 10.1145/358407.358420

No coin nor oath required. For personal study only.

✦ Synopsis

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 algorithms can handle a large range of the order
n
(0-200) and the parameter
h
(0-4
n
).

📜 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

Algorithm 804: subroutines for the compu

Algorithm 804: subroutines for the computation of Mathieu functions of integer orders

✍ Alhargan, Fayez A. 📂 Article 📅 2000 🏛 Association for Computing Machinery 🌐 English ⚖ 85 KB

Algorithms for the evaluation of Bessel

Algorithms for the evaluation of Bessel functions of complex argument and integer orders

✍ G.D.C. Kuiken 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 267 KB

On the computation of Mathieu functions

📂 Article 📅 1975 🏛 Springer 🌐 English ⚖ 44 KB

Algorithms for computing Bessel function

Algorithms for computing Bessel functions of half-integer order with complex arguments

✍ L.V. Babushkina; M.K. Kerimov; A.I. Nikitin 📂 Article 📅 1988 🏛 Elsevier Science ⚖ 734 KB

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