FOURTH ORDER ROOT FINDING METHOD OF EULER’S TYPE

KUMNEGER, YIHUNE

dc.contributor.author	KUMNEGER, YIHUNE
dc.date.accessioned	2017-08-17T09:43:08Z
dc.date.available	2017-08-17T09:43:08Z
dc.date.issued	2017-08-17
dc.identifier.uri	http://hdl.handle.net/123456789/7758
dc.description	A project Submitted in Fulfillment of the Requirements for the Degree of Master of Science in Mathematics	en_US
dc.description.abstract	In this project an iterative method of the fourth order for solving nonlinear equations of the form 0)( =xf is discussed. The comparison with other existing methods is performed regarding the computational efficiency and numerical examples. The fourthorder derivative free method for the simultaneous calculation of all polynomial zeros, arising from the proposed method, is also studied. This project is dedicated on the fourth order root finding methods of Euler’s type. We have used Matlab program with its high precision compatibility and we have presented three examples tests to confirm the theoretical results. The results show that Euler fourth order iterative method is converging faster than Newton iterative method.	en_US
dc.subject	Mathematics	en_US
dc.title	FOURTH ORDER ROOT FINDING METHOD OF EULER’S TYPE	en_US
dc.type	Thesis	en_US