To obtain the approximate solution to Riccati matrix differential equations, a new variational iteration approach was ‎proposed, which is suggested to improve the accuracy and increase the convergence rate of the approximate solutons to the ‎exact solution. This technique was found to give very accurate results in a few number of iterations. In this paper, the ‎modified approaches were derived to give modified solutions of proposed and used and the convergence analysis to the exact ‎solution of the derived sequence of approximate solutions is also stated and proved. Two examples were also solved, which ‎shows the reliability and applicability of the proposed approach. ‎

In this paper, we consider inequalities in which the function is an element of n-th partially order space. Local and Global uniqueness theorem of solutions of the n-the order Partial differential equation Obtained which are applications of Gronwall's inequalities.

Electromechanical actuators are used in a wide variety of aerospace applications such as missiles, aircrafts and spy-fly etc. In this work a linear and nonlinear fin actuator mathematical model has been developed and its response is investigated by developing an algorithm for the system using MATLAB. The algorithm used to the linear model is the state space algorithm while the algorithm used to the nonlinear model is the discrete algorithm. The huge moment constant is varied from (-3000 to 3000) and the damping ratio is varied from (0.4 to 0.8).        

 The comparison between linear and nonlinear fin actuator response results shows that for linear model, the maximum overshoot is about 10%,

A mathematical method with a new algorithm with the aid of Matlab language is proposed to compute the linear equivalence (or the recursion length) of the pseudo-random key-stream periodic sequences using Fourier transform. The proposed method enables the computation of the linear equivalence to determine the degree of the complexity of any binary or real periodic sequences produced from linear or nonlinear key-stream generators. The procedure can be used with comparatively greater computational ease and efficiency. The results of this algorithm are compared with Berlekamp-Massey (BM) method and good results are obtained where the results of the Fourier transform are more accurate than those of (BM) method for computing the linear equivalenc

Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorith