The aim of this paper is to propose a reliable iterative method for resolving many types of Volterra - Fredholm Integro - Differential Equations of the second kind with initial conditions. The series solutions of the problems under consideration are obtained by means of the iterative method. Four various problems are resolved with high accuracy to make evident the enforcement of the iterative method on such type of integro differential equations. Results were compared with the exact solution which exhibits that this technique was compatible with the right solutions, simple, effective and easy for solving such problems. To evaluate the results in an iterative process the MATLAB is used as a math program for the calculations.

In this paper Volterra Runge-Kutta methods which include: method of order two and four will be applied to general nonlinear Volterra integral equations of the second kind. Moreover we study the convergent of the algorithms of Volterra Runge-Kutta methods. Finally, programs for each method are written in MATLAB language and a comparison between the two types has been made depending on the least square errors.

Algorithms using the second order of B -splines [B (x)] and the third order of B -splines [B,3(x)] are derived to solve 1' , 2nd and 3rd linear Fredholm integro-differential equations (F1DEs). These new procedures have all the useful properties of B -spline function and can be used comparatively greater computational ease and efficiency.The results of these algorithms are compared with the cubic spline function.Two numerical examples are given for conciliated the results of this method.

In this paper, a method based on modified adomian decomposition method for solving Seventh order integro-differential equations (MADM). The distinctive feature of the method is that it can be used to find the analytic solution without transformation of boundary value problems. To test the efficiency of the method presented two examples are solved by proposed method.

In this paper the modified trapezoidal rule is presented for solving Volterra linear Integral Equations (V.I.E) of the second kind and we noticed that this procedure is effective in solving the equations. Two examples are given with their comparison tables to answer the validity of the procedure.

There are many different methods for analysis of two-way reinforced concrete slabs. The most efficient methods depend on using certain factors given in different codes of reinforced concrete design. The other ways of analysis of two-way slabs are the direct design method and the equivalent frame method. But these methods usually need a long time for analysis of the slabs.

In this paper, a new simple method has been developed to analyze the two-way slabs by using simple empirical formulae, and the results of final analysis of some examples have been compared with other different methods given in different codes of practice.

The comparison proof that this simple proposed method gives good results and it can be used in analy

<abstract><p>Many variations of the algebraic Riccati equation (ARE) have been used to study nonlinear system stability in the control domain in great detail. Taking the quaternion nonsymmetric ARE (QNARE) as a generalized version of ARE, the time-varying QNARE (TQNARE) is introduced. This brings us to the main objective of this work: finding the TQNARE solution. The zeroing neural network (ZNN) technique, which has demonstrated a high degree of effectiveness in handling time-varying problems, is used to do this. Specifically, the TQNARE can be solved using the high order ZNN (HZNN) design, which is a member of the family of ZNN models that correlate to hyperpower iterative techniques. As a result, a novel

There are many methods of searching large amount of data to find one particular piece of information. Such as find name of person in record of mobile. Certain methods of organizing data make the search process more efficient the objective of these methods is to find the element with least cost (least time). Binary search algorithm is faster than sequential and other commonly used search algorithms. This research develops binary search algorithm by using new structure called Triple, structure in this structure data are represented as triple. It consists of three locations (1-Top, 2-Left, and 3-Right) Binary search algorithm divide the search interval in half, this process makes the maximum number of comparisons (Average case com

Flexible molecular docking is a computational method of structure-based drug design to evaluate binding interactions between receptor and ligand and identify the ligand conformation within the receptor pocket. Currently, various molecular docking programs are extensively applied; therefore, realizing accuracy and performance of the various docking programs could have a significant value. In this comparative study, the performance and accuracy of three widely used non-commercial docking software (AutoDock Vina, 1-Click Docking, and UCSF DOCK) was evaluated through investigations of the predicted binding affinity and binding conformation of the same set of small molecules (HIV-1 protease inhibitors) and a protein target HIV-1 protease enzy