Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Minimal solutions of three-term recurrence relations and orthogonal polynomials
HTML articles powered by AMS MathViewer

by Walter Gautschi PDF
Math. Comp. 36 (1981), 547-554 Request permission

Abstract:

We observe that the well-known recurrence relation ${p_{n + 1}}(z) = (z - {a_n}){p_n}(z) - {b_n}{p_{n - 1}}(z)$ for orthogonal polynomials admits a "minimal solution" if z is outside the spectrum of the mass distribution $ds(t)$ with respect to which the polynomials are orthogonal and if the moment problem for this distribution is determined. The minimal solution, indeed is ${f_n}(z) = \smallint {p_n}(t) ds(t)/(z - t)$, and can be computed accurately by means of the author’s continued fraction algorithm. An application is made to special Gauss-type quadrature formulas.
References
Similar Articles
Additional Information
  • © Copyright 1981 American Mathematical Society
  • Journal: Math. Comp. 36 (1981), 547-554
  • MSC: Primary 33A65; Secondary 65D20, 65D30
  • DOI: https://doi.org/10.1090/S0025-5718-1981-0606512-6
  • MathSciNet review: 606512