The aim of this paper is to study the best approximation of unbounded functions in the
weighted spaces
,
1, 0 ,
p
p L α
α ≥>.
Key Words: Weighted space, unbounded functions, monotone approximation

This paper is concerned with introducing and studying the o-space by using out degree system (resp. i-space by using in degree system) which are the core concept in this paper. In addition, the m-lower approximations, the m-upper approximations and ospace and i-space. Furthermore, we introduce near supraopen (near supraclosed) d. g.'s. Finally, the supra-lower approximation, supraupper approximation, supra-accuracy are defined and some of its properties are investigated.

In this work,  an explicit formula for a class of Bi-Bazilevic univalent functions involving differential operator is given, as well as the determination of upper bounds for the general Taylor-Maclaurin coefficient of a functions belong to this class, are established Faber polynomials are used as a coordinated system to study the geometry of the manifold of coefficients for these functions. Also determining bounds for the first two coefficients of such functions.

         In certain cases, our initial estimates improve some of the coefficient bounds and link them to earlier thoughtful results that are published earlier.

The aim of this paper is to approximate multidimensional functions by using the type of Feedforward neural networks (FFNNs) which is called Greedy radial basis function neural networks (GRBFNNs). Also, we introduce a modification to the greedy algorithm which is used to train the greedy radial basis function neural networks. An error bound are introduced in Sobolev space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result is published in [16]).

The  purpose  of  the  paper  is  to  tind  the  degree  of  the approximation of a functions  f be bounded , measurable and defined

in  interval   [a,h]by  Bernstein  polynomial  in  LP    space  1 $ p < oo by

using Ditzian-Totik modulus  of smootlmess  and  k 1n  average modvlus of smoothness.

A method for Approximated evaluation of linear functional differential equations is described. where a function approximation as a linear combination of a set of orthogonal basis functions which are chebyshev functions .The coefficients of the approximation are determined by (least square and Galerkin’s) methods. The property of chebyshev polynomials leads to good results , which are demonstrated with examples.

In this study, an efficient compression system is introduced, it is based on using wavelet transform and two types of 3Dimension (3D) surface representations (i.e., Cubic Bezier Interpolation (CBI)) and 1 st order polynomial approximation. Each one is applied on different scales of the image; CBI is applied on the wide area of the image in order to prune the image components that show large scale variation, while the 1 st order polynomial is applied on the small area of residue component (i.e., after subtracting the cubic Bezier from the image) in order to prune the local smoothing components and getting better compression gain. Then, the produced cubic Bezier surface is subtracted from the image signal to get the residue component. Then, t

The purpose of this paper is to give some results theorems , propositions and corollaries concerning new algebraic systems flower , garden and farm with accustomed algebraic systems groupoid , group and ring.

In this paper we use non-polynomial spline functions to develop numerical methods to approximate the solution of 2nd kind Volterra integral equations. Numerical examples are presented to illustrate the applications of these method, and to compare the computed results with other known methods.