Preferred Language
Articles
/
BRcd-Y8BVTCNdQwCdYK9
Approximate Solution of Linear and Nonlinear Partial Differential Equations Using Picard’s Iterative Method
...Show More Authors

Publication Date
Sat Feb 27 2021
Journal Name
Iraqi Journal Of Science
Pulsed Laser Deposition of Tio2 Nanostructures for Verify the Linear and Non-Linear Optical Characteristics
...Show More Authors

The present work aims to achieve pulsed laser deposition ofTiO2 nanostructures and investigate their nonlinear properties using z-scan technique.The second harmonic Q-switched Nd: YAG laser at repetition rate of 1Hz and wavelength of 532 nm with three different laser fluencies in the range of 0.77-1.1 J/cm2 was utilized to irradiate the TiO2 target. The products of laser-induced plasma were characterized by utilizing UV-Vis absorption spectroscopy, x-ray diffraction (XRD), atomic force Microscope (AFM),and Fourier transform infrared (FTIR). A reasonable agreement was found among the data obtained usingX-Ray diffraction, UV-Vis and Raman spectroscopy. The XRD results showed that the prepared TiO2

... Show More
View Publication Preview PDF
Scopus (37)
Crossref (33)
Scopus Crossref
Publication Date
Tue May 01 2018
Journal Name
Journal Of Engineering
Performance enhancement of Echo Cancellation Using a Combination of Partial Update ( PU) Methods and New Variable Length LMS (NVLLMS) Algorithm
...Show More Authors

In this paper, several combination algorithms between Partial Update LMS (PU LMS) methods and previously proposed algorithm (New Variable Length LMS (NVLLMS)) have been developed. Then, the new sets of proposed algorithms were applied to an Acoustic Echo Cancellation system (AEC) in order to decrease the filter coefficients, decrease the convergence time, and enhance its performance in terms of Mean Square Error (MSE) and Echo Return Loss Enhancement (ERLE). These proposed algorithms will use the Echo Return Loss Enhancement (ERLE) to control the operation of filter's coefficient length variation. In addition, the time-varying step size is used.The total number of coefficients required was reduced by about 18% , 10% , 6%

... Show More
View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Fri Sep 22 2017
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Lossless Data Hiding Using L·SB Method
...Show More Authors

A loS.sless (reversible) data hiding (embedding) method  inside  an image  (translating medium)  - presented   in  the  present  work  using  L_SB (least  significant  bit). technique  which  enables  us to translate   data  using an  image  (host  image),  using  a  secret  key, to  be  undetectable  without losing  any  data  or  without   changing   the  size  and  the  external   scene (visible  properties) of the image, the hid-ing data is then can  be extracted (without  losing)   by reversing &n

... Show More
View Publication Preview PDF
Publication Date
Wed Mar 10 2021
Journal Name
Baghdad Science Journal
Bilinear System Identification Using Subspace Method
...Show More Authors

In this paper, a subspace identification method for bilinear systems is used . Wherein a " three-block " and " four-block " subspace algorithms are used. In this algorithms the input signal to the system does not have to be white . Simulation of these algorithms shows that the " four-block " gives fast convergence and the dimensions of the matrices involved are significantly smaller so that the computational complexity is lower as a comparison with " three-block " algorithm .

View Publication Preview PDF
Crossref
Publication Date
Fri Oct 20 2023
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
An Analytical Study of the Convergence and Stability of the New Four-Step Iterative Schemes
...Show More Authors

Based on the needs of the scientific community, researchers tended to find new iterative schemes or develop previous iterative schemes that would help researchers reach the fixed point with fewer steps and with stability, will be define in this paper the multi_implicit four-step iterative (MIFSI) which is development to four-step implicit fixed point iterative, to develop the aforementioned iterative scheme, we will use a finite set of projective functions ,nonexpansive function and finite set from a new functions called generalized quasi like contractive which is an amalgamation of quasi contractive function and contractive like function , by the last function and a set of sequential organized steps, we will be able to prove the existen

... Show More
View Publication Preview PDF
Crossref
Publication Date
Fri Sep 30 2022
Journal Name
Iraqi Journal Of Science
An Embedded 5(4) Pair of Optimized Runge-Kutta Method for the Numerical Solution of Periodic Initial Value Problems
...Show More Authors

      This paper presents an alternative method for developing effective embedded optimized Runge-Kutta (RK) algorithms to solve oscillatory problems numerically.   The embedded scheme approach has algebraic orders of 5 and 4. By transforming second-order ordinary differential equations (ODEs) into their first-order counterpart, the suggested approach solves first-order ODEs. The amplification error, phase-lag, and first derivative of the phase-lag are all nil in the embedded pair. The alternative method’s absolute stability is demonstrated. The numerical tests are conducted to demonstrate the effectiveness of the developed approach in comparison to other RK approaches. The alternative approach outperforms the current RK methods

... Show More
View Publication Preview PDF
Scopus Crossref
Publication Date
Sun May 17 2020
Journal Name
Iraqi Journal Of Science
Numerical Treatment of First Order Volterra Integro-Differential Equation Using Non-Polynomial Spline Functions
...Show More Authors

The approach given in this paper leads to numerical methods to find the approximate solution of volterra integro –diff. equ.1st kind. First, we reduce it from integro VIDEs to integral VIEs of the 2nd kind by using the reducing theory, then we use two types of Non-polynomial spline function (linear, and quadratic). Finally, programs for each method are written in MATLAB language and a comparison between these two types of Non-polynomial spline function is made depending on the least square errors and running time. Some test examples and the exact solution are also given.

View Publication Preview PDF
Publication Date
Thu Mar 02 2023
Journal Name
Iar Journal Of Business Management
Reducing The Costs Of Transporting Multiple Products (Linear Transport Problems) Using Excel QM
...Show More Authors

The transportation model is a well-recognized and applied algorithm in the distribution of products of logistics operations in enterprises. Multiple forms of solution are algorithmic and technological, which are applied to determine the optimal allocation of one type of product. In this research, the general formulation of the transport model by means of linear programming, where the optimal solution is integrated for different types of related products, and through a digital, dynamic, easy illustration Develops understanding of the Computer in Excel QM program. When choosing, the implementation of the form in the organization is provided.

Preview PDF
Publication Date
Wed Jul 01 2020
Journal Name
Journal Of Physics: Conference Series
A New Iterative Methods For a Family of Asymptotically Severe Mappings
...Show More Authors
Abstract<p>The aim of this paper is to introduce the concepts of asymptotically p-contractive and asymptotically severe accretive mappings. Also, we give an iterative methods (two step-three step) for finite family of asymptotically p-contractive and asymptotically severe accretive mappings to solve types of equations.</p>
View Publication
Scopus (5)
Crossref (2)
Scopus Crossref
Publication Date
Mon Mar 01 2021
Journal Name
Journal Of Physics: Conference Series
Iterative Methods for Approximation of Fixed Points Via Like Contraction Mappings
...Show More Authors
Abstract<p>The aim of this paper, is to study different iteration algorithms types two steps called, modified SP, Ishikawa, Picard-S iteration and M-iteration, which is faster than of others by using like contraction mappings. On the other hand, the M-iteration is better than of modified SP, Ishikawa and Picard-S iterations. Also, we support our analytic proof with a numerical example.</p>
View Publication
Scopus (1)
Crossref (1)
Scopus Crossref