Affiliation:
1. Computer and Electronics Research Institute, Riyadh, Saudi Arabia
Abstract
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
).
Publisher
Association for Computing Machinery (ACM)
Subject
Applied Mathematics,Software
Cited by
41 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献