Newton's Method as a Formal Recurrence

Simple item page
dc.creatorCanary, Hal
dc.creatorEdquist, Carl
dc.creatorLachterman, Samuel
dc.creatorYounger, Brendan
dc.date2004-07-07
dc.date.accessioned2026-07-07T05:10:03Z
dc.date.available2026-07-07T05:10:03Z
dc.descriptionIterating Newton's method symbolically for the general quadratic yields a rational function, the numerator and denominator of which are polynomials with highly composite coefficients.
dc.description5 pages
dc.identifierhttps://arxiv.org/abs/math/0407115
dc.identifierhttp://arxiv.org/abs/math/0407115
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/71808
dc.subjectCombinatorics
dc.titleNewton's Method as a Formal Recurrence
dc.typetext

Files

Collections

arXiv