Work

Computation of Faber Series With Application to Numerical Polynomial Approximation in the Complex Plane

Year: 1983
Type: article
Abstract: Kövari and Pommerenke [19], and Elliott [8], have shown that the truncated Faber series gives a polynomial approximation which (for practical values of the degree of the polynomial) is very close to the best approximation. In this paper we discuss efficient Fast Fourier Transform (FFT) and recursive methods for the computation of Faber polynomials, and point out that the FFT method described by Geddes [13], for computing Chebyshev coefficients can be generalized to compute Faber coefficients. We also give a corrected bound for the norm of the Faber projection (that given in Elliott [8], being unfortunately slightly in error) and very briefly discuss a possible extension of the method to the case when the mapping function, which is required to compute the Faber series, is not known explicitly.
Language: English
Open Access status: bronze
OpenAlex ID: W2010214435
FWCI: 2.621
Cites: 30
Cited by: 91
Related to: 10