{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T21:54:43Z","timestamp":1776722083549,"version":"3.51.2"},"reference-count":31,"publisher":"American Mathematical Society (AMS)","issue":"218","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Comp."],"abstract":"<p>\n                    Let\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"f\">\n                        <mml:semantics>\n                          <mml:mi>f<\/mml:mi>\n                          <mml:annotation encoding=\"application\/x-tex\">f<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    be an entire function of positive order and finite type. The subject of this note is the convergence acceleration of polynomial approximants of\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"f\">\n                        <mml:semantics>\n                          <mml:mi>f<\/mml:mi>\n                          <mml:annotation encoding=\"application\/x-tex\">f<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    by incorporating information about the growth of\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"f left-parenthesis z right-parenthesis\">\n                        <mml:semantics>\n                          <mml:mrow>\n                            <mml:mi>f<\/mml:mi>\n                            <mml:mo stretchy=\"false\">(<\/mml:mo>\n                            <mml:mi>z<\/mml:mi>\n                            <mml:mo stretchy=\"false\">)<\/mml:mo>\n                          <\/mml:mrow>\n                          <mml:annotation encoding=\"application\/x-tex\">f(z)<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    for\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"z right-arrow normal infinity\">\n                        <mml:semantics>\n                          <mml:mrow>\n                            <mml:mi>z<\/mml:mi>\n                            <mml:mo stretchy=\"false\">\n                              \u2192\n                              \n                            <\/mml:mo>\n                            <mml:mi mathvariant=\"normal\">\n                              \u221e\n                              \n                            <\/mml:mi>\n                          <\/mml:mrow>\n                          <mml:annotation encoding=\"application\/x-tex\">z\\to \\infty<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    . We consider \u201cnear polynomial approximation\u201d on a compact plane set\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"upper K\">\n                        <mml:semantics>\n                          <mml:mi>K<\/mml:mi>\n                          <mml:annotation encoding=\"application\/x-tex\">K<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    , which should be thought of as a circle or a real interval. Our aim is to find sequences\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"left-parenthesis f Subscript n Baseline right-parenthesis Subscript n\">\n                        <mml:semantics>\n                          <mml:mrow>\n                            <mml:mo stretchy=\"false\">(<\/mml:mo>\n                            <mml:msub>\n                              <mml:mi>f<\/mml:mi>\n                              <mml:mi>n<\/mml:mi>\n                            <\/mml:msub>\n                            <mml:msub>\n                              <mml:mo stretchy=\"false\">)<\/mml:mo>\n                              <mml:mi>n<\/mml:mi>\n                            <\/mml:msub>\n                          <\/mml:mrow>\n                          <mml:annotation encoding=\"application\/x-tex\">(f_n)_n<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    of functions which are the product of a polynomial of degree\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"less-than-or-equal-to n\">\n                        <mml:semantics>\n                          <mml:mrow>\n                            <mml:mo>\n                              \u2264\n                              \n                            <\/mml:mo>\n                            <mml:mi>n<\/mml:mi>\n                          <\/mml:mrow>\n                          <mml:annotation encoding=\"application\/x-tex\">\\le n<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    and an \u201ceasy computable\u201d second factor and such that\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"left-parenthesis f Subscript n Baseline right-parenthesis Subscript n\">\n                        <mml:semantics>\n                          <mml:mrow>\n                            <mml:mo stretchy=\"false\">(<\/mml:mo>\n                            <mml:msub>\n                              <mml:mi>f<\/mml:mi>\n                              <mml:mi>n<\/mml:mi>\n                            <\/mml:msub>\n                            <mml:msub>\n                              <mml:mo stretchy=\"false\">)<\/mml:mo>\n                              <mml:mi>n<\/mml:mi>\n                            <\/mml:msub>\n                          <\/mml:mrow>\n                          <mml:annotation encoding=\"application\/x-tex\">(f_n)_n<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    converges essentially faster to\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"f\">\n                        <mml:semantics>\n                          <mml:mi>f<\/mml:mi>\n                          <mml:annotation encoding=\"application\/x-tex\">f<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    on\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"upper K\">\n                        <mml:semantics>\n                          <mml:mi>K<\/mml:mi>\n                          <mml:annotation encoding=\"application\/x-tex\">K<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    than the sequence\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"left-parenthesis upper P Subscript n Superscript asterisk Baseline right-parenthesis Subscript n\">\n                        <mml:semantics>\n                          <mml:mrow>\n                            <mml:mo stretchy=\"false\">(<\/mml:mo>\n                            <mml:msubsup>\n                              <mml:mi>P<\/mml:mi>\n                              <mml:mi>n<\/mml:mi>\n                              <mml:mo>\n                                \u2217\n                                \n                              <\/mml:mo>\n                            <\/mml:msubsup>\n                            <mml:msub>\n                              <mml:mo stretchy=\"false\">)<\/mml:mo>\n                              <mml:mi>n<\/mml:mi>\n                            <\/mml:msub>\n                          <\/mml:mrow>\n                          <mml:annotation encoding=\"application\/x-tex\">(P_n^*)_n<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    of best approximating polynomials of degree\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"less-than-or-equal-to n\">\n                        <mml:semantics>\n                          <mml:mrow>\n                            <mml:mo>\n                              \u2264\n                              \n                            <\/mml:mo>\n                            <mml:mi>n<\/mml:mi>\n                          <\/mml:mrow>\n                          <mml:annotation encoding=\"application\/x-tex\">\\le n<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    . The resulting method, which we call Reduced Growth method (\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"upper R upper G\">\n                        <mml:semantics>\n                          <mml:mrow>\n                            <mml:mi>R<\/mml:mi>\n                            <mml:mi>G<\/mml:mi>\n                          <\/mml:mrow>\n                          <mml:annotation encoding=\"application\/x-tex\">RG<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    -method) is introduced in Section\u00a02. In Section\u00a05, numerical examples of the\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"upper R upper G\">\n                        <mml:semantics>\n                          <mml:mrow>\n                            <mml:mi>R<\/mml:mi>\n                            <mml:mi>G<\/mml:mi>\n                          <\/mml:mrow>\n                          <mml:annotation encoding=\"application\/x-tex\">RG<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    -method applied to the complex error function and to Bessel functions are given.\n                  <\/p>","DOI":"10.1090\/s0025-5718-97-00832-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T18:13:53Z","timestamp":1027707233000},"page":"743-761","source":"Crossref","is-referenced-by-count":5,"title":["Accelerated polynomial approximation of finite order entire functions by growth reduction"],"prefix":"10.1090","volume":"66","author":[{"given":"J\u00fcrgen","family":"M\u00fcller","sequence":"first","affiliation":[]}],"member":"14","published-online":{"date-parts":[[1997]]},"reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"Amos, D.E., A portable package for Bessel functions of a complex argument and nonnegative order, ACM Trans. Math. Softw., 12 (1986), 265-273","DOI":"10.1145\/7921.214331"},{"key":"2","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-8445-8","volume-title":"Complex analysis and special topics in harmonic analysis","author":"Berenstein, Carlos A.","year":"1995","ISBN":"https:\/\/id.crossref.org\/isbn\/0387944117"},{"key":"3","volume-title":"Introduction to approximation theory","author":"Cheney, E. W.","year":"1966"},{"issue":"209","key":"4","doi-asserted-by":"publisher","first-page":"181","DOI":"10.2307\/2153328","article-title":"The Faber polynomials for annular sectors","volume":"64","author":"Coleman, John P.","year":"1995","journal-title":"Math. Comp.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5718","issn-type":"print"},{"issue":"162","key":"5","doi-asserted-by":"publisher","first-page":"575","DOI":"10.2307\/2007534","article-title":"Computation of Faber series with application to numerical polynomial approximation in the complex plane","volume":"40","author":"Ellacott, S. W.","year":"1983","journal-title":"Math. Comp.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5718","issn-type":"print"},{"key":"6","doi-asserted-by":"publisher","first-page":"398","DOI":"10.2307\/2003242","article-title":"Truncation errors in Pad\u00e9 approximations to certain functions: An alternative approach","volume":"21","author":"Elliott, David","year":"1967","journal-title":"Math. Comp.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5718","issn-type":"print"},{"issue":"3","key":"7","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/BF01390184","article-title":"On two methods for accelerating convergence of series","volume":"43","author":"Gabutti, Bruno","year":"1984","journal-title":"Numer. Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0029-599X","issn-type":"print"},{"issue":"160","key":"8","doi-asserted-by":"publisher","first-page":"587","DOI":"10.2307\/2007336","article-title":"An acceleration method for the power series of entire functions of order 1","volume":"39","author":"Gabutti, B.","year":"1982","journal-title":"Math. Comp.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5718","issn-type":"print"},{"key":"9","volume-title":"{\\cyr Lektsii po teorii approksimatsii v kompleksno\\u{i}} {\\cyr oblasti}","author":"Ga\u012der, D.","year":"1986"},{"issue":"197","key":"10","doi-asserted-by":"publisher","first-page":"241","DOI":"10.2307\/2153031","article-title":"Explicit Faber polynomials on circular sectors","volume":"58","author":"Gatermann, Karin","year":"1992","journal-title":"Math. Comp.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5718","issn-type":"print"},{"key":"11","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1137\/0707012","article-title":"Efficient computation of the complex error function","volume":"7","author":"Gautschi, Walter","year":"1970","journal-title":"SIAM J. Numer. Anal.","ISSN":"https:\/\/id.crossref.org\/issn\/0036-1429","issn-type":"print"},{"issue":"6","key":"12","doi-asserted-by":"publisher","first-page":"1225","DOI":"10.1137\/0715083","article-title":"Near-minimax polynomial approximation in an elliptical region","volume":"15","author":"Geddes, K. O.","year":"1978","journal-title":"SIAM J. Numer. Anal.","ISSN":"https:\/\/id.crossref.org\/issn\/0036-1429","issn-type":"print"},{"key":"13","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1137\/0712011","article-title":"Polynomial approximation by projections on the unit circle","volume":"12","author":"Geddes, K. O.","year":"1975","journal-title":"SIAM J. Numer. Anal.","ISSN":"https:\/\/id.crossref.org\/issn\/0036-1429","issn-type":"print"},{"key":"14","series-title":"Wiley Classics Library","isbn-type":"print","volume-title":"Applied and computational complex analysis. Vol. 2","author":"Henrici, Peter","year":"1991","ISBN":"https:\/\/id.crossref.org\/isbn\/047154289X"},{"key":"15","series-title":"Teubner Studienb\\\"{u}cher Mathematik. [Teubner Mathematical Textbooks]","isbn-type":"print","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-93108-5","volume-title":"Numerische Methoden der Approximation und semi-infiniten Optimierung","author":"Hettich, Rainer","year":"1982","ISBN":"https:\/\/id.crossref.org\/isbn\/3519020637"},{"key":"16","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/0377-0427(85)90034-2","article-title":"On the computation of incomplete gamma functions in the complex domain","volume":"12\/13","author":"Jones, William B.","year":"1985","journal-title":"J. Comput. Appl. Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0377-0427","issn-type":"print"},{"key":"17","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01112450","article-title":"On Faber polynomials and Faber expansions","volume":"99","author":"K\u00f6vari, T.","year":"1967","journal-title":"Math. Z.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5874","issn-type":"print"},{"key":"18","unstructured":"Lewin, B.J., Distribution of zeros of entire functions, Amer. Math. Soc., 1964."},{"key":"19","doi-asserted-by":"crossref","unstructured":"Lyness, J.N., Sande, G., Algorithm 413, Evaluation of normalized Taylor coefficients of an analytic function, Comm. ACM, 14 (1971), 669-675.","DOI":"10.1145\/362759.362820"},{"key":"20","volume-title":"Theory of functions of a complex variable. Vol. I, II, III","author":"Markushevich, A. I.","year":"1977","edition":"2"},{"key":"21","unstructured":"M\u00fcller, J., Convergence acceleration of polynomial expansions for finite order entire functions, Habilitationsschrift, Trier 1995."},{"key":"22","unstructured":"M\u00fcller, J., Convergence acceleration of Taylor sections for finite order entire functions, submitted."},{"issue":"1","key":"23","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/77626.77629","article-title":"More efficient computation of the complex error function","volume":"16","author":"Poppe, G. P. M.","year":"1990","journal-title":"ACM Trans. Math. Software","ISSN":"https:\/\/id.crossref.org\/issn\/0098-3500","issn-type":"print"},{"key":"24","first-page":"429","article-title":"The degree of convergence for entire functions","volume":"38","author":"Rice, John R.","year":"1971","journal-title":"Duke Math. J.","ISSN":"https:\/\/id.crossref.org\/issn\/0012-7094","issn-type":"print"},{"key":"25","series-title":"Pure and Applied Mathematics","volume-title":"The Chebyshev polynomials","author":"Rivlin, Theodore J.","year":"1974"},{"key":"26","volume-title":"Software for numerical mathematics","year":"1974"},{"issue":"3","key":"27","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/BF01214898","article-title":"Exceptional values of solutions of linear differential equations","volume":"201","author":"Steinmetz, Norbert","year":"1989","journal-title":"Math. Z.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5874","issn-type":"print"},{"key":"28","isbn-type":"print","volume-title":"Mathematical software for the P.C. and work stations","year":"1994","ISBN":"https:\/\/id.crossref.org\/isbn\/0444820000"},{"issue":"5","key":"29","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1137\/0731077","article-title":"Computation of the complex error function","volume":"31","author":"Weideman, J. A. C.","year":"1994","journal-title":"SIAM J. Numer. Anal.","ISSN":"https:\/\/id.crossref.org\/issn\/0036-1429","issn-type":"print"},{"issue":"5","key":"30","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/BF01400358","article-title":"Accelerating the convergence of power series of certain entire functions","volume":"51","author":"Wild, Paul","year":"1987","journal-title":"Numer. Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0029-599X","issn-type":"print"},{"key":"31","doi-asserted-by":"publisher","first-page":"259","DOI":"10.4064\/ap-23-3-259-273","article-title":"Approximation and interpolation of entire functions","volume":"23","author":"Winiarski, T.","year":"1970","journal-title":"Ann. Polon. Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0066-2216","issn-type":"print"}],"container-title":["Mathematics of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.ams.org\/mcom\/1997-66-218\/S0025-5718-97-00832-6\/S0025-5718-97-00832-6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/www.ams.org\/mcom\/1997-66-218\/S0025-5718-97-00832-6\/S0025-5718-97-00832-6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T21:27:20Z","timestamp":1776720440000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ams.org\/mcom\/1997-66-218\/S0025-5718-97-00832-6\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"references-count":31,"journal-issue":{"issue":"218","published-print":{"date-parts":[[1997,4]]}},"alternative-id":["S0025-5718-97-00832-6"],"URL":"https:\/\/doi.org\/10.1090\/s0025-5718-97-00832-6","archive":["CLOCKSS","Portico"],"relation":{},"ISSN":["1088-6842","0025-5718"],"issn-type":[{"value":"1088-6842","type":"electronic"},{"value":"0025-5718","type":"print"}],"subject":[],"published":{"date-parts":[[1997]]}}}