Answers are grounded in this paper and cite their sources.
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 ).
No takes yet. Share an insight, caveat, or question.
F.A. Alhargan (2000) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: