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.

 

A Chebyshev polynomial rate-of-convergence theorem for Stieltjes functions
HTML articles powered by AMS MathViewer

by John P. Boyd PDF
Math. Comp. 39 (1982), 201-206 Request permission

Abstract:

The theorem proved here extends the author’s previous work on Chebyshev series [4] by showing that if $f(x)$ is a member of the class of so-called "Stieltjes functions" whose asymptotic power series $\Sigma {a_n}{x^n}$ about $x = 0$ is such that \[ \overline {\lim \limits _{n \to \infty } } \frac {{\log |{a_n}|}}{{n\log n}} = r,\] then the coefficients of the series of shifted Chebyshev polynomials on $x \in [0,a],\Sigma {b_n}T_n^\ast (x/a)$, satisfy the inequality \[ \frac {2}{{r + 2}} \geqslant \overline {\lim \limits _{n \to \infty } } \frac {{\log |(\log |{b_n}|)|}}{{\log n}} \geqslant 1 - \frac {r}{2}.\] There is an intriguing relationship between this theorem and a similar rate-of-convergence theorem for Padé approximants of Stieltjes functions which is discussed below.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 41A25
  • Retrieve articles in all journals with MSC: 41A25
Additional Information
  • © Copyright 1982 American Mathematical Society
  • Journal: Math. Comp. 39 (1982), 201-206
  • MSC: Primary 41A25
  • DOI: https://doi.org/10.1090/S0025-5718-1982-0658224-1
  • MathSciNet review: 658224