In this paper Chebyshev wavelet and their properties are employed for deriving Chebyshev wavelet operational matrix of fractional derivatives and a general procedure for forming this matrix is introduced. Then Chebyshev wavelet expansion along with this operational matrix are used for numerical solution of Bagley-Torvik boundary value problems. The error analysis and convergence properties of t...

A weighted orthogonal system on the half-line based on the Chebyshev rational functions is introduced. Basic results on Chebyshev rational approximations of several orthogonal projections and interpolations are established. To illustrate the potential of the Chebyshev rational spectral method, a model problem is considered both theoretically and numerically: error estimates for the Chebyshev ra...

Odd degree Chebyshev polynomials over a ring of modulo 2 have two kinds of period. One is an “orbital period”. Odd degree Chebyshev polynomials are bijection over the ring. Therefore, when an odd degree Chebyshev polynomial iterate affecting a factor of the ring, we can observe an orbit over the ring. The “ orbital period ” is a period of the orbit. The other is a “degree period”. It is observe...

In this paper, we propose a method to approximate the solution of a linear Fredholm integro-differential equation by using the Chebyshev wavelet of the first kind as basis. For this purpose, we introduce the first Chebyshev operational matrix of integration. Chebyshev wavelet approximating method is then utilized to reduce the integro-differential equation to a system of algebraic equations. Il...

In this paper, a Chebyshev polynomial approximation for the solution of second-order partial differential equations with two variables and variable coefficients is given. Also, Chebyshev matrix is introduced. This method is based on taking the truncated Chebyshev expansions of the functions in the partial differential equations. Hence, the result matrix equation can be solved and approximate va...

The recurrent least squares (RLS) learning approach is proposed for controlling the learning rate in parallel principal subspace analysis (PSA) and in a wide class of principal component analysis (PCA) associated algorithms with a quasi{parallel extraction ability. The purpose is to provide a useful tool for applications where the learning process has to be repeated in an on{line self{adaptive ...

Computing quark propagators in lattice QCD is equivalent to solving large, sparse linear systems with multiple right-hand sides. Block algorithms attempt to accelerate the convergence of iterative Krylov-subspace methods by solving the multiple systems simultaneously. This paper compares a block generalisation of the quasi-minimal residual method (QMR), Block Conjugate Gradient on the normal eq...

A Chebyshev knot C(a, b, c, φ) is a knot which has a parametrization of the form x(t) = Ta(t); y(t) = Tb(t); z(t) = Tc(t + φ), where a, b, c are integers, Tn(t) is the Chebyshev polynomial of degree n and φ ∈ R. We show that any two-bridge knot is a Chebyshev knot with a = 3 and also with a = 4. For every a, b, c integers (a = 3, 4 and a, b coprime), we describe an algorithm that gives all Cheb...