An approach to generate three-term recurrence relations with arbitrary degree step is proposed. Specifically, given any class of orthogonal polynomials defined by Favard’s theorem, we employ the adjacent members and to compute the one of high degree and that of low degree , where . Therefore, it is able to derive a three-term recurrence relation with respect to , and by taking 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.

生成讲解博客的中文版本

生成AI智能校验的中文版本