No CrossRef data available.
Published online by Cambridge University Press: 14 February 2012
The methods of S. N. Lin (1943) and B. Friedman (1949) for approximating to the factors of a polynomial by iterated division are studied from the point of view of convergence. The general theory, hitherto lacking, is supplied. The matrices which transform the errors in coefficients from one iterate to the next are explicitly found, and the criterion of convergence derived. Numerical examples are given. The tentative conclusion is that the methods are less simple in theory and less adaptable than the method of penultimate remainder, which admits of accelerative devices.