Abstract
This paper generalizes a recent result onsimple factorization of 2-variable (2-v) polynomials to simple andgroup factorization ofn-variate (n-v), (n≥3) polynomials. The emphasis is on developing a reliablenumerical technique for factorization. It is shown that simple as well as group factorization can be achieved by performing singular value decomposition (SVD) on certain matrices obtained from the coefficients of the givenn-v polynomial expressed in a Kronecker product form. For the polynomials that do not have “exact” simple and/or group factors, the concepts of approximate simple and group factorization are developed. The use of SVD leads to an elegant solution of an approximaten factorization problem. Several nontrivial examples are included to illustrate the results presented in this paper.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
