Abstract

In this paper, some approaches are presented for the approximate factorization of unfactorable multivariable polynomials. An iterative algorithm which can be shown to be convergent is developed on the basis of coefficient matching in the least-squares sense. For the approximate separation of polynomials—a special case of approximate factorization—a noniterative algorithm is proposed by means of the singular value decomposition concept. Examples of the two-variable case are presented to illustrate the utility of the approaches. The techniques described can directly be utilized for the design of 2-D digital filters (see, e.g., Antoniou and Lu, 1987).

Full Text
Paper version not known

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 call

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.