Derivative free Davidon-Fletcher-Powell (DFP) for solving symmetric systems of nonlinear equations

Mamat, M. and Dauda, M.K. and Mohamed, M.A. and Waziri, M.Y. and Mohamad, F.S. and Abdullah, H. (2018) Derivative free Davidon-Fletcher-Powell (DFP) for solving symmetric systems of nonlinear equations. In: International Conference on Operations Research 2017, 12 Oct 2017, Tangerang Selatan, Indonesia.

[img] Image
Restricted to Registered users only

Download (141kB)
[img] Text
Restricted to Registered users only

Download (317kB)


Research from the work of engineers, economist, modelling, industry, computing, and scientist are mostly nonlinear equations in nature. Numerical solution to such systems is widely applied in those areas of mathematics. Over the years, there has been significant theoretical study to develop methods for solving such systems, despite these efforts, unfortunately the methods developed do have deficiency. In a contribution to solve systems of the form F (x) = 0, x is an element of R-n, a derivative free method via the classical Davidon-Fletcher-Powell (DFP) update is presented. This is achieved by simply approximating the inverse Hessian matrix with Q(k+1)(-1) to theta I-k. The modified method satisfied the descent condition and possess local superlinear convergence properties. Interestingly, without computing any derivative, the proposed method never fail to converge throughout the numerical experiments. The output is based on number of iterations and CPU time, different initial starting points were used on a solve 40 benchmark test problems. With the aid of the squared norm merit function and derivative-free line search technique, the approach yield a method of solving symmetric systems of nonlinear equations that is capable of significantly reducing the CPU time and number of iteration, as compared to its counterparts. A comparison between the proposed method and classical DFP update were made and found that the proposed methodis the top performer and outperformed the existing method in almost all the cases. In terms of number of iterations, out of the 40 problems solved, the proposed method solved 38 successfully, (95%) while classical DFP solved 2 problems (i.e. 05%). In terms of CPU time, the proposed method solved 29 out of the 40 problems given, (i.e. 72.5%) successfully whereas classical DFP solves 11 (27.5%). The method is valid in terms of derivation, reliable in terms of number of iterations and accurate in terms of CPU time. Thus, suitable and achived the objective.

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: conjugate-gradient coefficients, global convergence, algorithm, search
Subjects: Q Science > QA Mathematics
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Faculty of Informatics & Computing
Depositing User: Muhammad Akmal Azhar
Date Deposited: 22 Nov 2020 03:20
Last Modified: 22 Nov 2020 03:20

Actions (login required)

View Item View Item