We study the problem of reconstructing a sparse polynomial in a basis of Chebyshev polynomials (Chebyshev basis in short) from given samples on a Chebyshev grid of [−1, 1]. A polynomial is called M -sparse in a Chebyshev basis, if it can be represented by a linear combination of M Chebyshev polynomials. For a polynomial with known and unknown Chebyshev sparsity, respectively, we present efficie...

the purpose of this study is to present an approximate numerical method for solving high order linear fredholm-volterra integro-differential equations in terms of rational chebyshev functions under the mixed conditions. the method is based on the approximation by the truncated rational chebyshev series. finally, the effectiveness of the method is illustrated in several numerical examples. the p...

in this paper, a chebyshev finite difference method has been proposed in order to solvenonlinear two-point boundary value problems for second order nonlinear differentialequations. a problem arising from chemical reactor theory is then considered. the approachconsists of reducing the problem to a set of algebraic equations. this method can be regardedas a non-uniform finite difference scheme. t...

It is well known that the numerical solution of stiff stochastic ordinary differential equations leads to a step size reduction when explicit methods are used. This has led to a plethora of implicit or semi-implicit methods with a wide variety of stability properties. However, for stiff stochastic problems in which the eigenvalues of a drift term lie near the negative real axis, such as those a...

We show that Chebyshev Polynomials are a practical representation of computable functions on the computable reals. The paper presents error estimates for common operations and demonstrates that Chebyshev Polynomial methods would be more efficient than Taylor Series methods for evaluation of transcendental functions. Keywords—Approximation Theory, Chebyshev Polynomial, Computable Functions, Comp...