Algorithms for the computation of all Mathieu functions of integer orders

Authors:
Fayez A. Alhargan
Affiliations:
Computer and Electronics Research Institute, Riyadh, Saudi Arabia
Venue:
ACM Transactions on Mathematical Software (TOMS)
Year:
2000

Citing 4
Cited 3

The computation of eigenvalues and solutions of Mathieu's differential equation for noninteger order

ACM Transactions on Mathematical Software (TOMS)
Algorithm 721: MTIEU1 and MTIEU2: two subroutines to compute eigenvalues and solutions to Mathieu's differential equation for noninteger and integer order

ACM Transactions on Mathematical Software (TOMS)
A complete method for the computations of Mathieu characteristic numbers of integer orders

SIAM Review
Algorithm 537: Characteristic Values of Mathieu's Differential Equation [S22]

ACM Transactions on Mathematical Software (TOMS)

Algorithm 855: Subroutines for the computation of Mathieu characteristic numbers and their general orders

ACM Transactions on Mathematical Software (TOMS)
Algorithm 861: Fortran 90 subroutines for computing the expansion coefficients of Mathieu functions using Blanch's algorithm

ACM Transactions on Mathematical Software (TOMS)
Algorithm 934: Fortran 90 subroutines to compute Mathieu functions for complex values of the parameter

ACM Transactions on Mathematical Software (TOMS)

Quantified Score

Hi-index	0.00

Visualization

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-4n).