Laurent–Padé Approximants to Four Kinds of Chebyshev Polynomial Expansions. Part I. Maehly Type Approximants

Laurent Padé–Chebyshev rational approximants, A _m (z,z ^–1)/B _n (z,z ^–1), whose Laurent series expansions match that of a given function f(z,z ^–1) up to as high a degree in z,z ^–1 as possible, were introduced for first kind Chebyshev polynomials by Clenshaw and Lord [2] and, using Laurent series, by Gragg and Johnson [4]. Further real and complex extensions, based mainly on trigonometric expansions, were discussed by Chisholm and Common [1]. All of these methods require knowledge of Chebyshev coefficients of f up to degree m+n. Earlier, Maehly [5] introduced Padé approximants of the same form, which matched expansions between f(z,z ^–1)B _n (z,z ^–1) and A _m (z,z ^–1). The derivation was relatively simple but required knowledge of Chebyshev coefficients of f up to degree m+2n. In the present paper, Padé–Chebyshev approximants are developed not only to first, but also to second, third and fourth kind Chebyshev polynomial series, based throughout on Laurent series representations of the Maehly type. The procedures for developing the Padé–Chebyshev coefficients are similar to that for a traditional Padé approximant based on power series [8] but with essential modifications. By equating series coefficients and combining equations appropriately, a linear system of equations is successfully developed into two sub-systems, one for determining the denominator coefficients only and one for explicitly defining the numerator coefficients in terms of the denominator coefficients. In all cases, a type (m,n) Padé–Chebyshev approximant, of degree m in the numerator and n in the denominator, is matched to the Chebyshev series up to terms of degree m+n, based on knowledge of the Chebyshev coefficients up to degree m+2n. Numerical tests are carried out on all four Padé–Chebyshev approximants, and results are outstanding, with some formidable improvements being achieved over partial sums of Laurent–Chebyshev series on a variety of functions. In part II of this paper [7] Padé–Chebyshev approximants of Clenshaw–Lord type will be developed for the four kinds of Chebyshev series and compared with those of the Maehly type.     

一些包含Lucas数的恒等式

利用第一类Chebyshev多项式的性质以及其与Lucas数的关系得到了关于Lucas数立方的一些恒等式.     

Two new examples of sets without medians and centers

Many problems in continuous location theory, reduce to finding a best location, in the sense that a facility must be located at a point minimizing the sum of distances to the points of a given finite set (median) or the largest distances to all points (center). The setting is often assumed to be a Banach space. To have a better understanding concerning the structure of location problems, it may occur also in rather simple cases. In this paper we indicate two simple examples of four-point sets such that one of the two problems indicated has a solution, while the other one has no solution. Also, we list papers containing examples previously given, dealing with this lack of optimal solutions.     

Laurent-Padé approximants to four kinds of Chebyshev polynomial expansions. Part II: Clenshaw-Lord type approximants

Laurent-Padé (Chebyshev) rational approximantsP _m (w, w ⁻¹)/Q _n (w, w ⁻¹) of Clenshaw-Lord type [2,1] are defined, such that the Laurent series ofP _m /Q _n matches that of a given functionf(w, w ⁻¹) up to terms of orderw ^±(m+n) , based only on knowledge of the Laurent series coefficients off up to terms inw ^±(m+n) . This contrasts with the Maehly-type approximants [4,5] defined and computed in part I of this paper [6], where the Laurent series ofP _m matches that ofQ _n f up to terms of orderw ^±(m+n ), but based on knowledge of the series coefficients off up to terms inw ^±(m+2n). The Clenshaw-Lord method is here extended to be applicable to Chebyshev polynomials of the 1st, 2nd, 3rd and 4th kinds and corresponding rational approximants and Laurent series, and efficient systems of linear equations for the determination of the Padé-Chebyshev coefficients are obtained in each case. Using the Laurent approach of Gragg and Johnson [4], approximations are obtainable for allm≥0,n≥0. Numerical results are obtained for all four kinds of Chebyshev polynomials and Padé-Chebyshev approximants. Remarkably similar results of formidable accuracy are obtained by both Maehly-type and Clenshaw-Lord type methods, thus validating the use of either.     

