Preferred Language
Articles
/
CxdDso0BVTCNdQwCEhlU
Numerical solution to inverse coefficient problem for hyperbolic equation under overspecified condition of general integral type
...Show More Authors

Scopus Crossref
View Publication
Publication Date
Mon Jun 09 2025
Journal Name
Modern Sport
Determining standard levels to test the strength endurance characteristic of speed for basketball players for juniors aged under (16) years
...Show More Authors

View Publication
Publication Date
Sun Jan 01 2017
Journal Name
Journal Of Engineering
Two – Dimensional Mathematical Model to Study Erosion Problem of Tigris River Banks at Nu’maniyah
...Show More Authors

The high and low water levels in Tigris River threaten the banks of the river. The study area is located on the main stream of Tigris River at Nu’maniyah City and the length of the considered reach is 5.4 km, especially the region from 400 m upstream Nu’maniyah Bridge and downstream of the bridge up to 1250 mwhich increased the risk ofthe problemthat itheading towardsthe streetand causingdanger tonearbyareas.

The aim of this research is to identify the reason of slope collapse and find proper treatments for erosion problem in the river banks with the least cost. The modeling approach consisted of several steps, the first of which  is by using “mini” JET (Jet Erosion Test) d

... Show More
View Publication Preview PDF
Publication Date
Tue Dec 05 2023
Journal Name
Baghdad Science Journal
A Numerical scheme to Solve Boundary Value Problems Involving Singular Perturbation
...Show More Authors

The Wang-Ball polynomials operational matrices of the derivatives are used in this study to solve singular perturbed second-order differential equations (SPSODEs) with boundary conditions. Using the matrix of Wang-Ball polynomials, the main singular perturbation problem is converted into linear algebraic equation systems. The coefficients of the required approximate solution are obtained from the solution of this system. The residual correction approach was also used to improve an error, and the results were compared to other reported numerical methods. Several examples are used to illustrate both the reliability and usefulness of the Wang-Ball operational matrices. The Wang Ball approach has the ability to improve the outcomes by minimi

... Show More
View Publication Preview PDF
Scopus Crossref
Publication Date
Tue Dec 01 2015
Journal Name
Journal Of Engineering
Modified Grid Clustering Technique to Predict Heat Transfer Coefficient in a Duct of Arbitrary Cross Section Area
...Show More Authors

A simple straightforward mathematical method has been developed to cluster grid nodes on a boundary segment of an arbitrary geometry that can be fitted by a relevant polynomial. The method of solution is accomplished in two steps. At the first step, the length of the boundary segment is evaluated by using the mean value theorem, then grids are clustered as desired, using relevant linear clustering functions. At the second step, as the coordinates cell nodes have been computed and the incremental distance between each two nodes has been evaluated, the original coordinate of each node is then computed utilizing the same fitted polynomial with the mean value theorem but reversibly.

The method is utilized to predict

... Show More
View Publication Preview PDF
Publication Date
Thu Dec 29 2016
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Existence of Positive Solution for Boundary Value Problems
...Show More Authors

  This paper studies the existence of  positive solutions for the following boundary value problem :-
 
 y(b) 0 α y(a) - β y(a) 0     bta             f(y) g(t) λy    
 
 
The solution procedure follows using the Fixed point theorem and obtains that this problem has at least one positive solution .Also,it determines (  ) Eigenvalue which would be needed to find the positive solution .

View Publication Preview PDF
Publication Date
Tue Jan 02 2018
Journal Name
Arab Journal Of Basic And Applied Sciences
Daftardar-Jafari method for solving nonlinear thin film flow problem
...Show More Authors

View Publication
Crossref (15)
Crossref
Publication Date
Thu Jun 01 2023
Journal Name
Baghdad Science Journal
Effective Computational Methods for Solving the Jeffery-Hamel Flow Problem
...Show More Authors

In this paper, the effective computational method (ECM) based on the standard monomial polynomial has been implemented to solve the nonlinear Jeffery-Hamel flow problem. Moreover, novel effective computational methods have been developed and suggested in this study by suitable base functions, namely Chebyshev, Bernstein, Legendre, and Hermite polynomials. The utilization of the base functions converts the nonlinear problem to a nonlinear algebraic system of equations, which is then resolved using the Mathematica®12 program. The development of effective computational methods (D-ECM) has been applied to solve the nonlinear Jeffery-Hamel flow problem, then a comparison between the methods has been shown. Furthermore, the maximum

... Show More
View Publication Preview PDF
Scopus (4)
Crossref (1)
Scopus Crossref
Publication Date
Sat May 01 2021
Journal Name
Journal Of Physics: Conference Series
A Parallel Adaptive Genetic Algorithm for Job Shop Scheduling Problem
...Show More Authors

Publication Date
Sat Jan 01 2005
Journal Name
Iraqi Journal Of Science
Comparison between Zernike moment and central moments for matching problem
...Show More Authors

Moment invariants have wide applications in image recognition since they were proposed.

Publication Date
Wed Apr 25 2018
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Local Search Algorithms for Multi-criteria Single Machine Scheduling Problem
...Show More Authors

   Real life scheduling problems require the decision maker to consider a number of criteria before arriving at any decision. In this paper, we consider the multi-criteria scheduling problem of n jobs on single machine to minimize a function of five criteria denoted by total completion times (∑), total tardiness (∑), total earliness (∑), maximum tardiness () and maximum earliness (). The single machine total tardiness problem and total earliness problem are already NP-hard, so the considered problem is strongly NP-hard.

We apply two local search algorithms (LSAs) descent method (DM) and simulated annealing method (SM) for the 1// (∑∑∑

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