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.

 

Chebyshev-type quadrature and partial sums of the exponential series
HTML articles powered by AMS MathViewer

by Arno Kuijlaars PDF
Math. Comp. 64 (1995), 251-263 Request permission

Abstract:

Chebyshev-type quadrature for the weight functions \[ {w_a}(t) = \frac {{1 - at}}{{\pi \sqrt {1 - {t^2}} }},\quad - 1 < t < 1,\quad - 1 < a < 1,\] is related to a problem concerning partial sums of the exponential series, namely the problem to extend the nth partial sum to a polynomial of degree 2N having all zeros on the circle $|z| = |a|N$. Using this connection, we show that the minimal number N of nodes needed for Chebyshev-type quadrature of degree n for ${w_a}(t)$ satisfies an inequality ${C_1}n \leq N \leq {C_2}n$ with positive constants ${C_1},{C_2}$. As an application we prove that the minimal number N of nodes for Chebyshev-type quadrature of degree n on a torus embedded in ${{\mathbf {R}}^3}$ satisfies an inequality ${C_1}{n^2} \leq N \leq {C_2}{n^2}$.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 65D32, 41A55
  • Retrieve articles in all journals with MSC: 65D32, 41A55
Additional Information
  • © Copyright 1995 American Mathematical Society
  • Journal: Math. Comp. 64 (1995), 251-263
  • MSC: Primary 65D32; Secondary 41A55
  • DOI: https://doi.org/10.1090/S0025-5718-1995-1250771-6
  • MathSciNet review: 1250771