Previous |  Up |  Next


Mathieu functions; iterative algorithm; Quick-BASIC program; Fourier series
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.
[1] Ch. Hayashi: Nonlinear Oscillations in Physical Systems. McGraw-Hill, New York, 1964. MR 0170071 | Zbl 0192.50605
[2] Yu. A. Ryabov: The estimations of convergence radius for series in power of parameter and algorithms for construction of Mathieu functions. Differencialnye uravnenija 15 (1979), no. 11, 1993-2003. (In Russian.) MR 0554259
[3] B. A. Grebenikov, Yu. A. Ryabov: Constructive methods in the analysis of nonlinear systems. Mir Publishers, Moscow, 1983, translated from Russian. MR 0733787 | Zbl 0536.65058
Partner of
EuDML logo