In this paper, a new third kind Chebyshev wavelets operational matrix of derivative is presented, then the operational matrix of derivative is applied for solving optimal control problems using, third kind Chebyshev wavelets expansions. The proposed method consists of reducing the linear system of optimal control problem into a system of algebraic equations, by expanding the state variables, as a series in terms of third kind Chebyshev wavelets with unknown coefficients. Example to illustrate the effectiveness of the method has been presented.

This paper is concerned with introducing and studying the first new approximation operators using mixed degree system and second new approximation operators using mixed degree system which are the core concept in this paper. In addition, the approximations of graphs using the operators first lower and first upper are accurate then the approximations obtained by using the operators second lower and second upper sincefirst accuracy less then second accuracy. For this reason, we study in detail the properties of second lower and second upper in this paper. Furthermore, we summarize the results for the properties of approximation operators second lower and second upper when the graph G is arbitrary, serial 1, serial 2, reflexive, symmetric, tra

In 2010, Long and Zeng introduced a new generalization of the Bernstein polynomials that depends on a parameter  and called -Bernstein polynomials. After that, in 2018, Lain and Zhou studied the uniform convergence for these -polynomials and obtained a Voronovaskaja-type asymptotic formula in ordinary approximation. This paper studies the convergence theorem and gives two Voronovaskaja-type asymptotic formulas of the sequence of -Bernstein polynomials in both ordinary and simultaneous approximations. For this purpose, we discuss the possibility of finding the recurrence relations of the -th order moment for these polynomials and evaluate the values of -Bernstein for the functions ,  is a non-negative integer

This paper discusses the problem of decoding codeword in Reed- Muller Codes. We will use the Hadamard matrices as a method to decode codeword in Reed- Muller codes.In addition Reed- Muller Codes are defined and encoding matrices are discussed. Finally, a method of decoding is explained and an example is given to clarify this method, as well as, this method is compared with the classical method which is called Hamming distance.

In this paper, a method based on modified adomian decomposition method for solving Seventh order integro-differential equations (MADM). The distinctive feature of the method is that it can be used to find the analytic solution without transformation of boundary value problems. To test the efficiency of the method presented two examples are solved by proposed method.

In this work, we employ a new normalization Bernstein basis for solving linear Freadholm of fractional integro-differential equations  nonhomogeneous  of the second type (LFFIDE_s). We adopt Petrov-Galerkian method (PGM) to approximate solution of the (LFFIDE_s) via normalization Bernstein basis that yields linear system. Some examples are given and their results are shown in tables and figures, the Petrov-Galerkian method (PGM) is very effective and convenient and overcome the difficulty of traditional methods. We solve this problem (LFFIDE_s) by the assistance of Matlab10.