Convergence analysis and optimisation of an iterative technique for polynomial factorisation

This paper presents new material which extends the proof of convergence to the quasi-Newton case. Although it is not possible to present a fully general optimisation scheme at this stage, further results are provided which lend weight to the superiority of the technique over more conventional methods for inclusion as part of an iterative network design package.<
>