Computing zeros and orders of Bessel functions
ISCM '90 Proceedings of the International Symposium on Computation mathematics
Numerical Recipes in FORTRAN: The Art of Scientific Computing
Numerical Recipes in FORTRAN: The Art of Scientific Computing
The Zeros of Special Functions from a Fixed Point Method
SIAM Journal on Numerical Analysis
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
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
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
Hi-index | 0.00 |
A Maple algorithm for the computation of the zeros of orthogonal polynomials (OPs) and special functions (SFs) in a given interval [ x 1 , x 2 ] is presented. The program combines symbolic and numerical calculations and it is based on fixed point iterations. The program uses as inputs the analytic expressions for the coefficients of the three-term recurrence relation and a differencedifferential relation satisfied by the set of OPs or SFs. The performance of the method is illustrated with several examples: Hermite, Chebyshev, Legendre, Jacobi and Gegenbauer polynomials, Bessel, Coulomb and Conical functions.