We consider polynomials of bi-degree (n, 1) over the skew field of quaternions where the indeterminates commute with each other and with all coefficients. Polynomials of this type do not generally ...
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 ...
The code (factorization.py) is not meant to be fast but to be a well-documented, working implementation of the most basic algorithm for factoring univariate polynomials using LLL latice reduction ...
Factorization theorems are obtained for selfadjoint operator polynomials $\mathrm{L}\left(\mathrm{\lambda }\right):=\sum _{\mathrm{j}=0}^{\mathrm{n}}{\mathrm{\lambda ...
Transactions of the American Mathematical Society, Vol. 216 (Feb., 1976), pp. 237-248 (12 pages) Conical polynomials are defined as certain polynomials in quadratic elements of the universal ...
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 ...
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 ...
Abstract: Sorted spectral factorization of matrix polynomials is studied. Such type of factoring Hermitian matrix polynomials is the key step in calculating the optimum receive filter matrices in ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback