Ramy Hafez

Prof. Ramy Hafez

orcid

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
1 October 2012 in Communications in Nonlinear Science and Numerical Simulation
Verified
Journal Article
Closed access
EDE.H. Doha
E.H. Doha
ABA. H. Bhrawy
A. H. Bhrawy
RHRamy Hafez
Ramy Hafez

1 August 2019 in Computers & Mathematics with Applications
Verified
Journal Article
Closed access
EDE.H. Doha
E.H. Doha
RHRamy Hafez
Ramy Hafez
Youssri Hassan YoussriYoussri Hassan Youssri
Youssri Hassan Youssri

12 July 2015 in Nonlinear Dynamics
Verified
Journal Article
Closed access
PDF file
RHRamy Hafez
Ramy Hafez
SESamer Ezz-Eldien
Samer Ezz-Eldien
ABA. H. Bhrawy
A. H. Bhrawy
EAEngy A. Ahmed
Engy A. Ahmed
Dumitru BaleanuDumitru Baleanu
Dumitru Baleanu



29 August 2024 in Physica Scripta
Verified
Journal Article
Closed access
WAWaleed Mohamed Abd-Elhameed
Waleed Mohamed Abd-Elhameed
Hany M. AhmedHany M. Ahmed
Hany M. Ahmed
Mahmuod A. ZakiMahmuod A. Zaki
Mahmuod A. Zaki
RHRamy Hafez
Ramy Hafez
The numerical treatment of multi-dimensional non-linear sinh-Gordon equations is the focus of this paper. We numerically solve the (1 + 1) and (2 + 1) sinh-Gordon equations using two collocation algorithms. We select the set of basis functions as a set of generalized Chebyshev polynomials (CPs), which we express as orthogonal combinations of CPs. We develop and utilize some formulas related to these polynomials to propose our numerical algorithms. Specific values for the high-order derivatives of the basis functions serve in the derivation of the two presented algorithms. Additionally, we provide an estimation of the basis functions used in the convergence analysis study. We follow the two collocation algorithms to transform the sinh-Gordon equations into non-linear equation systems, which any suitable solver can handle. We provide some examples and comparisons to confirm the effectiveness of our presented algorithms.