Newton's Method as a Formal Recurrence
Combinatorics
2007-05-23 v1
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.
Cite
@article{arxiv.math/0407115,
title = {Newton's Method as a Formal Recurrence},
author = {Hal Canary and Carl Edquist and Samuel Lachterman and Brendan Younger},
journal= {arXiv preprint arXiv:math/0407115},
year = {2007}
}
Comments
5 pages