Three-term Recurrence Relation with Arbitrary Degree Step for Orthogonal Polynomials

Abstract

An approach to generate three-term recurrence relations with arbitrary degree step is proposed. Specifically, given any class of orthogonal polynomials \Qp(x)\p=0∞ defined by Favard's theorem, we employ the adjacent members Qp(x) and Qp-1(x) to compute the one of high degree Qp+s(x) and that of low degree Qp-t(x), where (s,t)∈ N+. Therefore, it is able to derive a three-term recurrence relation with respect to Qp+s(x), Qp(x) and Qp-t(x) by taking Qp-1(x) as the bridge. Moreover, as the extensions of standard recursive formula which is characterized with degree increase, the ones for degree decrease and end-to-middle directions are formulated as well. The explicit recurrence relations with two-degree step are offered for Hermite, Gegenbauer and Legendre polynomials. Precision comparison is also performed between the standard three-term recurrence relation and the proposed ones.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…