Newton's Method as a Formal Recurrence

From MaRDI portal

MaRDI QIDQ6474220zbMATH OpenFDO

Authors Hal Canary, Carl Edquist, Samuel Lachterman, Brendan Younger

Publication date 7 July 2004




Abstract: Iterating Newton's method symbolically for the general quadratic yields a rational function, the numerator and denominator of which are polynomials with highly composite coefficients.












This page was built for publication: Newton's Method as a Formal Recurrence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6474220)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Newton%27s_Method_as_a_Formal_Recurrence&oldid=99657461"
Powered by MediaWiki