Abstract
Multivariate (n-D) polynomial matrix factorizations are basic research problems in multidimensional systems and signal processing. In this paper several extensions of the existing results on multivariate matrix factorizations are proved. Moreover, by means of the general theory of multivariate matrix factorizations recently developed, a new proof is given to the bivariate polynomial matrix factorizations. This new approach produces also a recursive algorithm for the actual computation of the general bivariate matrix factorizations, which relies on the algorithm of the Gröbner bases for modules and does not involve calculations over the function fields.
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.
