# 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.

## Gaussian quadrature involving Einstein and Fermi functions with an application to summation of seriesHTML articles powered by AMS MathViewer

by Walter Gautschi and Gradimir V. Milovanović
Math. Comp. 44 (1985), 177-190 Request permission

## Abstract:

Polynomials ${\pi _k}( \cdot ) = {\pi _k}( \cdot ;d\lambda )$, $k = 0,1,2, \ldots$, are constructed which are orthogonal with respect to the weight distributions $d\lambda (t) = {(t/({e^t} - 1))^r}\;dt$ and $d\lambda (t) = {(1/({e^t} + 1))^r}\;dt$, $r = 1,2$, on $(0,\infty )$. Moment-related methods being inadequate, a discretized Stieltjes procedure is used to generate the coefficients ${\alpha _k},{\beta _k}$ in the recursion formula ${\pi _{k + 1}}(t) = (t - {\alpha _k}){\pi _k}(t) - {\beta _k}{\pi _{k - 1}}(t)$, $k = 0,1,2, \ldots$, ${\pi _0}(t) = 1$, ${\pi _{ - 1}}(t) = 0$. The discretization is effected by the Gauss-Laguerre and a composite Fejér quadrature rule, respectively. Numerical values of ${\alpha _k},{\beta _k}$, as well as associated error constants, are provided for $0 \leqslant k \leqslant 39$. These allow the construction of Gaussian quadrature formulae, including error terms, with up to 40 points. Examples of n-point formulae, $n = 5(5)40$, are provided in the supplements section at the end of this issue. Such quadrature formulae may prove useful in solid state physics calculations and can also be applied to sum slowly convergent series.
Similar Articles