首页> 外文期刊>Journal of Scientific Computing >The Relationships Between Chebyshev, Legendre and Jacobi Polynomials: The Generic Superiority of Chebyshev Polynomials and Three Important Exceptions
【24h】

The Relationships Between Chebyshev, Legendre and Jacobi Polynomials: The Generic Superiority of Chebyshev Polynomials and Three Important Exceptions

机译:Chebyshev,Legendre和Jacobi多项式之间的关系:Chebyshev多项式的一般优势和三个重要例外

获取原文
获取原文并翻译 | 示例
       

摘要

We analyze the asymptotic rates of convergence of Chebyshev, Legendre and Jacobi polynomials. One complication is that there are many reasonable measures of opti-mality as enumerated here. Another is that there are at least three exceptions to the general principle that Chebyshev polynomials give the fastest rate of convergence from the larger family of Jacobi polynomials. When f(x) is singular at one or both endpoints, all Gegenbauer polynomials (including Legendre and Chebyshev) converge equally fast at the endpoints, but Gegenbauer polynomials converge more rapidly on the interior with increasing order m. For functions on the surface of the sphere, associated Legendre functions, which are proportional to Gegenbauer polynomials, are best for the latitudinal dependence. Similarly, for functions on the unit disk, Zernike polynomials, which are Jacobi polynomials in radius, are superior in rate-of-convergence to a Chebyshev-Fourier series. It is true, as was conjectured by Lanczos 60 years ago, that excluding these exceptions, the Chebyshev coefficients a_n usually decrease faster than the Legendre coefficients b_n by a factor of √n. We calculate the proportionality constant for a few examples and restrictive classes of functions. The more precise claim that b_n ~ √π/2√na_n, made by Lanczos and later Fox and Parker, is true only for rather special functions. However, individual terms in the large n asymptotics of Chebyshev and Legendre coefficients usually do display this proportionality.
机译:我们分析了Chebyshev,Legendre和Jacobi多项式的收敛的渐近速率。一个复杂之处是,这里列举了许多合理的优化措施。另一个是一般原则的至少三个例外,即切比雪夫多项式比较大的雅可比多项式族提供最快的收敛速度。当f(x)在一个或两个端点处都是奇异时,所有Gegenbauer多项式(包括Legendre和Chebyshev)在端点处的收敛速度均相等,但是Gegenbauer多项式在内部的收敛速度更快,且阶次为m。对于球体表面上的函数,与Gegenbauer多项式成比例的相关Legendre函数最适合于纬度依赖性。同样,对于单位磁盘上的函数,半径为Jacobi多项式的Zernike多项式的收敛速度优于Chebyshev-Fourier级数。就像60年前Lanczos猜想的那样,确实是,除这些例外情况外,切比雪夫系数a_n的下降速度通常比勒让德利系数b_n下降√n倍。我们为一些示例和限制性类的函数计算比例常数。更精确的说法是,Lanczos和后来的Fox和Parker提出的b_n〜√π/2√na_n仅对相当特殊的函数才成立。但是,Chebyshev和Legendre系数的大n个渐近性中的单个项通常确实显示出这种比例性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号