Ahmed M. E. Bayoumi

Ahmed M. E. Bayoumi

Auto-generated profile, based on publicly available information

Ahmed M. E. Bayoumi

Department of Mathematics, Faculty of Education Ain Shams University Cairo Egypt

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 November 2013 in Asian Journal of Control
Verified
Journal Article
Closed access
PDF file
MRMohamed Ramadan
Mohamed Ramadan
TETalaat S. El‐Danaf
Talaat S. El‐Danaf
ABAhmed M. E. Bayoumi
Ahmed M. E. Bayoumi

14 June 2017 in Asian Journal of Control
Verified
Journal Article
Closed access
PDF file
MRMohamed Ramadan
Mohamed Ramadan
ABAhmed M. E. Bayoumi
Ahmed M. E. Bayoumi

1 November 2009 in Mathematical and Computer Modelling
Verified
Journal Article
Closed access
MRMohamed A. Ramadan
Mohamed A. Ramadan
MNMokhtar A. Abdel Naby
Mokhtar A. Abdel Naby
ABAhmed M.E. Bayoumi
Ahmed M.E. Bayoumi

20 July 2016 in Transactions of the Institute of Measurement and Control
Verified
Journal Article
Closed access
PDF file
ABAhmed Me Bayoumi
Ahmed Me Bayoumi
MRMohamed A Ramadan
Mohamed A Ramadan
In this paper, we present an accelerated gradient-based iterative algorithm for solving extended Sylvester–conjugate matrix equations. The idea is from the gradient-based method introduced in Wu et al. (Applied Mathematics and Computation 217(1): 130–142, 2010a) and the relaxed gradient-based algorithm proposed in Ramadan et al. (Asian Journal of Control 16(5): 1–8, 2014) and the modified gradient-based algorithm proposed in Bayoumi (PhD thesis, Ain Shams University, 2014). The convergence analysis of the algorithm is investigated. We show that the iterative solution converges to the exact solution for any initial value provided some appropriate assumptions be made. A numerical example is given to illustrate the effectiveness of the proposed method and to test its efficiency and accuracy compared with an existing one presented in Wu et al. (2010a), Ramadan et al. (2014) and Bayoumi (2014).

8 July 2013 in Journal of Vibration and Control
Verified
Journal Article
Closed access
MRMohamed Ramadan
Mohamed Ramadan
TETalaat S El-Danaf
Talaat S El-Danaf
ABAhmed M E Bayoumi
Ahmed M E Bayoumi
This paper is concerned with iterative solutions to the generalized Sylvester matrix equation A1V+A2V¯+B1W+B2W¯=E1VF1+E2V¯F2+C . Two iterative algorithms are presented to obtain the reflexive and Hermitian reflexive solutions. With these iterative algorithms, for any initial reflexive and Hermitian reflexive matrices the solutions can be obtained. Some needed lemmas are first stated, then two theorems are stated and proved where the iterative solutions are obtained. Finally, we report two numerical examples to verify the theoretical results.

19 September 2018 in Transactions of the Institute of Measurement and Control
Verified
Journal Article
Closed access
ABAhmed Me Bayoumi
Ahmed Me Bayoumi
In this paper, we present an iterative algorithm to solve a generalized coupled Sylvester – conjugate matrix equations over Hamiltonian matrices. When the considered systems of matrix equations are consistent, it is proven that the solution can be obtained within finite iterative steps for any arbitrary initial generalized Hamiltonian matrices in the absence of round off errors. Two numerical examples are given to illustrate the effectiveness of the proposed method.