Displaying 601 – 620 of 1092

Showing per page

Numeric-analytical construction of Mathieu functions

Yu. A. Ryabov (1999)

Mathematica Bohemica

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.

On an iterative method for unconstrained optimization

Ioannis K. Argyros (2015)

Applicationes Mathematicae

We present a local and a semi-local convergence analysis of an iterative method for approximating zeros of derivatives for solving univariate and unconstrained optimization problems. In the local case, the radius of convergence is obtained, whereas in the semi-local case, sufficient convergence criteria are presented. Numerical examples are also provided.

Currently displaying 601 – 620 of 1092