Algorithm 934: Fortran 90 subroutines to compute Mathieu functions for complex values of the parameter

Authors:
Danilo Erricolo;Giuseppe Carluccio
Affiliations:
University of Illinois at Chicago, IL;University of Illinois at Chicago, IL
Venue:
ACM Transactions on Mathematical Software (TOMS)
Year:
2013

Citing 9
Cited 0

C mathematical function handbook

C mathematical function handbook
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)
Algorithm 644: A portable package for Bessel functions of a complex argument and nonnegative order

ACM Transactions on Mathematical Software (TOMS)
Algorithms for the computation of all Mathieu functions of integer orders

ACM Transactions on Mathematical Software (TOMS)
Remark on algorithms 352: characteristic values and associated solutions of Mathieu's differential equation

Communications of the ACM
Algorithm 352: characteristic values and associated solutions of Mathieu's differential equation [S22]

Communications of the ACM
The Mathematica Book

The Mathematica Book
Algorithm 861: Fortran 90 subroutines for computing the expansion coefficients of Mathieu functions using Blanch's algorithm

ACM Transactions on Mathematical Software (TOMS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Software to compute angular and radial Mathieu functions is provided in the case that the parameter q is a complex variable and the independent variable x is real. After an introduction on the notation and the definitions of Mathieu functions and their related properties, Fortran 90 subroutines to compute them are described and validated with some comparisons. A sample application is also provided.