Numerical Approximation of the Spectra of Phan-Thien Tanner Liquids

The linear stability of the linear Phan-Thien Tanner (PTT) fluid model is investigated for plane Poiseuille flow. The PTT model involves parameters that can be used to fit shear and extensional data, which makes it suitable for describing both polymer solutions and melts. The base flow is determined using a Chebyshev-tau method. The linear stability equations are also discretized using Chebyshev approximations to furnish a generalized eigenvalue problem. The spectrum is shown to comprise a continuous part and a discrete part. The theoretical and numerical results are validated for the UCM and Oldroyd-B models, which are special cases of the PTT model, by comparing with results in the literature. It is demonstrated that the linear PTT fluid is stable to infinitesimal disturbances with respect to the range of shear-thinning, extensional and elasticity parameters considered. The computational efficiency and accuracy of the numerical method are also investigated.     

｜x｜^α的Lagrange插值多项式在零点的收敛速度

S.M.Lozinskii指出了函数｜x｜基于等距节点的Lagrange插值多项式在零点的收敛速度.2000年,M.Revers把S.M.Lozinskii的结果推广到｜x｜~α(0<α1).本文考虑的是把等距节点改为修改的Chebyshev节点,从而把零点处的收敛速度从M.Revers证明的O(n-α)提高O(n-2α).     

第一类双变量Chebyshev多项式的最小零偏差性质研究

利用Rivlin和Shapiro提出的符号理论,证明了文献[10]中提出的第一类双变量Chebyshev多项式恰为所谓的Steiner区域上具有特殊首项的最小零偏差多项式,并由此导出了几类具有一定代数精度的数值积分公式.     

Spectral radial basis functions for full sphere computations

The singularity of cylindrical or spherical coordinate systems at the origin imposes certain regularity conditions on the spectral expansion of any infinitely differentiable function. There are two efficient choices of a set of radial basis functions suitable for discretising the solution of a partial differential equation posed in either such geometry. One choice is methods based on standard Chebyshev polynomials; although these may be efficiently computed using fast transforms, differentiability to all orders of the obtained solution at the origin is not guaranteed. The second is the so-called one-sided Jacobi polynomials that explicitly satisfy the required behavioural conditions. In this paper, we compare these two approaches in their accuracy, differentiability and computational speed. We find that the most accurate and concise representation is in terms of one-sided Jacobi polynomials. However, due to the lack of a competitive fast transform, Chebyshev methods may be a better choice for some computationally intensive timestepping problems and indeed will yield sufficiently (although not infinitely) differentiable solutions provided they are adequately converged.     

A Numerical Approach of the sentinel method for distributed parameter systems

In this paper we consider the problem of detecting pollution in some non linear parabolic systems using the sentinel method. For this purpose we develop and analyze a new approach to the discretization which pays careful attention to the stability of the solution. To illustrate convergence properties we give some numerical results that present good properties and show new ways for building discrete sentinels.      

含有界随机参数的双势阱Duffing-van der Pol系统的倍周期分岔

讨论简谐激励作用下含有界随机参数的双势阱Duffing-van der Pol系统的倍周期分岔现象.首先用Chebyshev 多项式逼近法将随机Duffing-van der Pol系统化成与其等价的确定性系统，然后通过等价确定性系统来探索该系统的倍周期分岔现象.数值模拟显示随机Duffing-van der Pol 系统与均值参数系统有着类似的倍周期分岔行为，同时指出，随机参数系统的倍周期分岔有其自身独有的特点.文中的主要数值结果表明Chebyshev 多项式逼近法是研究非线性随机参数系统动力学问题的一种有效方法. 关键词： Chebyshev多项式 随机Duffing-van der Pol系统 倍周期分岔