Computational aspects of pseudospectral Laguerre approximations (Q920587): Difference between revisions

Computations with Laguerre and Hermite polynomials lead to ill- conditioned algorithms and to underflow and overflow problems, even when the degree of the polynomials is low. In order to avoid these problems, the author introduces an interesting scaling function which limits these phenomena and allows, for instance, the determination of the zeros of \(L_ n^{(\alpha)}(x)\) for large values of the degree n.