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.

 

Explicit Faber polynomials on circular sectors
HTML articles powered by AMS MathViewer

by Karin Gatermann, Christoph Hoffmann and Gerhard Opfer PDF
Math. Comp. 58 (1992), 241-253 Request permission

Abstract:

We present explicit and precise expressions for the Faber polynomials on circular sectors up to degree 20. The precision is obtained by modifying (and simultaneously speeding up) an algorithm of Coleman and Smith so that an essential part of the Faber polynomials can be represented using only rational numbers. The growth of the coefficients of the Faber polynomials is determined. In addition, explicit expressions are given for the area two-norm and line two-norm of these polynomials. A conjecture is stated with respect to the uniform (infinity) norm which would also allow the explicit computation of the corresponding uniform norms of the Faber polynomials. Apart from a table of Faber polynomials, there are several other tables and graphs that illustrate the behavior of the Faber polynomials.
References
Similar Articles
Additional Information
  • © Copyright 1992 American Mathematical Society
  • Journal: Math. Comp. 58 (1992), 241-253
  • MSC: Primary 30C10; Secondary 30-04, 30C20, 65A05
  • DOI: https://doi.org/10.1090/S0025-5718-1992-1106967-4
  • MathSciNet review: 1106967