Determination of the zeros of a linear combination of generalised polynomials
A generalized Horner algorithm for finding the zeros of a polynomial is derived which is expressed in a more general basis other than in the monomial basis. The general basis polynomials should be generated by a three-term recurrence relation and might be basis dependent. Then an implementation of the algorithm is briefly described which allows for the solution of polynomials expressed in any of twelve bases given in the paper. Finally, some numerical experiments are reported.
scientific article; zbMATH DE number 96899
scientific article