Most heuristic search method's performances are dependent on parameter choices. These parameter settings govern how new candidate solutions are generated and then applied by the algorithm. They essentially play a key role in determining the quality of the solution obtained and the efficiency of the search. Their fine-tuning techniques are still an on-going research area. Differential Evolution (DE) algorithm is a very powerful optimization method and has become popular in many fields. Based on the prolonged research work on DE, it is now arguably one of the most outstanding stochastic optimization algorithms for real-parameter optimization. One reason for its popularity is its widely appreciated property of having only a small number of parameters to tune. This paper presents a detailed review of DE parameter tuning with a table compromised a recommended guidelines for these parameters, along with a full description of the basic DE algorithm and its corresponding operators, overlooked by previous studies. It is aimed at practitioners to help them achieve better results when adopting DE as an optimization method for their problems with less time and effort. Moreover, an experimental study has been conducted over fifteen test problems and the results obtained prove the reliability of the setting values.
Elzaki Transform Adomian decomposition technique (ETADM), which an elegant combine, has been employed in this work to solve non-linear Riccati matrix differential equations. Solutions are presented to demonstrate the relevance of the current approach. With the use of figures, the results of the proposed strategy are displayed and evaluated. It is demonstrated that the suggested approach is effective, dependable, and simple to apply to a range of related scientific and technical problems.
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 work, we employ a new normalization Bernstein basis for solving linear Freadholm of fractional integro-differential equations nonhomogeneous of the second type (LFFIDEs). We adopt Petrov-Galerkian method (PGM) to approximate solution of the (LFFIDEs) via normalization Bernstein basis that yields linear system. Some examples are given and their results are shown in tables and figures, the Petrov-Galerkian method (PGM) is very effective and convenient and overcome the difficulty of traditional methods. We solve this problem (LFFIDEs) by the assistance of Matlab10.
In the present paper, by making use of the new generalized operator, some results of third order differential subordination and differential superordination consequence for analytic functions are obtained. Also, some sandwich-type theorems are presented.
This paper presents a new transform method to solve partial differential equations, for finding suitable accurate solutions in a wider domain. It can be used to solve the problems without resorting to the frequency domain. The new transform is combined with the homotopy perturbation method in order to solve three dimensional second order partial differential equations with initial condition, and the convergence of the solution to the exact form is proved. The implementation of the suggested method demonstrates the usefulness in finding exact solutions. The practical implications show the effectiveness of approach and it is easily implemented in finding exact solutions.
Finally, all algori
... Show MoreIn this paper, the finite difference method is used to solve fractional hyperbolic partial differential equations, by modifying the associated explicit and implicit difference methods used to solve fractional partial differential equation. A comparison with the exact solution is presented and the results are given in tabulated form in order to give a good comparison with the exact solution
The Internet is providing vital communications between millions of individuals. It is also more and more utilized as one of the commerce tools; thus, security is of high importance for securing communications and protecting vital information. Cryptography algorithms are essential in the field of security. Brute force attacks are the major Data Encryption Standard attacks. This is the main reason that warranted the need to use the improved structure of the Data Encryption Standard algorithm. This paper proposes a new, improved structure for Data Encryption Standard to make it secure and immune to attacks. The improved structure of Data Encryption Standard was accomplished using standard Data Encryption Standard with a new way of two key gene
... Show MoreThis study focuses on studying an oscillation of a second-order delay differential equation. Start work, the equation is introduced here with adequate provisions. All the previous is braced by theorems and examplesthat interpret the applicability and the firmness of the acquired provisions
In this work, we use the explicit and the implicit finite-difference methods to solve the nonlocal problem that consists of the diffusion equations together with nonlocal conditions. The nonlocal conditions for these partial differential equations are approximated by using the composite trapezoidal rule, the composite Simpson's 1/3 and 3/8 rules. Also, some numerical examples are presented to show the efficiency of these methods.