Sign in
Back
Algorithms for the Computation of All Mathieu Functions of Integer Orders
Journal article   Open access  Peer reviewed

Algorithms for the Computation of All Mathieu Functions of Integer Orders

Fayez Alhargan
ACM transactions on mathematical software, Vol.26(3), pp.390-407
01/09/2000
DOI: https://doi.org/10.1145/358407.358420

Abstract

Classical Analysis and ODEs Mathematics
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).
url
https://doi.org/10.1145/358407.358420View
Published (Version of record) Open

Metrics

1 Record Views

Details