Talaat El-Sayed El-Danaf
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Talaat El-Sayed El-Danaf has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
Mohamed A. Ramadan
6 shared publications- Khalid Karam Ali
Department of Mathematical Sciences, Saveetha School of Engineering, SIMATS, Chennai, 602105, Tamilnadu, India; Mathematics Department, Faculty of Science, Al-Azhar University, Nasr-City, Cairo, Egypt; Mathematics Education Program, Faculty of Education and Arts, Sohar University, Sohar, 311, Oman
5 shared publications - Mohamed Ramadan
Mathematics and Computer Science Department, Faculty of Science, Menoufia University, Shebin El-Koom 32511, Egypt
4 shared publications - Ahmed M. E. Bayoumi
Department of Mathematics, Faculty of Education Ain Shams University Cairo Egypt
3 shared publications - Kamal R. Raslan
Department of Mathematics, Faculty of Science, Al-Azhar University, Nasr-City, Cairo, Egypt
3 shared publications - Adel R. Hadhoud
Department of Mathematics and Computer Science, Faculty of Science, Menoufia University, Shebin El-Kom 13829, Egypt
2 shared publications
Latest Publications
- 21 July 2017
- Published by Springer Nature in The European Physical Journal Plus
- Vol. 132 (7) , 319
Exact solution of the space-time fractional coupled EW and coupled MEW equations
- 21 July 2017
- Published by Springer Nature in The European Physical Journal Plus
- Vol. 132 (7) , 319
Exact solution of the space-time fractional coupled EW and coupled MEW equations
- 1 July 2017
- Published by IOP Publishing in Communications in Theoretical Physics
- Vol. 68 (1) , 49
Exact Solution of Space-Time Fractional Coupled EW and Coupled MEW Equations Using Modified Kudryashov Method
In the present paper, we established a traveling wave solution by using modified Kudryashov method for the space-time fractional nonlinear partial differential equations. The method is used to obtain the exact solutions for different types of the space-time fractional nonlinear partial differential equations such as, the space-time fractional coupled equal width wave equation (CEWE) and the space-time fractional coupled modified equal width wave equation (CMEW), which are the important soliton equations. Both equations are reduced to ordinary differential equations by the use of fractional complex transform and properties of modified Riemann–Liouville derivative. We plot the exact solutions for these equations at different time levels.
- 1 July 2017
- Published by IOP Publishing in Communications in Theoretical Physics
- Vol. 68 (1) , 49
Exact Solution of Space-Time Fractional Coupled EW and Coupled MEW Equations Using Modified Kudryashov Method
In the present paper, we established a traveling wave solution by using modified Kudryashov method for the space-time fractional nonlinear partial differential equations. The method is used to obtain the exact solutions for different types of the space-time fractional nonlinear partial differential equations such as, the space-time fractional coupled equal width wave equation (CEWE) and the space-time fractional coupled modified equal width wave equation (CMEW), which are the important soliton equations. Both equations are reduced to ordinary differential equations by the use of fractional complex transform and properties of modified Riemann–Liouville derivative. We plot the exact solutions for these equations at different time levels.
- 8 October 2016
- Published by Pushpa Publishing House in Far East Journal of Applied Mathematics
- Vol. 95 (2) , 109-123
COLLOCATION METHOD WITH CUBIC TRIGONOMETRIC B-SPLINE ALGORITHM FOR SOLVING COUPLED BURGERS’ EQUATIONS
- 8 October 2016
- Published by Pushpa Publishing House in Far East Journal of Applied Mathematics
- Vol. 95 (2) , 109-123
COLLOCATION METHOD WITH CUBIC TRIGONOMETRIC B-SPLINE ALGORITHM FOR SOLVING COUPLED BURGERS’ EQUATIONS
- Open Access
- 27 July 2016
- Published by Modern Science Publishers in Journal of Modern Methods in Numerical Mathematics
- Vol. 7 (2) , 67
Numerical Treatment for the Coupled-BBM System
// In the present paper, a numerical method is proposed for the numerical solution of a coupled-BBM system with appropriate initial and boundary conditions by using collocation method with quintic B-spline on the uniform mesh points. The method is shown to be unconditionally stable using von-Neumann technique. To test accuracy the error norms \(L_2\), \(L_\infity\) are computed. Furthermore, interaction of two and three solitary waves are used to discuss the effect of the behavior of the solitary waves after the interaction. These results show that the technique introduced here is easy to apply. We make linearization for the nonlinear term.- 27 July 2016
- Published by Modern Science Publishers in Journal of Modern Methods in Numerical Mathematics
- Vol. 7 (2) , 67
Open AccessNumerical Treatment for the Coupled-BBM System
// In the present paper, a numerical method is proposed for the numerical solution of a coupled-BBM system with appropriate initial and boundary conditions by using collocation method with quintic B-spline on the uniform mesh points. The method is shown to be unconditionally stable using von-Neumann technique. To test accuracy the error norms \(L_2\), \(L_\infity\) are computed. Furthermore, interaction of two and three solitary waves are used to discuss the effect of the behavior of the solitary waves after the interaction. These results show that the technique introduced here is easy to apply. We make linearization for the nonlinear term. - 2 March 2016
- Published by Pushpa Publishing House in International Journal of Numerical Methods and Applications
- Vol. 15 (1) , 39-59
COLLOCATION METHOD WITH CUBIC B-SPLINES FOR SOLVING THE GENERALIZED REGULARIZED LONG WAVE EQUATION
- 2 March 2016
- Published by Pushpa Publishing House in International Journal of Numerical Methods and Applications
- Vol. 15 (1) , 39-59
COLLOCATION METHOD WITH CUBIC B-SPLINES FOR SOLVING THE GENERALIZED REGULARIZED LONG WAVE EQUATION
- Open Access
- 15 December 2015
- Published by Academic Publications in International Journal of Pure and Apllied Mathematics
- Vol. 105 (3) , 399-413
ON THE EXPONENTIAL CHEBYSHEV APPROXIMATION IN UNBOUNDED DOMAINS: A COMPARISON STUDY FOR SOLVING HIGH-ORDER ORDINARY DIFFERENTIAL EQUATIONS
Contents IJPAM: Volume 105, No. 3 (2015)
- 15 December 2015
- Published by Academic Publications in International Journal of Pure and Apllied Mathematics
- Vol. 105 (3) , 399-413
Open AccessON THE EXPONENTIAL CHEBYSHEV APPROXIMATION IN UNBOUNDED DOMAINS: A COMPARISON STUDY FOR SOLVING HIGH-ORDER ORDINARY DIFFERENTIAL EQUATIONS
Contents IJPAM: Volume 105, No. 3 (2015)
- 14 January 2015
- Published by SAGE Publications in Transactions of the Institute of Measurement and Control
- Vol. 37 (3) , 291-316
Solving the generalized coupled Sylvester matrix equations over generalized bisymmetric matrices
In many areas of principal component analysis, biology, electricity, solid mechanics, automatics control theory and vibration theory, linear matrix equations can be encountered. The presented paper proposes first an iterative method for finding the generalized bisymmetric solution to the generalized coupled Sylvester matrix equations. Second, when the generalized coupled Sylvester matrix equations matrix are consistent, for any generalized bisymmetric initial iterative matrix pair, we can obtain the generalized bisymmetric solution within finite iterative steps in the absence of round-off errors. Furthermore, the optimal approximate generalized bisymmetric solution of the matrix equation for a given generalized bisymmetric matrix can be obtained by finding the least-norm generalized bisymmetric solution of new generalized coupled Sylvester matrix equations. Finally, numerical examples are presented to support the theoretical results of this paper.
- 14 January 2015
- Published by SAGE Publications in Transactions of the Institute of Measurement and Control
- Vol. 37 (3) , 291-316
Solving the generalized coupled Sylvester matrix equations over generalized bisymmetric matrices
In many areas of principal component analysis, biology, electricity, solid mechanics, automatics control theory and vibration theory, linear matrix equations can be encountered. The presented paper proposes first an iterative method for finding the generalized bisymmetric solution to the generalized coupled Sylvester matrix equations. Second, when the generalized coupled Sylvester matrix equations matrix are consistent, for any generalized bisymmetric initial iterative matrix pair, we can obtain the generalized bisymmetric solution within finite iterative steps in the absence of round-off errors. Furthermore, the optimal approximate generalized bisymmetric solution of the matrix equation for a given generalized bisymmetric matrix can be obtained by finding the least-norm generalized bisymmetric solution of new generalized coupled Sylvester matrix equations. Finally, numerical examples are presented to support the theoretical results of this paper.
- 1 December 2014
- Published by American Scientific Publishers in Journal of Advanced Mathematics and Applications
- Vol. 3 (2) , 182-194
System of Ordinary Differential Equations Solving Using Cellular Neural Networks
The system of ordinary differential equations (ODEs) occurs in many fields of engineering science, particularly in the studies of electrical circuits, vibrations, chemical reactions and so on. In this paper we introduce analog cellular computing for solving ordinary differential equations (ODEs) based on cellular neural networks (CNNs) and study the stability. We apply the CNN to analyze and obtain the approximate solutions of the dynamics of (ODEs). The first system consists of two coupled of non-homogenous linear ordinary differential equations which is the Electrical network obtained from (Kirchhoff's Voltage Law) (Kreyszig, 2005). The second system consists of three coupled of non-homogenous nonlinear ordinary differential equations (Li et al., 2007). The computation based on CNN is advantageous as it provides accurate and ultra-fast solutions of ODEs.
- 1 December 2014
- Published by American Scientific Publishers in Journal of Advanced Mathematics and Applications
- Vol. 3 (2) , 182-194
System of Ordinary Differential Equations Solving Using Cellular Neural Networks
The system of ordinary differential equations (ODEs) occurs in many fields of engineering science, particularly in the studies of electrical circuits, vibrations, chemical reactions and so on. In this paper we introduce analog cellular computing for solving ordinary differential equations (ODEs) based on cellular neural networks (CNNs) and study the stability. We apply the CNN to analyze and obtain the approximate solutions of the dynamics of (ODEs). The first system consists of two coupled of non-homogenous linear ordinary differential equations which is the Electrical network obtained from (Kirchhoff's Voltage Law) (Kreyszig, 2005). The second system consists of three coupled of non-homogenous nonlinear ordinary differential equations (Li et al., 2007). The computation based on CNN is advantageous as it provides accurate and ultra-fast solutions of ODEs.
- 28 October 2014
- Published by Emerald Publishing in International Journal of Numerical Methods for Heat & Fluid Flow
- Vol. 24 (8) , 1736-1754
New numerical technique for solving the fractional Huxley equation
Purpose: – The purpose of this paper is to investigate the possibility of extension to the variational iteration and the Adomian decomposition methods for solving nonlinear Huxley equation with time-fractional derivative. Design/methodology/approach: – Objectives achieved the main methods: the fractional derivative of f (x) in the Caputo sense is first stated. Second, the time-fractional Huxley equation is written in a differential operator form where the differential operator is in Caputo sense. After acting on both sides by the inverse operator of the fractional differential operator in Caputo sense, the Adomian's decomposition is then used to get the power series solution of the resulted time-fractional Huxley equation. Also, a second objective is achieved by applying the variational iteration method to get approximate solutions for the time-fractional Huxley equation. Findings: – There are some important findings to state and summarize here. First, the variational iteration method and the decomposition method provide the solutions in terms of convergent series with easily computable components for this considered problem. Second, it seems that the approximate solution of time-fractional Huxley equation using the decomposition method converges faster than the approximate solution using the variational iteration method. Third, the variational iteration method handles nonlinear equations without any need for the so-called Adomian polynomials. However, Adomian decomposition method provides the components of the exact solution, where these components should follow the summation given in Equation (21). Originality/value: – This paper presents new materials in terms of employing the variational iteration and the Adomian decomposition methods to solve the problem under consideration. It is expected that the results will give some insightful conclusions for the used techniques to handle similar fractional differential equations. This emphasizes the fact that the two methods are applicable to a broad class of nonlinear problems in fractional differential equations.
- 28 October 2014
- Published by Emerald Publishing in International Journal of Numerical Methods for Heat & Fluid Flow
- Vol. 24 (8) , 1736-1754
New numerical technique for solving the fractional Huxley equation
Purpose: – The purpose of this paper is to investigate the possibility of extension to the variational iteration and the Adomian decomposition methods for solving nonlinear Huxley equation with time-fractional derivative. Design/methodology/approach: – Objectives achieved the main methods: the fractional derivative of f (x) in the Caputo sense is first stated. Second, the time-fractional Huxley equation is written in a differential operator form where the differential operator is in Caputo sense. After acting on both sides by the inverse operator of the fractional differential operator in Caputo sense, the Adomian's decomposition is then used to get the power series solution of the resulted time-fractional Huxley equation. Also, a second objective is achieved by applying the variational iteration method to get approximate solutions for the time-fractional Huxley equation. Findings: – There are some important findings to state and summarize here. First, the variational iteration method and the decomposition method provide the solutions in terms of convergent series with easily computable components for this considered problem. Second, it seems that the approximate solution of time-fractional Huxley equation using the decomposition method converges faster than the approximate solution using the variational iteration method. Third, the variational iteration method handles nonlinear equations without any need for the so-called Adomian polynomials. However, Adomian decomposition method provides the components of the exact solution, where these components should follow the summation given in Equation (21). Originality/value: – This paper presents new materials in terms of employing the variational iteration and the Adomian decomposition methods to solve the problem under consideration. It is expected that the results will give some insightful conclusions for the used techniques to handle similar fractional differential equations. This emphasizes the fact that the two methods are applicable to a broad class of nonlinear problems in fractional differential equations.
- 1 December 2013
- Published by Elsevier in Mathematical and Computer Modelling
- Vol. 58 (11-12) , 1738-1754
A finite iterative algorithm for the solution of Sylvester-conjugate matrix equationsand- 1 December 2013
- Published by Elsevier in Mathematical and Computer Modelling
- Vol. 58 (11-12) , 1738-1754
A finite iterative algorithm for the solution of Sylvester-conjugate matrix equationsand