IN a recent paper1 the author suggested that Lin's reduced penultimate remainder process could still be used to find the real or complex linear factors of polynomials of any degree, even when the process originally described by Lin2 was divergent, provided that the initial approximation to the linear factor being sought, and the two succeeding iterates, could be regarded as differing from the root sought by a small quantity of the first order. The main principle used was that in this linear case the convergence or divergence of the successive iterates to or from the root being sought was purely geometric, so that (for a sufficiently close starting approximation) the root being sought could be deduced from two iterations; complex numbers, however, might be involved in the iteration process.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Factorizing Polynomials


    Subtitle :

    Factorizing Polynomials from Two Rounds of Lin's Reduced Penultimate Remainder Process with a Real Divisor


    Contributors:
    Head, J.W. (author)

    Published in:

    Publication date :

    1957-06-01


    Size :

    2 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Correlation Search for Binary Objects in Images by Factorizing Raster Matrices

    Ablameyko, S. V. / Bogush, R. P. / Mal tsev, S. V. | British Library Online Contents | 2002


    Inspection by Implicit Polynomials

    Unsalan, C. / Ercil, A. / IEEE | British Library Conference Proceedings | 1999


    More Primes and Polynomials

    Elliott, P. D. | British Library Online Contents | 2003


    Scalar and Matrix Quasi-Polynomials

    Rosenwasser, Efim N. / Jeinsch, Torsten / Drewelow, Wolfgang | Springer Verlag | 2023


    Irreducibility of some Faber polynomials

    Guerzhoy, P. | British Library Online Contents | 2008