A root-finding algorithm for cubics

dc.contributor.author	Northshield, Sam
dc.date.accessioned	2018-04-05T19:53:36Z
dc.date.accessioned	2020-06-22T14:35:29Z
dc.date.available	2018-04-05T19:53:36Z
dc.date.available	2020-06-22T14:35:29Z
dc.date.issued	2013
dc.identifier.citation	Northshield, S. (2013). A root-finding algorithm for cubics. Proceedings of the American Mathematical Society, 141(2). http://doi.org/10.1090/S0002-9939-2012-11324-3	en_US
dc.identifier.uri	http://hdl.handle.net/20.500.12648/1113
dc.description	This article has been published in Proceedings of the American Mathematical Society: https://doi.org/10.1090/S0002-9939-2012-11324-3	en_US
dc.description.abstract	Newton's method applied to a quadratic polynomial converges rapidly to a root for almost all starting points and almost all coefficients. This can be understood in terms of an associative binary operation arising from 2 x 2 matrices. Here we develop an analogous theory based on 3 x 3 matrices which yields a two-variable generally convergent algorithm for cubics.	en_US
dc.language	en_US	en_US
dc.language.iso	en_US	en_US
dc.publisher	Proceedings of the American Mathematical Society	en_US
dc.subject	Newton's method	en_US
dc.subject	iterative algorithm	en_US
dc.subject	generally convergent	en_US
dc.title	A root-finding algorithm for cubics	en_US
dc.type	Article	en_US
refterms.dateFOA	2020-06-22T14:35:29Z
dc.description.institution	SUNY Plattsburgh

Name:

fulltext.pdf

Size:

140.8Kb

Format:

PDF

Description:

full-text