Based on analyzing the properties of Bernstein polynomials, the extended orthonormal Bernstein polynomials, defined on the interval [0, 1] for n=7 is achieved. Another method for computing operational matrices of derivative and integration D_b and R_(n+1)^B respectively is presented. Also the result of the proposed method is compared with true answers to show the convergence and advantages of the new method.
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
... Show MoreThis 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.
The sol-gel preparation technique of transparent silica monoliths containing up to 0.5 M of samarium have been described. The sol-gel processing parameters are: acid catalyzed hydrolysis and controlled drying. The prepared monoliths are analyzed by X-ray diffraction, pycnometer measurements, Fourier transformation infrared spectroscopy and optical spectroscopy. The oscillator strengths of the Sm3+ ions in the silica monoliths are calculated. The results show a linear concentration dependence of some Sm3+ transitions in UV/Vis absorption spectra and formation of Sm3+ clusters inside the pores structure of silica monoliths at high Sm3+ concentration
A graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense related. The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of vertices is called an edge (also called link or line). A directed graph is a graph in which edges have orientation. A simple graph is a graph that does not have more than one edge between any two vertices and no edge starts and ends at the same vertex. For a simple undirected graph G with order n, and let denotes its complement. Let δ(G), ∆(G) denotes the minimum degree and maximum degree of G respectively. The complement degree polynomial of G is the polynomial CD[G,x]= , where C
... Show MoreThe main objective of this paper is to find the order and its exponent, the general form of all conjugacy classes, Artin characters table and Artin exponent for the group of lower unitriangular matrices L(3,? p ), where p is prime number.