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

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

Citing 7
Cited 1

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)
Algorithms for the computation of all Mathieu functions of integer orders

ACM Transactions on Mathematical Software (TOMS)
Algorithm 352: characteristic values and associated solutions of Mathieu's differential equation [S22]

Communications of the ACM
The Mathematica Book

The Mathematica Book
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,

Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,

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

A translation to Fortran 90 of Gertrude Blanch's algorithm for computing the expansion coefficients of the series that represent Mathieu functions is presented. Its advantages are portability, higher precision, practicality of use, and extended documentation. In addition, numerical validations and comparisons with other existing methods are presented.