Papers
Topics
Authors
Recent
Search
2000 character limit reached

Asymptotic computation of classical orthogonal polynomials

Published 10 Apr 2020 in math.CA | (2004.05038v1)

Abstract: The classical orthogonal polynomials (Hermite, Laguerre and Jacobi) are involved in a vast number of applications in physics and engineering. When large degrees $n$ are needed, the use of recursion to compute the polynomials is not a good strategy for computation and a more efficient approach, such as the use of asymptotic expansions,is recommended. In this paper, we give an overview of the asymptotic expansions considered in [8] for computing Laguerre polynomials $L{(\alpha)}_n(x)$ for bounded values of the parameter $\alpha$. Additionally, we show examples of the computational performance of an asymptotic expansion for $L{(\alpha)}_n(x)$ valid for large values of $\alpha$ and $n$. This expansion was used in [6] as starting point for obtaining asymptotic approximations to the zeros. Finally, we analyze the expansions considered in [9], [10] and [11] to compute the Jacobi polynomials for large degrees $n$.

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (3)

Collections

Sign up for free to add this paper to one or more collections.