Diyashvir Kreetee Rajiv Babajee

Dr. Diyashvir Kreetee Rajiv Babajee


Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

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

Representative Publications

View All Publications

9 October 2015 in Algorithms
Verified
Journal Article
Open access
PDF file
DBDiyashvir Kreetee Rajiv Babajee
Diyashvir Kreetee Rajiv Babajee
KMKalyanasundaram Madhu
Kalyanasundaram Madhu
JJJayakumar Jayaraman
Jayakumar Jayaraman
In this work, we have developed a fourth order Newton-like method based on harmonic mean and its multi-step version for solving system of nonlinear equations. The new fourth order method requires evaluation of one function and two first order Fréchet derivatives for each iteration. The multi-step version requires one more function evaluation for each iteration. The proposed new scheme does not require the evaluation of second or higher order Fréchet derivatives and still reaches fourth order convergence. The multi-step version converges with order 2r+4, where r is a positive integer and r ≥ 1. We have proved that the root α is a point of attraction for a general iterative function, whereas the proposed new schemes also satisfy this result. Numerical experiments including an application to 1-D Bratu problem are given to illustrate the efficiency of the new methods. Also, the new methods are compared with some existing methods.

24 December 2015 in Algorithms
Verified
Journal Article
Open access
PDF file
DBDiyashvir Kreetee Rajiv Babajee
Diyashvir Kreetee Rajiv Babajee
Kung-Traub’s conjecture states that an optimal iterative method based on d function evaluations for finding a simple zero of a nonlinear function could achieve a maximum convergence order of 2 d−1. During the last years, many attempts have been made to prove this conjecture or develop optimal methods which satisfy the conjecture. We understand from the conjecture that the maximum order reached by a method with three function evaluations is four, even for quadratic functions. In this paper, we show that the conjecture fails for quadratic functions. In fact, we can find a 2-point method with three function evaluations reaching fifth order convergence. We also develop 2-point 3rd to 8th order methods with one function and two first derivative evaluations using weight functions. Furthermore, we show that with the same number of function evaluations we can develop higher order 2-point methods of order r + 2 , where r is a positive integer, ≥ 1 . We also show that we can develop a higher order method with the same number of function evaluations if we know the asymptotic error constant of the previous method. We prove the local convergence of these methods which we term as Babajee’s Quadratic Iterative Methods and we extend these methods to systems involving quadratic equations. We test our methods with some numerical experiments including an application to Chandrasekhar’s integral equation arising in radiative heat transfer theory.

4 September 2015 in Afrika Matematika
Verified
Journal Article
Closed access
PDF file
DBDiyashvir Kreetee Rajiv Babajee
Diyashvir Kreetee Rajiv Babajee
KMKalyanasundaram Madhu
Kalyanasundaram Madhu
JJJayakumar Jayaraman
Jayakumar Jayaraman


31 December 2013 in Procedia Computer Science
Verified
Journal Article
Open access
DKDost Muhammad Khan
Dost Muhammad Khan
NMNawaz Mohamudally
Nawaz Mohamudally
DBDiyashvir Kreetee Rajiv Babajee
Diyashvir Kreetee Rajiv Babajee
The pattern extraction and discovery of useful information from a dataset are the foremost purposes of data mining; the outcome of this process is the ‘knowledge’ which is helpful in taking the decision. For the past decade there have been multiple attempts and strong beliefs in the development and the formulation of the unified data mining frameworks that would answer to the fundamental versions related to the discovery of knowledge. In this paper we are presenting a novel unified framework for data mining conceptualized through the composite functions. The framework is further illustrated with a variety of real life datasets using different data mining algorithms.