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

by K. Salkauskas
Math. Comp. 27 (1973), 645-654 Request permission

## Abstract:

The requirement that a Chebyshev quadrature formula have distinct real nodes is not always compatible with the requirement that the degree of precision of an n-point formula be at least equal to n. This condition may be expressed as ${\left \| d \right \|_\nu } = 0,1 \leqq p$, where $d = ({d_1}, \cdots ,{d_n})$ with ${d_j} = \frac {{{\mu _0}(\omega )}}{n}\sum \limits _{i = 1}^n {x_i^j - {\mu _j}(\omega ),\quad j = 1,2, \cdots ,n,}$ ${\mu _j}(\omega ),j = 0,1, \cdots$, are the moments of the weight function $\omega$ used in the quadrature, and ${x_1}, \cdots ,{x_n}$ are the nodes. In those cases when ${\left \| d \right \|_2}$ does not vanish for a real choice of nodes, it has been proposed that a real minimizer of ${\left \| d \right \|_2}$ be used to supply the nodes. It is shown in this paper that, in such cases, minimizers of ${\left \| d \right \|_p},1 \leqq p < \infty$, always lead to formulae that are degenerate in the sense that the nodes are not all distinct. The results are valid for a large class of weight functions.
References
Similar Articles
• Retrieve articles in Mathematics of Computation with MSC: 41A55, 65D30
• Retrieve articles in all journals with MSC: 41A55, 65D30