Displaying similar documents to “A fast algorithm for the construction of recurrence relations for modified moments”

Zeroes of orthogonal polynomials by QD-algorithm

Jiří Fiala (1969)

Aplikace matematiky

Similarity:

In the paper a method for computing zeroes of orthogonal polynomials is presented. An algorithm is given for computing directly the top row of the QD-scheme for some recurrently defined polynomials. The algorithm is then applied to classical orthogonal polynomials.