Algorithm 861: Fortran 90 Subroutines for
Computing the Expansion Coefficients of
Mathieu Functions Using Blanch’s Algorithm

Erricolo, Danilo

Algorithm 861: Fortran 90 Subroutines for Computing the Expansion Coefficients of Mathieu Functions Using Blanch’s Algorithm

journal contribution

posted on 2014-02-03, 00:00 authored by Danilo Erricolo

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.

Funding

This work was supported by the DoD and the AFOSR under MURI Grant F-49620-01-1-0436 and in part by a grant of computer time from the DoD High Performance Computing Modernization Program at ASC and ERDC.

History

Publisher Statement

© ACM, 2014. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM Transactions on Mathematical Software, {Vol 32, Issue 4, (12/2006)} http://doi.acm.org/10.1145/nnnnnn.nnnnnn

Publisher

ACM

Language

en_US

issn

0098-3500

Issue date

2006-12-01

Usage metrics

Keywords

Mathieu function special function computation validation

Licence

In Copyright

Exports

RefWorks

BibTeX

Ref. manager

Endnote

DataCite

NLM

DC