Laguerre's method for finding these quantities is one of many algorithms that "polishes" them by repeatedly "deflating" a function.
Laguerre's method for finding these quantities is one of many algorithms that "polishes" them by repeatedly "deflating" a function. An algorithm that finds these quantities successively computes "x sub n" by subtracting the expression "f of x sub 0 divided by f prime of x sub 0" from "x sub n minus 1." An upper bound on the number of these quantities can be found with Descartes' (*) Rule of Signs. There is no general method for finding these quantities for expressions higher than the fourth degree according to the AbelRuffini theorem. These quantities, which can be found using the Newton-Raphson method, are defined as inputs to a function such that it outputs zero. For 10 points, name these quantities that are given by the quadratic formula for trinomials.
Laguerre's method for finding these quantities is one of many algorithms that "polishes" them by repeatedly "deflating" a function.
roots [or zeroes before the word "zero" is read]