Permutable Chebyshev polynomials (T polynomials) defined over the field of real numbers are suitable for creating a Diffie-Hellman-like key exchange algorithm that is able to withstand attacks using quantum computers. The algorithm takes advantage of the commutative properties of Chebyshev polynomials of the first kind. We show how T polynomial values can be computed faster and how the underlyi...

The Chebyshev or L∞ estimator minimizes the maximum absolute residual and is useful in situations where the error distribution has bounded support. In this paper, we derive the asymptotic distribution of this estimator in cases where the error distribution has bounded and unbounded support. We also consider the asymptotics of set-membership estimators such as the Chebyshev centre and maximum in...

In [M.M. Hosseini, Adomian decomposition method with Chebyshev polynomials, Appl. Math. Comput., in press] an efficient modification of the Adomian decomposition method was presented by using Chebyshev polynomials. Also, in [M.M. Hosseini, Adomian decomposition method for solution of differential algebraic equations, J. Comput. Appl. Math., in press] solution of linear differential algebraic eq...

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...

We study Chebyshev filter diagonalization as a tool for the computation of many interior eigenvalues of very large sparse symmetric matrices. In this technique the subspace projection onto the target space of wanted eigenvectors is approximated with high-order filter polynomials obtained from a regularized Chebyshev expansion of a window function. After a short discussion of the conceptual foun...