In this work, the pseudoparabolic problem of the fourth order is investigated to identify the time -dependent potential term under periodic conditions, namely, the integral condition and overdetermination condition. The existence and uniqueness of the solution to the inverse problem are provided. The proposed method involves discretizing the pseudoparabolic equation by using a finite difference scheme, and an iterative optimization algorithm to resolve the inverse problem which views as a nonlinear least-square minimization. The optimization algorithm aims to minimize the difference between the numerical computing solution and the measured data. Tikhonov’s regularization method is also applied to gain stable results. Two

This study discussed a biased estimator of the Negative Binomial Regression model known as (Liu Estimator), This estimate was used to reduce variance and overcome the problem Multicollinearity between explanatory variables, Some estimates were used such as Ridge Regression and Maximum Likelihood Estimators, This research aims at the theoretical comparisons between the new estimator (Liu Estimator) and the estimators

    This paper deals with finding the approximation solution of a nonlinear parabolic boundary value problem (NLPBVP) by using the Galekin finite element method (GFEM) in space and Crank Nicolson (CN) scheme in time, the problem then reduce to solve a Galerkin nonlinear algebraic system(GNLAS). The predictor and the corrector technique (PCT) is applied here to solve the GNLAS, by transforms it to a Galerkin linear algebraic system (GLAS). This GLAS is solved once using the Cholesky method (CHM) as it appear in the matlab package and once again using the Cholesky reduction order technique (CHROT) which we employ it here to save a massive time. The results, for CHROT are given by tables and figures and show

The purpose of this research is to demonstrate the effectiveness of a program to address the problem of mixing similar letters in the Arabic language for students in the second grade of primary and to achieve the goal of the research. The researcher followed the experimental method to suit the nature of this research and found that there are statistically significant differences between the tribal and remote tests, The effectiveness of the proposed educational program. At the end of the research, the researcher recommends several recommendations, the most important of which are: 1 - Training students to correct pronunciation of the outlets, especially in the first three stages of primary education (primary) and the use of direct training

In this paper, two of the local search algorithms are used (genetic algorithm and particle swarm optimization), in scheduling number of products (n jobs) on a single machine to minimize a multi-objective function which is denoted as  (total completion time, total tardiness, total earliness and the total late work). A branch and bound (BAB) method is used for comparing the results for (n) jobs starting from (5-18). The results show that the two algorithms have found the optimal and near optimal solutions in an appropriate times.

Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).

This paper investigates the capacitated vehicle routing problem (CVRP) as it is one of the numerous issues that have no impeccable solutions yet. Numerous scientists in the recent couple of decades have set up various explores and utilized numerous strategies with various methods to deal with it. However, for all researches, finding the least cost is exceptionally complicated. In any case, they have figured out how to think of rough solutions that vary in efficiencies relying upon the search space. Furthermore, tabu search (TS) is utilized to resolve this issue as it is fit for solving numerous complicated issues. The algorithm has been adjusted to resolve the exploration issue, where its methodology is not quite the same as the normal a

In this paper, a least squares group finite element method for solving coupled Burgers' problem in   2-D is presented. A fully discrete formulation of least squares finite element method is analyzed, the backward-Euler scheme for the time variable is considered, the discretization with respect to space variable is applied as biquadratic quadrangular elements with nine nodes for each element. The continuity, ellipticity, stability condition and error estimate of least squares group finite element method are proved.  The theoretical results  show that the error estimate of this method is . The numerical results are compared with the exact solution and other available literature when the convection-dominated case to illustrate the effic