Displaying similar documents to “Symbolic computation of Appell polynomials using Maple.”

Linearization of the product of orthogonal polynomials of a discrete variable

Saïd Belmehdi, Stanisław Lewanowicz, André Ronveaux (1997)

Applicationes Mathematicae

Similarity:

Let P k be any sequence of classical orthogonal polynomials of a discrete variable. We give explicitly a recurrence relation (in k) for the coefficients in P i P j = k c ( i , j , k ) P k , in terms of the coefficients σ and τ of the Pearson equation satisfied by the weight function ϱ, and the coefficients of the three-term recurrence relation and of two structure relations obeyed by P k .

On the computation of the GCD of 2-D polynomials

Panagiotis Tzekis, Nicholas Karampetakis, Haralambos Terzidis (2007)

International Journal of Applied Mathematics and Computer Science

Similarity:

The main contribution of this work is to provide an algorithm for the computation of the GCD of 2-D polynomials, based on DFT techniques. The whole theory is implemented via illustrative examples.