The first step in this research is to find some of the necessary estimations in approximation by using certain algebraic polynomials, as well as we use certain specific points in approximation. There are many estimations that help to find the best approximation using algebraic polynomials and geometric polynomials. Throughout this research, we deal with some of these estimations to estimate the best approximation error using algebraic polynomials where the basic estimations in approximation are discussed and proven using algebraic polynomials that are discussed and proven using algebraic polynomials that are specified by the following points and  if   as well as if   .

  For the second step of the work, the estimatio

     The focus of this article is to add a new class of rank one of  modified Quasi-Newton techniques to solve the problem of unconstrained optimization by updating the inverse Hessian matrix with an update of rank 1, where a diagonal matrix is the first component of the next inverse Hessian approximation, The inverse Hessian matrix is  generated by the method proposed which is symmetric and it satisfies the condition of modified quasi-Newton, so the global convergence is retained. In addition, it is positive definite that  guarantees the existence of the minimizer at every iteration of the objective function. We use  the program MATLAB to solve an algorithm function to introduce the feasibility of

In this work we explain and discuss new notion of fibrewise topological spaces, calledfibrewise soft ideal topological spaces, Also, we show the notions of fibrewise closed soft ideal topological spaces, fibrewise open soft ideal topological spaces and fibrewise soft near ideal topological spaces.

In this paper, we proposed a modified Hestenes-Stiefel (HS) conjugate
gradient method. This achieves a high order accuracy in approximating the second
order curvature information of the objective function by utilizing the modified
secant condition which is proposed by Babaie-Kafaki [1], also we derive a nonquadratic
conjugate gradient model. The important property of the suggestion
method that is satisfy the descent property and global convergence independent of
the accuracy of the line search. In addition, we prove the global convergence under
some suitable conditions, and we reported the numerical results under these
conditions.

    In this paper, we introduce new conditions to prove that the existence and boundedness of the solution by convergent sequences and convergent series. The theorem of Krasnoselskii, Lebesgue’s dominated convergence theorem and fixed point theorem are used to get some sufficient conditions for the existence of solutions. Furthermore, we get sufficient conditions to guarantee the oscillatory property for all solutions in this class of equations. An illustrative example is included as an application to the main results.

A new efficient Two Derivative Runge-Kutta method (TDRK) of order five is developed for the numerical solution of the special first order ordinary differential equations (ODEs). The new method is derived using the property of First Same As Last (FSAL). We analyzed the stability of our method. The numerical results are presented to illustrate the efficiency of the new method in comparison with some well-known RK methods.

The aim of this thesis is to introduce a new concept of fibrewise topological spaces which is said to be fibrewise slightly topological spaces. We generalize some of the main results that have been reached from fibrewise topology into fibrewise slightly topological space. We introduce the concepts of fibrewise slightly closed, fibrewise slightly open, fibrewise locally sliceable, and fibrewise locally sectionable slightly topological spaces. Also, state and prove several propositions related to these concepts. On the other hand, extend separation axioms of ordinary topology into fibrewise setting. The separation axioms are said to be fibrewise slightly T_0 spaces, fibrewise slightly T_1 spaces, fibrewise slightly R_0 spaces, fibrewise s

In this work we define and study new concept of fibrewise topological spaces, namely fibrewise soft topological spaces, Also, we introduce the concepts of fibrewise closed soft topological spaces, fibrewise open soft topological spaces, fibrewise soft near compact spaces and fibrewise locally soft near compact spaces.

The encoding of long low density parity check (LDPC) codes presents a challenge compared to its decoding. The Quasi Cyclic (QC) LDPC codes offer the advantage for reducing the complexity for both encoding and decoding due to its QC structure. Most QC-LDPC codes have rank deficient parity matrix and this introduces extra complexity over the codes with full rank parity matrix. In this paper an encoding scheme of QC-LDPC codes is presented that is suitable for codes with full rank parity matrix and rank deficient parity matrx. The extra effort required by the codes with rank deficient parity matrix over the codes of full rank parity matrix is investigated.