In this paper we show that the function , () p fLI α ∈ ,0<p<1 where I=[-1,1] can be approximated by an algebraic polynomial with an error not exceeding , 1 ( , , ) kp ft n Ï• αω      where
,
1 ( , , ) kp ft n ϕ αω is the Ditizian–Totik modules of smoothness of unbounded function in , () p LI

In this paper, a simple fast lossless image compression method is introduced for compressing medical images, it is based on integrates multiresolution coding along with polynomial approximation of linear based to decompose image signal followed by efficient coding. The test results indicate that the suggested method can lead to promising performance due to flexibility in overcoming the limitations or restrictions of the model order length and extra overhead information required compared to traditional predictive coding techniques.

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.

The aim of this paper is to approximate multidimensional functions f∈C(R^s) by developing a new type of Feedforward neural networks (FFNS) which we called it Greedy ridge function neural networks (GRGFNNS). Also, we introduce a modification to the greedy algorithm which is used to train the greedy ridge function neural networks. An error bound are introduced in Sobolov space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result in [1]).

     The linear non-polynomial spline is used here to solve the fractional partial differential equation (FPDE). The fractional derivatives are described in the Caputo sense. The tensor products are given for extending the one-dimensional linear non-polynomial spline to a two-dimensional spline  to solve the heat equation. In this paper, the convergence theorem of the method used to the exact solution is proved and the numerical examples show the validity of the method. All computations are implemented by Mathcad15.

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.