Abstract
Recently, Sasaki et al. presented an approximate factorization algorithm of multivariate polynomials. The algorithm calculates irreducible factors by investigating linear combinations of the same power of approximate roots. In this paper, we show that various kinds of multivariate polynomial factorizations can be performed by this method. We present algorithms for factorization of multivariate polynomials over power-series rings, over the integers, over algebraic number fields including algebraically closed fields, and over algebraic function fields. Furthermore, we discuss applicability of this method to univariate polynomial factorization.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Japan Journal of Industrial and Applied Mathematics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.