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.
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
Let be a connected graph with vertices set and edges set . The ordinary distance between any two vertices of is a mapping from into a nonnegative integer number such that is the length of a shortest path. The maximum distance between two subsets and of is the maximum distance between any two vertices and such that belong to and belong to . In this paper, we take a special case of maximum distance when consists of one vertex and consists of vertices, . This distance is defined by: where is the order of a graph .
In this paper, we defined – polynomials based on
... Show MoreHere, we found an estimation of best approximation of unbounded functions which satisfied weighted Lipschitz condition with respect to convex polynomial by means of weighted Totik-Ditzian modulus of continuity
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.
This paper examines a new nonlinear system of multiple integro-differential equations containing symmetric matrices with impulsive actions. The numerical-analytic method of ordinary differential equations and Banach fixed point theorem are used to study the existence, uniqueness and stability of periodic solutions of impulsive integro-differential equations with piecewise continuous functions. This study is based on the Hölder condition in which the ordering , and are real numbers between 0 and 1.
This research focuses on the services provided by news websites (IMN, Youm7, Huffington Post Arabic) to its audience of Internet users, as well as materials posted through its pages, trying to monitor and explain them to identify their types & features, and it›s functions, whether informational or non-informational, to know the technical potential of each of the news sites, with the entry of the latest technology information. The research used the analysis method to achieve the research objectives within the period from 1/1 to 31/1/2017. The researchers used the content analysis tool as a research tool to analyze the news sites and to know the services they provide through their pages. The research was divided into three parts, the
... Show MoreThe Detour distance is one of the most common distance types used in chemistry and computer networks today. Therefore, in this paper, the detour polynomials and detour indices of vertices identified of n-graphs which are connected to themselves and separated from each other with respect to the vertices for n≥3 will be obtained. Also, polynomials detour and detour indices will be found for another graphs which have important applications in Chemistry.