Preferred Language
Articles
/
tRepKpABVTCNdQwCX4Sl
Improved Alternating Direction Implicit Method
Abstract<p>The alternating direction implicit method (ADI) is a common classical numerical method that was first introduced to solve the heat equation in two or more spatial dimensions and can also be used to solve parabolic and elliptic partial differential equations as well. In this paper, We introduce an improvement to the alternating direction implicit (ADI) method to get an equivalent scheme to Crank-Nicolson differences scheme in two dimensions with the main feature of ADI method. The new scheme can be solved by similar ADI algorithm with some modifications. A numerical example was provided to support the theoretical results in the research.</p>
Scopus Crossref
View Publication
Publication Date
Wed Apr 29 2020
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Alternating Directions Implicit Method for Solving Homogeneous Heat Diffusion Equation

     An Alternating Directions Implicit method is presented to solve the homogeneous heat diffusion equation when the governing equation is a bi-harmonic equation (X) based on Alternative Direction Implicit (ADI). Numerical results are compared with other results obtained by other numerical (explicit and implicit) methods. We apply these methods it two examples (X): the first one, we apply explicit when the temperature .

Crossref
View Publication Preview PDF
Publication Date
Tue Nov 01 2022
Journal Name
2022 International Conference On Data Science And Intelligent Computing (icdsic)
An improved Bi-LSTM performance using Dt-WE for implicit aspect extraction

In aspect-based sentiment analysis ABSA, implicit aspects extraction is a fine-grained task aim for extracting the hidden aspect in the in-context meaning of the online reviews. Previous methods have shown that handcrafted rules interpolated in neural network architecture are a promising method for this task. In this work, we reduced the needs for the crafted rules that wastefully must be articulated for the new training domains or text data, instead proposing a new architecture relied on the multi-label neural learning. The key idea is to attain the semantic regularities of the explicit and implicit aspects using vectors of word embeddings and interpolate that as a front layer in the Bidirectional Long Short-Term Memory Bi-LSTM. First, we

... Show More
Scopus (3)
Crossref (2)
Scopus Crossref
View Publication Preview PDF
Publication Date
Fri Jan 20 2023
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Exponentially Fitted Diagonally Implicit EDITRK Method for Solving ODEs

This paper derives the EDITRK4 technique, which is an exponentially fitted diagonally implicit RK method for solving ODEs . This approach is intended to integrate exactly initial value problems (IVPs), their solutions consist of linear combinations of the group functions  and  for exponentially fitting  problems, with  being the problem’s major frequency utilized to improve the precision of the method. The modified  method EDITRK4 is a new three-stage fourth-order exponentially-fitted diagonally implicit approach for solving IVPs with functions that are exponential as solutions. Different forms of -order ODEs must be derived using the modified system, and when the same issue is reduced to a  framework of equations that can be sol

... Show More
Crossref
View Publication Preview PDF
Publication Date
Tue Nov 30 2021
Journal Name
Iraqi Journal Of Science
The Galerkin-Implicit Method for Solving Nonlinear Variable Coefficients Hyperbolic Boundary Value Problem

This paper has the interest of finding the approximate solution (APPS) of a nonlinear variable coefficients hyperbolic boundary value problem (NOLVCHBVP).  The given boundary value problem is written in its discrete weak form (WEFM) and proved  have a unique solution, which is obtained via the mixed Galerkin finite element with implicit method that reduces the problem to solve the Galerkin nonlinear algebraic system  (GNAS). In this part, the predictor and the corrector techniques (PT and CT, respectively) are proved at first convergence and then are used to transform  the obtained GNAS to a linear GLAS . Then the GLAS is solved using the Cholesky method (ChMe). The stability and the convergence of the method are stud

... Show More
Scopus (1)
Scopus Crossref
View Publication Preview PDF
Publication Date
Wed Dec 26 2018
Journal Name
Iraqi Journal Of Science
New Improved Heuristic Method for Solving Travelling Salesman Problem

In this paper we will investigate some Heuristic methods to solve travelling salesman problem. The discussed methods are Minimizing Distance Method (MDM), Branch and Bound Method (BABM), Tree Type Heuristic Method (TTHM) and Greedy Method (GRM).

