Abstract: A fast transversal filter for the numerical factorization of polynomials is presented. When all zeros of a polynomial are of different modulus, this algorithm can be used for the ...

Given a monic polynomial f over finite fields F, (i.e. the coefficents of f are in the field F), we will factor f into product of irreducible monic polynomials. (a polynomial is irreducible if it is ...

Abstract: We investigate the right coprime factorization of the transfer function matrix of a linear time-delay system considering constant state and input delays. This transfer function matrix is a ...

A collection of functions for working modular arithmetic, polynomials over finite fields, and related things. Implements factorization of 64 bit numbers using trial division, Pollard's Rho algorithm ...

A method of iteration is developed in terms of a function of somewhat arbitrary character. Sufficient conditions are given for convergence of the process, yielding factors of arbitrary degree for ...