Preferred Language
Articles
/
ijs-11396
Variational Iteration Method for Solving Multi-Fractional Integro Differential Equations

In this paper, we present an approximate method for solving integro-differential equations of multi-fractional order by using the variational iteration method.
First, we derive the variational iteration formula related to the considered problem, then prove its convergence to the exact solution. Also we give some illustrative examples of linear and nonlinear equations.

View Publication Preview PDF
Quick Preview PDF
Publication Date
Fri Dec 01 2023
Journal Name
Applied Energy
Deep clustering of Lagrangian trajectory for multi-task learning to energy saving in intelligent buildings using cooperative multi-agent

The intelligent buildings provided various incentives to get highly inefficient energy-saving caused by the non-stationary building environments. In the presence of such dynamic excitation with higher levels of nonlinearity and coupling effect of temperature and humidity, the HVAC system transitions from underdamped to overdamped indoor conditions. This led to the promotion of highly inefficient energy use and fluctuating indoor thermal comfort. To address these concerns, this study develops a novel framework based on deep clustering of lagrangian trajectories for multi-task learning (DCLTML) and adding a pre-cooling coil in the air handling unit (AHU) to alleviate a coupling issue. The proposed DCLTML exhibits great overall control and is

... Show More
Scopus (12)
Crossref (7)
Scopus Clarivate Crossref
View Publication
Publication Date
Mon May 31 2021
Journal Name
Iraqi Journal Of Science
Single-based and Population-based Metaheuristics for Solving NP-hard Problems

Metaheuristic is one of the most well-known fields of research used to find optimum solutions for non-deterministic polynomial hard (NP-hard) problems, for which it is difficult to find an optimal solution in a polynomial time. This paper introduces the metaheuristic-based algorithms and their classifications and non-deterministic polynomial hard problems. It also compares the performance of two metaheuristic-based algorithms (Elephant Herding Optimization algorithm and Tabu Search) to solve the Traveling Salesman Problem (TSP), which is one of the most known non-deterministic polynomial hard problems and widely used in the performance evaluations for different metaheuristics-based optimization algorithms. The experimental results of Ele

... Show More
Crossref (8)
Crossref
View Publication Preview PDF
Publication Date
Mon Jan 04 2021
Journal Name
Iium Engineering Journal
RELIABLE ITERATIVE METHODS FOR SOLVING 1D, 2D AND 3D FISHER’S EQUATION

In the present paper, three reliable iterative methods are given and implemented to solve the 1D, 2D and 3D Fisher’s equation. Daftardar-Jafari method (DJM), Temimi-Ansari method (TAM) and Banach contraction method (BCM) are applied to get the exact and numerical solutions for Fisher's equations. The reliable iterative methods are characterized by many advantages, such as being free of derivatives, overcoming the difficulty arising when calculating the Adomian polynomial boundaries to deal with nonlinear terms in the Adomian decomposition method (ADM), does not request to calculate Lagrange multiplier as in the Variational iteration method (VIM) and there is no need to create a homotopy like in the Homotopy perturbation method (H

... Show More
Crossref (1)
Crossref
View Publication
Publication Date
Thu Apr 13 2017
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Efficient Semi-Analytic Technique for Solving Nonlinear Singular Initial Value Problems

 The aim of this paper is to present a semi - analytic technique for solving singular initial value problems of ordinary differential equations with a singularity of different kinds to construct polynomial solution using two point  osculatory  interpolation.           The efficiency and accuracy of suggested method is assessed by comparisons with exact and other approximate solutions for a wide classes of non–homogeneous, non–linear singular initial value problems.             A new, efficient estimate of the global error is used for adaptive mesh selection. Also, analyze some of the numerical aspects

... Show More
View Publication Preview PDF
Publication Date
Sun Feb 27 2022
Journal Name
Iraqi Journal Of Science
An Improved Meerkat Clan Algorithm for Solving 0-1 Knapsack Problem

     Meerkat Clan Algorithm (MCA) is a nature-based metaheuristic algorithm which imitates the intelligent behavior of the meerkat animal. This paper presents an improvement on the MCA based on a chaotic map and crossover strategy (MCA-CC). These two strategies increase the diversification and intensification of the proposed algorithm and boost the searching ability to find more quality solutions. The 0-1 knapsack problem was solved by the basic MCA and the improved version of this algorithm (MCA-CC). The performance of these algorithms was tested on low and high dimensional problems. The experimental results demonstrate that the proposed algorithm had overcome the basic algorithm in terms of solution quality, speed a

... Show More
Scopus (4)
Crossref (1)
Scopus Crossref
View Publication Preview PDF
Publication Date
Fri Apr 28 2023
Journal Name
Mathematical Modelling Of Engineering Problems
Scopus (5)
Crossref (1)
Scopus Crossref
View Publication Preview PDF
Publication Date
Mon Dec 18 2023
Journal Name
Journal Of Iraqi Al-khwarizmi
Fibrewise Multi-Compact and Locally Multi- Compact Spaces

The primary objective of this paper is to introduce a new concept of fibrewise topological spaces on D is named fibrewise multi- topological spaces on D. Also, we entroduce the concepts of multi-proper, fibrewise multi-compact, fibrewise locally multi-compact spaces, Moreover, we study relationships between fibrewise multi-compact (resp., locally multi-compac) space and some fibrewise multi-separation axioms.

Preview PDF
Publication Date
Sun Jun 07 2009
Journal Name
Baghdad Science Journal
Application of delay integral equations in population growth

In this paper, the delay integral equations in population growth will be described,discussed , studied and transfered this model to integro-differential equation. At last,we will solve this problem by using variational approach.

Crossref (1)
Crossref
View Publication Preview PDF
Publication Date
Mon Apr 06 2020
Journal Name
Journal Of Techniques
Finite Element Modeling Of Saint-Venant Equations For Shatt-Al Hilla

Shatt Al-Hilla was considered one of the important branches of Euphrates River that supplies irrigation water to millions of dunams of planted areas. It is important to control the velocity and water level along the river to maintain the required level for easily diverting water to the branches located along the river. So, in this research, a numerical model was developed to simulate the gradually varied unsteady flow in Shatt AL-Hilla. The present study aims to solve the continuity and momentum (Saint-Venant) equations numerically to predict the hydraulic characteristics in the river using Galerkin finite element method. A computer program was designed and built using the programming language FORTRAN-77. Fifty kilometers was consid

... Show More
Crossref
View Publication
Publication Date
Tue Dec 01 2020
Journal Name
Baghdad Science Journal
Approximate Numerical Solutions for Linear Volterra Integral Equations Using Touchard Polynomials

In this paper, Touchard polynomials (TPs) are presented for solving Linear Volterra integral equations of the second kind (LVIEs-2k) and the first kind (LVIEs-1k) besides, the singular kernel type of this equation. Illustrative examples show the efficiency of the presented method, and the approximate numerical (AN) solutions are compared with one another method in some examples. All calculations and graphs are performed by program MATLAB2018b.

Scopus (4)
Crossref (1)
Scopus Clarivate Crossref
View Publication Preview PDF