Explicit Faber Polynomials on Circular Sectors (Q3987932)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 31888
Language Label Description Also known as
default for all languages
No label defined
    English
    Explicit Faber Polynomials on Circular Sectors
    scientific article; zbMATH DE number 31888

      Statements

      0 references
      0 references
      0 references
      28 June 1992
      0 references
      outer conformal mapping
      0 references
      recursive algorithm
      0 references
      Faber polynomials
      0 references
      REDUCE
      0 references
      MATHEMATICA
      0 references
      Explicit Faber Polynomials on Circular Sectors (English)
      0 references
      Faber polynomials are defined by the normalized outer conformal mapping of a compact set \(S\) on \(\{w:| w|>\rho\}\). For circular sectors \(S_ \alpha:=\{z:| z|\leq 1,\;|\arg(z)|\leq\alpha\}\) Coleman and Smith [Math. Comput. 49, 231-241 (1987; Zbl 0641.30005)] gave an explicit formula for the transfinite diameter \(\rho\); they also presented a recursive algorithm for the construction of the Faber polynomials. Based on these formulas the authors develop an improved algorithm for the computation of scaled Faber polynomials. It is shown that the polynomials can be represented by using only rational numbers. Explicit expressions for the Faber polynomials up to degree 20 are obtained by using computer algebra programs such as REDUCE, MATHEMATICA and others, see also the following review. Computing times of several computer algebra systems are compared. Further, the growth of the coefficients of the Faber polynomials is determined and explicit expressions are given for the norms of the polynomials in \(L^ 2(S_ \alpha)\) and \(L^ 2(\partial S_ \alpha)\). A conjecture is stated concerning the norm in \(L^ \infty(S_ \alpha)\).
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references