Browsing by Author "Ibrahim Elimam Abdalla"

Now showing 1 - 4 of 4

A comparative Study Electron Tracking in Magnetic Field by Ordinary Differential Equation and Euler Method
(2018-12-15) Mahassin A. A. Nemair; Eltyeb M. Mustafa; AbdelRhman A. Elbadawi; Ibrahim Elimam Abdalla
Two electron tracking methods were developed and compared to determine the trajectory and conserved energy of an electron. The trajectory integrators include: the Euler electron tracking method and Ordinary Differential Equations (ODE) Solvers method. The goal of this study is to compare the Euler electron tracking method with the Ordinary Differential Equations method. The Euler method was found inadequate for tracking electrons in a dipole magnetic field because it was not able to maintain the correct orbit of the electron, conserve bounce period and electron kinetic energy. The Ordinary Differential Equations method is shown to conserve energy and maintain the correct orbit of the electron. The Ordinary Differential Equations is quite adequate to describe the trajectory of electrons in the Earth’s magnetic field. Key words: Particle trajectory computations; the dynamics of electrons in magnetosphere model; three adiabatic invariants associated with three types of periodic motions.
CURRICULUM VITAE : Ibrahim Elimam Abdalla
(Al Neelain University, 2018-01) Ibrahim Elimam Abdalla
A New Algorithm for Blind Source Separation Using Parallel Processing
(Neelain University, 2006) Ibrahim Elimam Abdalla
ABSTRACT In this dissertation the digital ﬁlters were used to solve the Convolutive Blind Source Separation within the parallel computing context, A revision of the strategy of tackling BSS and CBSS problems via parallel computing was proposed. In this dissertation a convolutive Blind Source Separation algorithm was developed within the context of parallel computing. The algorithm ﬁnds the demixing system by simultaneously jointly diagonalizeing a set of time-lagged correlation matrices by using parallel form of Jacobi plane transformations. The parallel computing approach was applied on some existing BSS and CBSS algorithms. As an example of the iterative CBSS algorithms Lambert and Bell work was selected and modiﬁed so as to apply parallel computing approach. Very good results were obtained compared with Lambert and Bell results. A very important improvement is that the developed equalizing system converges very fast. As an example of the diagonalization algorithms the JADE algorithm was modiﬁed to apply parallel computing approach. The results of the simulations showed that applying parallel computing approach on this type of algorithms is easier if done on shared memory systems.
A New Algorithm for Blind Source Separation Using Parallel Processing
(Al Neelain University, 2006-11) Ibrahim Elimam Abdalla
In this dissertation the digital ﬁlters were used to solve the Convolutive Blind Source Separation within the parallel computing context, A revision of the strategy of tackling BSS and CBSS problems via parallel computing was proposed. In this dissertation a convolutive Blind Source Separation algorithm was developed within the context of parallel computing. The algorithm ﬁnds the demixing system by simultaneously jointly diagonalizeing a set of time-lagged correlation matrices by using parallel form of Jacobi plane transformations. The parallel computing approach was applied on some existing BSS and CBSS algorithms. As an example of the iterative CBSS algorithms Lambert and Bell work was selected and modiﬁed so as to apply parallel computing approach. Very good results were obtained compared with Lambert and Bell results. A very important improvement is that the developed equalizing system converges very fast. As an example of the diagonalization algorithms the JADE algorithm was modiﬁed to apply parallel computing approach. The results of the simulations showed that applying parallel computing approach on this type of algorithms is easier if done on shared memory systems.