Preferred Language
Articles
/
TRbktIcBVTCNdQwCaF1t
Three iterative methods for solving Jeffery-Hamel flow problem
...Show More Authors

In this article, the nonlinear problem of Jeffery-Hamel flow has been solved analytically and numerically by using reliable iterative and numerical methods. The approximate solutions obtained by using the Daftardar-Jafari method namely (DJM), Temimi-Ansari method namely (TAM) and Banach contraction method namely (BCM). The obtained solutions are discussed numerically, in comparison with other numerical solutions obtained from the fourth order Runge-Kutta (RK4), Euler and previous analytic methods available in literature. In addition, the convergence of the proposed methods is given based on the Banach fixed point theorem. The results reveal that the presented methods are reliable, effective and applicable to solve other nonlinear problems. Our computational works have been done by using the computer algebra system MATHEMATICA®10 to evaluate the terms in the iterative processes.

View Publication Preview PDF
Quick Preview PDF
Publication Date
Thu Oct 01 2020
Journal Name
Alexandria Engineering Journal
The operational matrix of Legendre polynomials for solving nonlinear thin film flow problems
...Show More Authors

Scopus (12)
Crossref (5)
Scopus Clarivate Crossref
Publication Date
Fri Apr 21 2023
Journal Name
Aip Conference Proceedings
Efficient computational methods for solving the nonlinear initial and boundary value problems
...Show More Authors

In this paper, three approximate methods namely the Bernoulli, the Bernstein, and the shifted Legendre polynomials operational matrices are presented to solve two important nonlinear ordinary differential equations that appeared in engineering and applied science. The Riccati and the Darcy-Brinkman-Forchheimer moment equations are solved and the approximate solutions are obtained. The methods are summarized by converting the nonlinear differential equations into a nonlinear system of algebraic equations that is solved using Mathematica®12. The efficiency of these methods was investigated by calculating the root mean square error (RMS) and the maximum error remainder (𝑀𝐸𝑅n) and it was found that the accuracy increases with increasi

... Show More
View Publication Preview PDF
Scopus (1)
Scopus Crossref
Publication Date
Sat Jan 20 2024
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Derivation of Embedded Diagonally Implicit Methods for Directly Solving Fourth-order ODEs
...Show More Authors

EDIRKTO, an Implicit Type Runge-Kutta  Method of Diagonally Embedded pairs, is a novel approach presented in the paper that may be used to solve 4th-order ordinary differential equations of the form . There are two pairs of EDIRKTO, with three stages each: EDIRKTO4(3) and EDIRKTO5(4). The derivation techniques of the method indicate that the higher-order pair is more accurate, while the lower-order pair provides superior error estimates. Next, using these pairs as a basis, we developed variable step codes and applied them to a series of -order ODE problems. The numerical outcomes demonstrated how much more effective their approach is in reducing the quantity of function evaluations needed to resolve fourth-order ODE issues.

View Publication Preview PDF
Crossref
Publication Date
Fri Oct 20 2023
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Solving Quadratic Assignment Problem by Using Meta-heuristic Search Method
...Show More Authors

While analytical solutions to Quadratic Assignment Problems (QAP) have indeed been since a long time, the expanding use of Evolutionary Algorithms (EAs) for similar issues gives a framework for dealing with QAP with an extraordinarily broad scope. The study's key contribution is that it normalizes all of the criteria into a single scale, regardless of their measurement systems or the requirements of minimum or maximum, relieving the researchers of the exhaustively quantifying the quality criteria. A tabu search algorithm for quadratic assignment problems (TSQAP) is proposed, which combines the limitations of tabu search with a discrete assignment problem. The effectiveness of the proposed technique has been compared to well-established a

... Show More
View Publication Preview PDF
Crossref
Publication Date
Sun Dec 06 2015
Journal Name
Baghdad Science Journal
Solving Two-Points Singular Boundary Value Problem Using Hermite Interpolation
...Show More Authors

In this paper, we have been used the Hermite interpolation method to solve second order regular boundary value problems for singular ordinary differential equations. The suggest method applied after divided the domain into many subdomains then used Hermite interpolation on each subdomain, the solution of the equation is equal to summation of the solution in each subdomain. Finally, we gave many examples to illustrate the suggested method and its efficiency.

View Publication Preview PDF
Crossref
Publication Date
Mon Jun 10 2024
Journal Name
Iraqi Journal For Computer Science And Mathematics
Solving tri-criteria: total completion time, total late work, and maximum earliness by using exact, and heuristic methods on single machine scheduling problem
...Show More Authors

The presented study investigated the scheduling regarding  jobs on a single machine. Each  job will be processed with no interruptions and becomes available for the processing at time 0. The aim is finding a processing order with regard to jobs, minimizing total completion time , total late work , and maximal tardiness  which is an NP-hard problem. In the theoretical part of the present work, the mathematical formula for the examined problem will be presented, and a sub-problem of the original problem of minimizing the multi-objective functions  is introduced. Also, then the importance regarding the dominance rule (DR) that could be applied to the problem to improve good solutions will be shown. While in the practical part, two

... Show More
View Publication
Scopus Crossref
Publication Date
Mon Mar 09 2015
Journal Name
Monthly Notices Of The Royal Astronomical Society
A reliable iterative method for solving Volterra integro-differential equations and some applications for the Lane–Emden equations of the first kind
...Show More Authors

View Publication
Crossref (7)
Crossref
Publication Date
Sat Oct 01 2016
Journal Name
I-manager’s Journal On Communication Engineering And Systems
SOLVING NETWORK CONGESTION PROBLEM BY QUALITY OF SERVICE ANALYSIS USING OPNET
...Show More Authors

Among many problems that reduced the performance of the network, especially Wide Area Network, congestion is one of these, which is caused when traffic request reaches or exceeds the available capacity of a route, resulting in blocking and less throughput per unit time. Congestion management attributes try to manage such cases. The work presented in this paper deals with an important issue that is the Quality of Service (QoS) techniques. QoS is the combination effect on service level, which locates the user's degree of contentment of the service. In this paper, packet schedulers (FIFO, WFQ, CQ and PQ) were implemented and evaluated under different applications with different priorities. The results show that WFQ scheduler gives acceptable r

... Show More
Publication Date
Wed Jan 01 2020
Journal Name
Periodicals Of Engineering And Natural Sciences
Solving multicollinearity problem of gross domestic product using ridge regression method
...Show More Authors

This study is dedicated to solving multicollinearity problem for the general linear model by using Ridge regression method. The basic formulation of this method and suggested forms for Ridge parameter is applied to the Gross Domestic Product data in Iraq. This data has normal distribution. The best linear regression model is obtained after solving multicollinearity problem with the suggesting of 10 k value.

Scopus (4)
Scopus
Publication Date
Wed Sep 12 2018
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Solving Capacitated Vehicle Routing Problem (CVRP) Using Tabu Search Algorithm (TSA)
...Show More Authors

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

... Show More
View Publication Preview PDF
Crossref (3)
Crossref