Algorithms for classical orthogonal polynomials

Details Algorithms for classical orthogonal polynomials Algorithms for classical orthogonal polynomials

1996-12-05

arxiv.org/abs/math/9612224v1

Mathematics

Classical Analysis and ODEs

Scientific paper

In this article explicit formulas for the recurrence equation p_{n+1}(x) = (A_n x + B_n) p_n(x) - C_n p_{n-1}(x) and the derivative rules sigma(x) p'_n(x) = alpha_n p_{n+1}(x) + beta_n p_n(x) + gamma_n p_{n-1}(x) and sigma(x) p'_n(x) = (alpha_n-tilde x + beta_n-tilde) p_n(x) + gamma_n-tilde p_{n-1}(x) respectively which are valid for the orthogonal polynomial solutions p_n(x) of the differential equation sigma(x) y''(x) + r(x) y'(x) + lambda_n y(x) = 0 of hypergeometric type are developed that depend only on the coefficients sigma(x) and tau(x) which themselves are polynomials w.r.t. x of degree not larger than 2 and 1, respectively. Partial solutions of this problem had beed previously published by Tricomi, and recently by Y\'a\~nez, Dehesa and Nikiforov.

Affiliated with

Also associated with

No associations

Rating

Algorithms for classical orthogonal polynomials 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 Algorithms for classical orthogonal polynomials, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithms for classical orthogonal polynomials will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-243049