Numerical algorithms for the real zeros of hypergeometric functions

Details Numerical algorithms for the real zeros of hypergeometric functions Numerical algorithms for the real zeros of hypergeometric functions

2004-01-12

arxiv.org/abs/math/0401116v1

Mathematics

Numerical Analysis

21 pages, 6 Figures

Scientific paper

Algorithms for the computation of the real zeros of hypergeometric functions which are solutions of second order ODEs are described. The algorithms are based on global fixed point iterations which apply to families of functions satisfying first order linear difference differential equations with continuous coefficients. In order to compute the zeros of arbitrary solutions of the hypergeometric equations, we have at our disposal several different sets of difference differential equations (DDE). We analyze the behavior of these different sets regarding the rate of convergence of the associated fixed point iteration. It is shown how combinations of different sets of DDEs, depending on the range of parameters and the dependent variable, is able to produce efficient methods for the computation of zeros with a fairly uniform convergence rate for each zero.

Affiliated with

Also associated with

No associations

Rating

Numerical algorithms for the real zeros of hypergeometric functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Numerical algorithms for the real zeros of hypergeometric functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Numerical algorithms for the real zeros of hypergeometric functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-373418