Preferred Language
Articles
/
BRef848BVTCNdQwCnIFF
Reliable computational methods for solving Jeffery-Hamel flow problem based on polynomial function spaces

In this paper reliable computational methods (RCMs) based on the monomial stan-dard polynomials have been executed to solve the problem of Jeffery-Hamel flow (JHF). In addition, convenient base functions, namely Bernoulli, Euler and Laguerre polynomials, have been used to enhance the reliability of the computational methods. Using such functions turns the problem into a set of solvable nonlinear algebraic system that MathematicaⓇ12 can solve. The JHF problem has been solved with the help of Improved Reliable Computational Methods (I-RCMs), and a review of the methods has been given. Also, published facts are used to make comparisons. As further evidence of the accuracy and dependability of the proposed methods, the maximum error remainder (MERn) has been calculated. The results have been provided strong evidence that the RCMs and I-RCMs are credible and accurate methods for obtaining approximate solutions to this problem.

Scopus Clarivate Crossref
View Publication
Publication Date
Wed Apr 20 2022
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
A New Approach to Solving Linear Fractional Programming Problem with Rough Interval Coefficients in the Objective Function

This paper presents a linear fractional programming problem (LFPP) with rough interval coefficients (RICs) in the objective function. It shows that the LFPP with RICs in the objective function can be converted into a linear programming problem (LPP) with RICs by using the variable transformations. To solve this problem, we will make two LPP with interval coefficients (ICs). Next, those four LPPs can be constructed under these assumptions; the LPPs can be solved by the classical simplex method and used with MS Excel Solver. There is also argumentation about solving this type of linear fractional optimization programming problem. The derived theory can be applied to several numerical examples with its details, but we show only two examples

... Show More
Crossref (1)
Crossref
View Publication Preview PDF
Publication Date
Sat Nov 01 2014
Journal Name
International Journal Of Basic And Applied Sciences
A reliable iterative method for solving the epidemic model and the prey and predator problems

In the present article, we implement the new iterative method proposed by Daftardar-Gejji and Jafari (NIM) [V. Daftardar-Gejji, H. Jafari, An iterative method for solving nonlinear functional equations, J. Math. Anal. Appl. 316 (2006) 753-763] to solve two problems; the first one is the problem of spread of a non-fatal disease in a population which is assumed to have constant size over the period of the epidemic, and the other one is the problem of the prey and predator. The results demonstrate that the method has many merits such as being derivative-free, overcome the difficulty arising in calculating Adomian polynomials to handle the nonlinear terms in Adomian Decomposition Method (ADM), does not require to calculate Lagrange multiplier a

... Show More
Crossref (4)
Crossref
View Publication
Publication Date
Fri Dec 08 2023
Journal Name
Iraqi Journal Of Science
A Genetic Algorithm for Minimum Set Covering Problem in Reliable and Efficient Wireless Sensor Networks

Densely deployment of sensors is generally employed in wireless sensor networks (WSNs) to ensure energy-efficient covering of a target area. Many sensors scheduling techniques have been recently proposed for designing such energy-efficient WSNs. Sensors scheduling has been modeled, in the literature, as a generalization of minimum set covering problem (MSCP) problem. MSCP is a well-known NP-hard optimization problem used to model a large range of problems arising from scheduling, manufacturing, service planning, information retrieval, etc. In this paper, the MSCP is modeled to design an energy-efficient wireless sensor networks (WSNs) that can reliably cover a target area. Unlike other attempts in the literature, which consider only a si

... Show More
View Publication Preview PDF
Publication Date
Sun Aug 24 2014
Journal Name
Wireless Personal Communications
Scopus (22)
Crossref (14)
Scopus Clarivate Crossref
View Publication
Publication Date
Fri Apr 01 2022
Journal Name
Baghdad Science Journal
An Evolutionary Algorithm for Solving Academic Courses Timetable Scheduling Problem

Scheduling Timetables for courses in the big departments in the universities is a very hard problem and is often be solved by many previous works although results are partially optimal. This work implements the principle of an evolutionary algorithm by using genetic theories to solve the timetabling problem to get a random and full optimal timetable with the ability to generate a multi-solution timetable for each stage in the collage. The major idea is to generate course timetables automatically while discovering the area of constraints to get an optimal and flexible schedule with no redundancy through the change of a viable course timetable. The main contribution in this work is indicated by increasing the flexibility of generating opti

... Show More
Scopus (8)
Crossref (3)
Scopus Clarivate Crossref
View Publication Preview PDF
Publication Date
Sun Mar 02 2008
Journal Name
Baghdad Science Journal
Orthogonal Functions Solving Linear functional Differential EquationsUsing Chebyshev Polynomial

A method for Approximated evaluation of linear functional differential equations is described. where a function approximation as a linear combination of a set of orthogonal basis functions which are chebyshev functions .The coefficients of the approximation are determined by (least square and Galerkin’s) methods. The property of chebyshev polynomials leads to good results , which are demonstrated with examples.

Crossref (3)
Crossref
View Publication Preview PDF
Publication Date
Wed Apr 20 2022
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Solving Nonlinear COVID-19 Mathematical Model Using a Reliable Numerical Method

This research aims to numerically solve a nonlinear initial value problem presented as a system of ordinary differential equations. Our focus is on epidemiological systems in particular. The accurate numerical method that is the Runge-Kutta method of order four has been used to solve this problem that is represented in the epidemic model. The COVID-19 mathematical epidemic model in Iraq from 2020 to the next years is the application under study. Finally, the results obtained for the COVID-19 model have been discussed tabular and graphically. The spread of the COVID-19 pandemic can be observed via the behavior of the different stages of the model that approximates the behavior of actual the COVID-19 epidemic in Iraq. In our study, the COV

... Show More
Crossref
View Publication Preview PDF
Publication Date
Mon Aug 14 2017
Journal Name
International Journal Of Intelligent Computing And Cybernetics
Two efficient methods for solving Schlömilch’s integral equation
Purpose

In this paper, the exact solutions of the Schlömilch’s integral equation and its linear and non-linear generalized formulas with application are solved by using two efficient iterative methods. The Schlömilch’s integral equations have many applications in atmospheric, terrestrial physics and ionospheric problems. They describe the density profile of electrons from the ionospheric for awry occurrence of the quasi-transverse approximations. The paper aims to discuss these issues.

Design/methodology/approach

First, the authors apply a regularization meth

... Show More
Crossref (2)
Crossref
View Publication
Publication Date
Mon Apr 17 2017
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Energy Methods For Initial –Boundary String Problem

  We study one example of hyperbolic problems it's Initial-boundary string problem with two ends. In fact we look for the solution in weak sense in some sobolev spaces. Also we use energy technic with Galerkin's method to study some properties for our problem as existence and uniqueness

View Publication Preview PDF
Publication Date
Mon Feb 01 2021
Journal Name
Journal Of Physics: Conference Series
Bayesian Computational Methods of the Logistic Regression Model
Abstract<p>In this paper, we will discuss the performance of Bayesian computational approaches for estimating the parameters of a Logistic Regression model. Markov Chain Monte Carlo (MCMC) algorithms was the base estimation procedure. We present two algorithms: Random Walk Metropolis (RWM) and Hamiltonian Monte Carlo (HMC). We also applied these approaches to a real data set.</p>
Scopus (3)
Crossref (4)
Scopus Crossref
View Publication Preview PDF