English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Let f be an entire function of positive order and finite type. The subject of this note is the convergence acceleration of polynomial approximants of f by incorporating information about the growth of f(z) for z → ∞. We consider near polynomial approximation on a compact plane set K, which should be thought of as a circle or a real interval. Our aim is to find sequences (f n ) n of functions which are the product of a polynomial of degree < n and an easy computable second factor and such that (f n ) n converges essentially faster to f on K than the sequence (P n * ) n of best approximating polynomials of degree ≤ n. The resulting method, which we call Reduced Growth method (RG-method) is introduced in Section 2. In Section 5, numerical examples of the RG-method applied to the complex error function and to Bessel functions are given.

Accelerated polynomial approximation of finite order entire functions by growth reduction