The master equation described by Badri Krishnan et al. [1] for the time-frequency pattern using the F-statistic is studied in context of the Chebyshev polynomial modified spindown parameters for the case of gravitational wave (GW) pulsar signals. The Chebyshev polynomial method enables an analytic and numeric evaluation of the Fourier transform (FT) for both the non-demodulated and F-statistic ...

In this paper, we introduce a generalized Chebyshev collocation method (GCCM) based on the generalized Chebyshev polynomials for solving stiff systems. For employing a technique of the embedded Runge-Kutta method used in explicit schemes, the property of the generalized Chebyshev polynomials is used, in which the nodes for the higher degree polynomial are overlapped with those for the lower deg...

Based on reproducing kernel theory, an effective numerical technique is proposed for solving second order linear two-point boundary value problems with deviating argument. In this method, reproducing kernels with Chebyshev polynomial form are used (C-RKM). The convergence and an error estimation of the method are discussed. The efficiency and the accuracy of the method is demonstrated on some n...

8 In his paper " Lagrange interpolation on Chebyshev points of two variables " (J. 9 220–238), Y. Xu proposed a set of Chebyshev like points for polynomial interpolation in the square 10 [−1, 1] 2 , and derived a compact form of the corresponding Lagrange interpolation formula. We inves-11 tigate computational aspects of the Xu polynomial interpolation formula like numerical stability and 12 ef...

In this paper a new approach for reducing the side lobe level of amplitude tapered linear array using Chebyshev polynomial and Particle Swarm Optimization (PSO) is presented. The array geometry synthesis is first formulated as an optimization problem with the goal of side lobe level reduction and then solved using PSO algorithm for optimum current excitations. While solving optimization problem...

Hough functions are the eigenfunctions of the Laplace tidal equation governing fluid motion on a rotating sphere with a resting basic state. Several numerical methods have been used in the past. In this paper, we compare two of those methods: normalized associated Legendre polynomial expansion and Chebyshev collocation. Both methods are not widely used, but both have some advantages over the co...

The algebraic polynomial interpolation on uniformly distributed nodes is affected by the Runge phenomenon, also when the function to be interpolated is analytic. Among all techniques that have been proposed to defeat this phenomenon, there is the mock-Chebyshev interpolation which is an interpolation made on a subset of the given nodes which elements mimic as well as possible the Chebyshev-Loba...

We consider the evaluation of a recent generalization of the Epstein-Hubbell elliptic-type integral using the tau method approximation with a Chebyshev polynomial basis. This also leads to an approximation of Lauricella’s hypergeometric function of three variables. Numerical results are given for polynomial approximations of degree 6.

This paper improves error bounds for Gauss, Clenshaw-Curtis and Fejér’s first quadrature by using new error estimates for polynomial interpolation in Chebyshev points. We also derive convergence rates of Chebyshev interpolation polynomials of the first and second kind for numerical evaluation of highly oscillatory integrals. Preliminary numerical results show that the improved error bounds are ...

Caution: These polynomials are referred to as w0, w1, w2, ... in Sections 5-8 of [1]. However, beginning with Section 9 of [1], Hazewinkel uses the notations w1, w2, w3, ... for some different polynomials (the so-called big Witt polynomials, defined by formula (9.25) in [1]), which are not the same as our polynomials w1, w2, w3, ... (though they are related to them: in fact, the polynomial wk t...