Physics and applied mathematics form the basis for understanding natural phenomena using differential equations depicting the flow in porous media, the motion of viscous liquids, and the propagation of waves. These equations provide a thorough study of physical processes, enhancing the understanding of complex applications in engineering, technology, and medicine. This paper presents novel approximate solutions for the Darcy-Brinkmann-Forchheimer moment equation, the Blasius equation and the FalknerSkan equation with initial / boundary conditions by using two iterative methods: the variational iteration method and the optimal variational iteration method. The variational iteration method is effectively developed by adding a control parameter to enhance the convergence speed and prevent large-scale divergence. The influence of physical parameters on the accuracy of the solution was also analyzed, since it was noted that increasing some parameters improves accuracy, while increasing others leads to a decrease the accuracy. Also, the convergence of the proposed methods has been discussed and proved. Moreover, comparison was made with some approximate methods available in the literature were used the operational matrices methods include: Bernstein's method (BOM), Bernoulli's method (BrOM), and the shifted Legendre’s method (LOM). Furthermore, the maximum values of the residual error were computed for the proposed methods and others operational matrices methods for different cases. The results demonstrated the efficiency and accuracy of the optimal variational iteration method in solving nonlinear ordinary differential equations in comparison to other methods. All calculations in this paper were made using the Mathematica®14 software.
The purpose of this paper, is to study different iterations algorithms types three_steps called, new iteration,
With the growth of mobile phones, short message service (SMS) became an essential text communication service. However, the low cost and ease use of SMS led to an increase in SMS Spam. In this paper, the characteristics of SMS spam has studied and a set of features has introduced to get rid of SMS spam. In addition, the problem of SMS spam detection was addressed as a clustering analysis that requires a metaheuristic algorithm to find the clustering structures. Three differential evolution variants viz DE/rand/1, jDE/rand/1, jDE/best/1, are adopted for solving the SMS spam problem. Experimental results illustrate that the jDE/best/1 produces best results over other variants in terms of accuracy, false-positive rate and false-negative
... Show MoreIn present work the effort has been put in finding the most suitable color model for the application of information hiding in color images. We test the most commonly used color models; RGB, YIQ, YUV, YCbCr1 and YCbCr2. The same procedures of embedding, detection and evaluation were applied to find which color model is most appropriate for information hiding. The new in this work, we take into consideration the value of errors that generated during transformations among color models. The results show YUV and YIQ color models are the best for information hiding in color images.
An Optimal Algorithm for HTML Page Building Process
This study aims to use claystone beds exposed in the Injana Formation (Late Miocene) at Karbala-Najaf plateau, middle of Iraq for the manufacturing of perforated and ordinary bricks. The claystone samples were assessed as an alternative material of the recent sediments, which are preferred to remain as agricultural land. The claystones are sandy mud composing of 29.1 - 39.1% clay, 37.2 - 54.8% silt and 14.1-26.8% sand. They consist of kaolinite, illite, chlorite, palygorskite, and montmorillonite with a lot of quartz, calcite, dolomite, gypsum and feldspar. Claystone samples were characterized by linear shrinkage 0.01 - 0.1%, volume shrinkage 0.1 - 0.9%, bulk density 1.2 - 2.11gm/cm3 (1.68 g / cm3 average), and the efflorescence is
... Show MoreIn this paper, an approximate solution of nonlinear two points boundary variational problem is presented. Boubaker polynomials have been utilized to reduce these problems into quadratic programming problem. The convergence of this polynomial has been verified; also different numerical examples were given to show the applicability and validity of this method.
There are many researches deals with constructing an efficient solutions for real problem having Multi - objective confronted with each others. In this paper we construct a decision for Multi – objectives based on building a mathematical model formulating a unique objective function by combining the confronted objectives functions. Also we are presented some theories concerning this problem. Areal application problem has been presented to show the efficiency of the performance of our model and the method. Finally we obtained some results by randomly generating some problems.