Mohammed A. Hafiz
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
Research Interests
Mohammed A. Hafiz has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
Y.G. Youssif
Department of Mathematics, Faculty of Science, Mansoura University, Mansoura, Egypt
3 shared publicationsM.E. Fares
2 shared publicationsMustafa Q. Khirallah
2 shared publicationsA. E. Alamir
1 shared publication- Alhadi E. Alamir
Department of Mathematics, Najran University, Najran,1988, Saudi Arabia.
1 shared publication Fawzi Zarzoura
1 shared publication
Latest Publications
- Open Access
- 1 January 2015
- Published by American Institute of Mathematical Sciences (AIMS) in Mathematical Biosciences and Engineering
- Vol. 12 (4) , 687-697
Mathematical probit and logistic mortality models of the Khapra beetle fumigated with plant essential oils
In the current study, probit and logistic models were employed to fit experimental mortality data of the Khapra beetle, Trogoderma granarium (Everts) (Coleoptera: Dermestidae), when fumigated with three plant oils of the gens Achillea. A generalized inverse matrix technique was used to estimate the mortality model parameters instead of the usual statistical iterative maximum likelihood estimation. As this technique needs to perturb the observed mortality proportions if the proportions include 0 or 1, the optimal perturbation in terms of minimum least squares ($L_2$) error was also determined. According to our results, it was better to log-transform concentration and time as explanatory variables in modeling mortality of the test insect. Estimated data using the probit model were more accurate in terms of $L_2$ errors, than the logistic one. Results of the predicted mortality revealed also that extending the fumigation period could be an effective control strategy, even, at lower concentrations. Results could help in using a relatively safe and effective strategy for the control of this serious pest using alternative control strategy to reduce the health and environmental drawbacks resulted from the excessive reliance on the broadly toxic chemical pesticides and in order to contribute safeguard world-wide grain supplies.- 1 January 2015
- Published by American Institute of Mathematical Sciences (AIMS) in Mathematical Biosciences and Engineering
- Vol. 12 (4) , 687-697
Open AccessMathematical probit and logistic mortality models of the Khapra beetle fumigated with plant essential oils
In the current study, probit and logistic models were employed to fit experimental mortality data of the Khapra beetle, Trogoderma granarium (Everts) (Coleoptera: Dermestidae), when fumigated with three plant oils of the gens Achillea. A generalized inverse matrix technique was used to estimate the mortality model parameters instead of the usual statistical iterative maximum likelihood estimation. As this technique needs to perturb the observed mortality proportions if the proportions include 0 or 1, the optimal perturbation in terms of minimum least squares ($L_2$) error was also determined. According to our results, it was better to log-transform concentration and time as explanatory variables in modeling mortality of the test insect. Estimated data using the probit model were more accurate in terms of $L_2$ errors, than the logistic one. Results of the predicted mortality revealed also that extending the fumigation period could be an effective control strategy, even, at lower concentrations. Results could help in using a relatively safe and effective strategy for the control of this serious pest using alternative control strategy to reduce the health and environmental drawbacks resulted from the excessive reliance on the broadly toxic chemical pesticides and in order to contribute safeguard world-wide grain supplies. - Open Access
- 10 January 2014
- Published by Sciencedomain International in British Journal of Mathematics & Computer Science
- Vol. 4 (1) , 90-103
Solving Nonlinear Systems Using Fourth Order Iterative Method
In this paper, an efficient decomposition method is constructed and used for solving system of nonlinear equations. These methods based on the modified homotopy technique of Noor [1]. This technique is revised to solve the system of nonlinear equations. Our approach yields third and fourth order iterative methods which are more efficient than their classical counterparts such as Newton’s, Chebychev’s and Halley’s methods.
- 10 January 2014
- Published by Sciencedomain International in British Journal of Mathematics & Computer Science
- Vol. 4 (1) , 90-103
Open AccessSolving Nonlinear Systems Using Fourth Order Iterative Method
In this paper, an efficient decomposition method is constructed and used for solving system of nonlinear equations. These methods based on the modified homotopy technique of Noor [1]. This technique is revised to solve the system of nonlinear equations. Our approach yields third and fourth order iterative methods which are more efficient than their classical counterparts such as Newton’s, Chebychev’s and Halley’s methods.
- Open Access
- 29 April 2013
- Published by Academic Publications in International Journal of Differential Equations and Applications
- Vol. 12 (1)
SOLVING SYSTEM OF NONLINEAR EQUATIONS USING FAMILY OF JARRATT METHODS
The aim of this paper is generalization fourth order Jarratt formulaiterative methods for solving system of nonlinear equations (SNLE) ofn-dimension with n-variables. We present three algorithms for solving(SNLE). We prove that these algorithms have convergence. Several numericalexamples are tested of the new iterative methods. These new algorithms maybe viewed as an extensions and generalizations of the existing methods forsolving the system of nonlinear equations.
- 29 April 2013
- Published by Academic Publications in International Journal of Differential Equations and Applications
- Vol. 12 (1)
Open AccessSOLVING SYSTEM OF NONLINEAR EQUATIONS USING FAMILY OF JARRATT METHODS
The aim of this paper is generalization fourth order Jarratt formulaiterative methods for solving system of nonlinear equations (SNLE) ofn-dimension with n-variables. We present three algorithms for solving(SNLE). We prove that these algorithms have convergence. Several numericalexamples are tested of the new iterative methods. These new algorithms maybe viewed as an extensions and generalizations of the existing methods forsolving the system of nonlinear equations.
- Open Access
- 29 April 2013
- Published by Academic Publications in International Journal of Differential Equations and Applications
- Vol. 12 (2)
SOLVING SYSTEM OF NONLINEAR EQUATIONS USING FAMILY OF JARRATT METHODS
The aim of this paper is generalization fourth order Jarratt formulaiterative methods for solving system of nonlinear equations (SNLE) ofn-dimension with n-variables. We present three algorithms for solving(SNLE). We prove that these algorithms have convergence. Several numericalexamples are tested of the new iterative methods. These new algorithms maybe viewed as an extensions and generalizations of the existing methods forsolving the system of nonlinear equations.
- 29 April 2013
- Published by Academic Publications in International Journal of Differential Equations and Applications
- Vol. 12 (2)
Open AccessSOLVING SYSTEM OF NONLINEAR EQUATIONS USING FAMILY OF JARRATT METHODS
The aim of this paper is generalization fourth order Jarratt formulaiterative methods for solving system of nonlinear equations (SNLE) ofn-dimension with n-variables. We present three algorithms for solving(SNLE). We prove that these algorithms have convergence. Several numericalexamples are tested of the new iterative methods. These new algorithms maybe viewed as an extensions and generalizations of the existing methods forsolving the system of nonlinear equations.
- Open Access
- 1 April 2013
- Published by Egyptian Knowledge Bank in Journal of the Egyptian Mathematical Society
- Vol. 21 (1) , 38-43
Solving nonsmooth equations using family of derivative-free optimal methods
In this paper, a family of derivative-free of third and fourth order convergent methods for solving nonlinear equations is suggested. In the proposed methods, several linear combinations of divided differences are used in order to get a good estimation of the derivative of the given function at the different steps of the iteration. The efficiency indices of the members of this family are equal to 1.442 and 1.587. The convergence and error analysis are given. Numerical comparisons are made with other existing methods to show the performance of the presented methods
- 1 April 2013
- Published by Egyptian Knowledge Bank in Journal of the Egyptian Mathematical Society
- Vol. 21 (1) , 38-43
Open AccessSolving nonsmooth equations using family of derivative-free optimal methods
In this paper, a family of derivative-free of third and fourth order convergent methods for solving nonlinear equations is suggested. In the proposed methods, several linear combinations of divided differences are used in order to get a good estimation of the derivative of the given function at the different steps of the iteration. The efficiency indices of the members of this family are equal to 1.442 and 1.587. The convergence and error analysis are given. Numerical comparisons are made with other existing methods to show the performance of the presented methods
- Open Access
- 1 November 2012
- Published by SciPress Ltd in Bulletin of Mathematical Sciences and Applications
- Vol. 2, 1-12
Novel Three Order Methods for Solving a System of Nonlinear Equations
Volume 2: Novel Three Order Methods for Solving a System of Nonlinear Equations
- 1 November 2012
- Published by SciPress Ltd in Bulletin of Mathematical Sciences and Applications
- Vol. 2, 1-12
Open AccessNovel Three Order Methods for Solving a System of Nonlinear Equations
Volume 2: Novel Three Order Methods for Solving a System of Nonlinear Equations
- Open Access
- 1 September 2012
- Published by SciPress Ltd in The Bulletin of Society for Mathematical Services and Standards
- Vol. 3, 37-45
Solving Nonsmooth Equations Using Derivative-Free Methods
Volume 3: Solving Nonsmooth Equations Using Derivative-Free Methods
- 1 September 2012
- Published by SciPress Ltd in The Bulletin of Society for Mathematical Services and Standards
- Vol. 3, 37-45
Open AccessSolving Nonsmooth Equations Using Derivative-Free Methods
Volume 3: Solving Nonsmooth Equations Using Derivative-Free Methods
- Open Access
- 1 January 2012
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2012 (1)
An Algorithm for Fast Computation of 3D Zernike Moments for Volumetric Images
An algorithm was proposed for very fast and low‐complexity computation of three‐dimensional Zernike moments. The 3D Zernike moments were expressed in terms of exact 3D geometric moments where the later are computed exactly through the mathematical integration of the monomial terms over the digital image/object voxels. A new symmetry‐based method was proposed to compute 3D Zernike moments with 87% reduction in the computational complexity. A fast 1D cascade algorithm was also employed to add more complexity reduction. The comparison with existing methods was performed, where the numerical experiments and the complexity analysis ensured the efficiency of the proposed method especially with image and objects of large sizes.
- 1 January 2012
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2012 (1)
Open AccessAn Algorithm for Fast Computation of 3D Zernike Moments for Volumetric Images
An algorithm was proposed for very fast and low‐complexity computation of three‐dimensional Zernike moments. The 3D Zernike moments were expressed in terms of exact 3D geometric moments where the later are computed exactly through the mathematical integration of the monomial terms over the digital image/object voxels. A new symmetry‐based method was proposed to compute 3D Zernike moments with 87% reduction in the computational complexity. A fast 1D cascade algorithm was also employed to add more complexity reduction. The comparison with existing methods was performed, where the numerical experiments and the complexity analysis ensured the efficiency of the proposed method especially with image and objects of large sizes.