The weak points of MDM are manipulated in this paper. The Improved MDM (IMDM) gives better results than classical MDM, and other discussed methods, while the GRM gives best time for 5≤ n ≤500, where n is the number of visited cities.

View Publication Preview PDF
Publication Date
Sat Dec 31 2022
Journal Name
Wasit Journal Of Computer And Mathematics Science
An Improved Method for Hiding Text in Image Using Header Image

The necessities of steganography methods for hiding secret message into images have been ascend. Thereby, this study is to generate a practical steganography procedure to hide text into image. This operation allows the user to provide the system with both text and cover image, and to find a resulting image that comprises the hidden text inside. The suggested technique is to hide a text inside the header formats of a digital image. Least Significant Bit (LSB) method to hide the message or text, in order to keep the features and characteristics of the original image are used. A new method is applied via using the whole image (header formats) to hide the image. From the experimental results, suggested technique that gives a higher embe

... Show More
Crossref
View Publication
Publication Date
Tue Jan 18 2022
Journal Name
Iraqi Journal Of Science
Improved Weighted 0-1 Knapsack Method (WKM) to Optimize Resource Allocation

In this paper an improved weighted 0-1 knapsack method (WKM) is proposed to optimize the resource allocation process when the sum of items' weight exceeds the knapsack total capacity .The improved method depends on a modified weight for each item to ensure the allocation of the required resources for all the involved items. The results of the improved WKM are compared to the traditional 0-1 Knapsack Problem (KP). The proposed method dominates on the other one in term of the total optimal solution value of the knapsack .

View Publication Preview PDF
Publication Date
Tue Sep 01 2020
Journal Name
Acta Polytechnica
COMPLEXITY REDUCTION OF CYCLOSTATIONARY SENSING TECHNIQUE USING IMPROVED HYBRID SENSING METHOD

In cognitive radio system, the spectrum sensing has a major challenge in needing a sensing method, which has a high detection capability with reduced complexity. In this paper, a low-cost hybrid spectrum sensing method with an optimized detection performance based on energy and cyclostationary detectors is proposed. The method is designed such that at high signal-to-noise ratio SNR values, energy detector is used alone to perform the detection. At low SNR values, cyclostationary detector with reduced complexity may be employed to support the accurate detection. The complexity reduction is done in two ways: through reducing the number of sensing samples used in the autocorrelation process in the time domain and through using the Slid

... Show More
Scopus (7)
Crossref (4)
Scopus Clarivate Crossref
View Publication
Publication Date
Mon May 20 2019
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Numerical Solution for Classical Optimal Control Problem Governing by Hyperbolic Partial Differential Equation via Galerkin Finite Element-Implicit method with Gradient Projection Method

     This paper deals with the numerical solution of the discrete classical optimal control problem (DCOCP) governing by linear hyperbolic boundary value problem (LHBVP). The method which is used here consists of: the GFEIM " the Galerkin finite element method in space variable with the implicit finite difference method in time variable" to find the solution of the discrete state equation (DSE) and the solution of its corresponding discrete adjoint equation, where a discrete classical control (DCC) is given.  The gradient projection method with either the Armijo method (GPARM) or with the optimal method (GPOSM) is used to solve the minimization problem which is obtained from the necessary conditi

... Show More
Crossref
View Publication Preview PDF
Publication Date
Fri Jan 20 2023
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Improved Runge-Kutta Method for Oscillatory Problem Solution Using Trigonometric Fitting Approach

This paper provides a four-stage Trigonometrically Fitted Improved Runge-Kutta (TFIRK4) method of four orders to solve oscillatory problems, which contains an oscillatory character in the solutions. Compared to the traditional Runge-Kutta method, the Improved Runge-Kutta (IRK) method is a natural two-step method requiring fewer steps. The suggested method extends the fourth-order Improved Runge-Kutta (IRK4) method with trigonometric calculations. This approach is intended to integrate problems with particular initial value problems (IVPs) using the set functions  and   for trigonometrically fitted. To improve the method's accuracy, the problem primary frequency  is used. The novel method is more accurate than the conventional Runge-Ku

... Show More
Crossref
View Publication Preview PDF