JSTOR Daily

APPLICATION OF NEWTON'S AND CHEBYSHEV'S METHODS TO PARALLEL FACTORIZATION OF POLYNOMIALS

Journal of Computational Mathematics, Vol. 19, No. 4 (JULY 2001), pp. 347-356 (10 pages) In this paper it is shown in two different ways that one of the family of parallel iterations to determine all ...
Scientific Research Publishing

Tessa, O.M. and Salou, M. (2014) Estimated Bounds for Zeros of Polynomials from Traces of Graeffe. Advances in Linear Algebra & Matrix Theory, 4, 210-215.

ABSTRACT: The goal of this study is to propose a method of estimation of bounds for roots of polynomials with complex coefficients. A well-known and easy tool to obtain such information is to use the ...
JSTOR Daily

Explicit Construction of Universal Operator Algebras and Applications to Polynomial Factorization

Using the characterization of unital operator algebras developed in [6], we give explicit internal definitions of the free product and the maximal operator-algebra tensor product of operator algebras ...
IEEE

Testing a polynomial for zeros inside the unit-circle over the ring of Gaussian integers

Abstract: The paper considers a Gaussian-integer preserving (GIP) form for the author's method to test whether a polynomial with complex coefficients has its zeros inside the unit-circle (is 'stable') ...