Abstract
We consider the problem of numerically generating the recursion coefficients of orthogonal polynomials, given an arbitrary weight distribution of either discrete, continuous, or mixed type. We discuss two classical methods, respectively due to Stieltjes and Chebyshev, and modern implementations of them, placing particular emphasis on their numerical stability properties. The latter are being studied by analyzing the numerical condition of appropriate finite-dimensional maps. A number of examples are given to illustrate the strengths and weaknesses of the various methods and to test the theory developed for them.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: SIAM Journal on Scientific and Statistical Computing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
