METODE NEWTON BISECTRIX UNTUK MENYELESAIKAN PERSAMAAN NONLINEAR

Daimah

Home
→
UR - Student Paper Degree
→
Faculty of Mathematics and Natural Sciences
→
Mathematics
→
View Item

dc.contributor.author	Daimah
dc.date.accessioned	2016-04-27T03:06:01Z
dc.date.available	2016-04-27T03:06:01Z
dc.date.issued	2016-04-27
dc.identifier.other	wahyu sari yeni
dc.identifier.uri	http://repository.unri.ac.id/xmlui/handle/123456789/8288
dc.description.abstract	This article discusses Bisectrix Newton’s method to solve a nonlinear equation. The method is obtained by applying bisectrix rule of two gradient lines derived from the application of two iterations of Newton’s method in a row. Analytically it is shown that this method has a third order of convergence. Computational tests show that Bisectrix Newton’s method is better than Newton’s method in terms of the number of iterations for obtaining a root of a nonlinear equation.	en_US
dc.description.provenance	Submitted by wahyu sari yeni (ayoe32@ymail.com) on 2016-04-27T03:06:01Z No. of bitstreams: 1 ArtikelDai.pdf: 677532 bytes, checksum: c950152ce1e0da7bc6d1bb7d56251cf9 (MD5)	en
dc.description.provenance	Made available in DSpace on 2016-04-27T03:06:01Z (GMT). No. of bitstreams: 1 ArtikelDai.pdf: 677532 bytes, checksum: c950152ce1e0da7bc6d1bb7d56251cf9 (MD5)	en
dc.description.sponsorship	Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Riau	en_US
dc.language.iso	en	en_US
dc.subject	iterative method	en_US
dc.subject	Bisectrix Newton’s method,	en_US
dc.subject	Bisectrix Newton’s method	en_US
dc.subject	Newton’s Method	en_US
dc.subject	order of convergence	en_US
dc.title	METODE NEWTON BISECTRIX UNTUK MENYELESAIKAN PERSAMAAN NONLINEAR	en_US
dc.type	student Paper Post Degree	en_US