Mark J. Encarnación

Learn More
Modular methods for computing the gcd of two univariate polynomials over an algebraic number field require <italic>a priori</italic> knowledge about the denominators of the rational numbers in the representation of the gcd. We derive a multiplicative bound for these denominators without assuming that the number generating the field is an algebraic integer.(More)
The paper describes improved techniques for factoring univariate polynomials over the integers. The authors modify the usual linear method for lifting modular polynomial factorizations so that eecient early factor detection can be performed. The new lifting method is universally faster than the classical quadratic method, and is faster than a linear method(More)
Trager's algorithm for factoringa univariate polynomialover an algebraic number field computes thenorm of the polynomial and then factors the norm over the integers. It has been observed by the author as well as others that the norm tends to factor modulo a prime into more irreducible factors than one would expect from a typical random polynomial, but no(More)
We consider the following problem: suppose there exist numerical algorithms for obtaining the parameters of <i>n</i> best Chebyshev approximations by different expressions.<i>F<inf>k</inf></i>(<i>A,x</i>) = <i>F<inf>k</inf></i>(<i>a</i><inf>0</inf>, <i>a</i><inf>1</inf>,&amp;hellip;,<i>a<inf>m</inf></i>;<i>x</i>), <i>k</i> = 1,2,&amp;hellip;,<i>n.</i> (1)to(More)
  • 1