On the zeros and turning points of special functions
Journal of Computational and Applied Mathematics - Proceedings of the sixth international symposium on orthogonal polynomials, special functions and their applications
Journal of Symbolic Computation - Special issue: Algebra and computer analysis
New inequalities from classical sturm theorems
Journal of Approximation Theory
Zeros of the Macdonald function of complex order
Journal of Computational and Applied Mathematics
Applied Numerical Mathematics
New inequalities from classical Sturm theorems
Journal of Approximation Theory
SIAM Journal on Numerical Analysis
Computation of the real zeros of the kummer function M(a; c; x)
ICMS'06 Proceedings of the Second international conference on Mathematical Software
Journal of Approximation Theory
Hi-index | 0.00 |
A scheme for the computation of the zeros of special functions and orthogonal polynomials is developed. We study the structure of the first order difference-differential equations (DDEs) satisfied by two fundamental sets of solutions of second order ODEs $y_n^{\prime\prime}(x)+A_{n}(x)y_n (x)=0$, n being the order of the solutions and An (x) a family of continuous functions. It is proved that, with a convenient normalization of the solutions, $T_{\pm1}(z)=z\pm \mbox{\rm sign}(d)\arctan(y_n (x(z))/y_{n\pm 1}(x(z)))$ are globally convergent iterations with fixed points $z(x_n^{(i)})$, $x_n^{(i)}$ being the zeros of yn(x); d is one of the coefficients in the DDEs and z(x) is a primitive of d. The structure of the DDEs is also used to set global bounds on the differences between adjacent zeros of functions of consecutive orders and to find iteration steps which guarantee that all the zeros inside a given interval can be found with certainty. As an illustration, we describe how to implement this scheme for the calculation of the zeros of arbitrary solutions of the Bessel, Coulomb, Legendre, Hermite, and Laguerre equations.