Abstract: In this paper we present an iterative algorithm for the construction of Mathieu functions of any order $N$ in the form of Fourier series (practically, polynomials), and also the corresponding Quick-BASIC program for realization of this algorithm with numerical values of the parameter.
Keywords: Mathieu functions, iterative algorithm, Quick-BASIC program
Classification (MSC2000): 65D15, 34A50, 34A25
Full text of the article: