Skip to main content
SpringerLink
Log in

Notes on n-D Polynomial Matrix Factorizations

  • Published:
Multidimensional Systems and Signal Processing Aims and scope Submit manuscript

Abstract

This paper discusses a relationship between the prime factorizability of a normal full rank n-D ( n>2) polynomial matrix and its reduced minors. Two conjectures regarding the n-D polynomial matrix prime factorization problem are posed, and a partial solution to one of the conjectures is provided. Another related open problem of factorizing an n-D polynomial matrix that is not of normal full rank as a product of two n-D polynomial matrices of smaller size is also considered, and a partial solution to this problem is presented. An illustrative example is worked out in details.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. N. K. Bose, Applied Multidimensional Systems Theory, New York: Van Nostrand Reinhold, 1982.

    Google Scholar 

  2. N. K. Bose, Ed., Multidimensional Systems Theory: Progress, Directions and Open Problems, Dordrecht, The Netherlands: Reidel, 1985.

    Google Scholar 

  3. M. Morf, B. C. Lévy and S.Y. Kung, “NewResults in 2-D Systems Theory, Part I: 2-D Polynomial Matrices, Factorization and Coprimeness,” Proc. IEEE, vol. 65, June 1977, pp. 861–872.

  4. J. P. Guiver and N. K. Bose, “Polynomial Matrix Primitive Factorization Over Arbitrary Coefficient Field and Related Results,” IEEE Trans. Circuits Syst., vol. 29, Oct. 1982, pp. 649–657.

  5. S. Basu and A. C. Tan, “On a Generalized Factorization Problem for Structurally Passive Synthesis of Digital Filters,” IEEE Trans. Circuits Syst., vol. 36, 1989, pp. 1529–1543.

    Google Scholar 

  6. D. C. Youla and G. Gnavi, “Notes on n-Dimensional System Theory,” IEEE Trans. Circuits Syst., vol. 26, Feb. 1979, pp. 105–111.

  7. Z. Lin, “On Matrix Fraction Descriptions of Multivariable Linear n-D Systems,” IEEE Trans. Circuits Syst., vol. 35, 1988, pp. 1317–1322.

    Google Scholar 

  8. Z. Lin, “On Primitive Factorizations for 3-D Polynomial Matrices,” IEEE Trans. Circuits Syst., vol. 39, Dec., 1992, pp. 1024–1027.

  9. Z. Lin, “On Primitive Factorizations for n-D Polynomial Matrices,” in Proc. IEEE Symp. Circuits and Systems, Chicago, Illinois, May, 1993, pp. 595–598.

  10. H. Park, T. Kalker and M. Vertterli, “Gröbner Bases and Multidimensional FIR Multirate Systems,” Multidimensional Systems and Signal Processing, vol. 8, 1997, pp. 11–30.

    Google Scholar 

  11. E. Fornasini and M. E. Valcher, “nD Polynomial Matrices with Applications to Multidimensional Signal Analysis,” Multidimensional Systems and Signal Processing, vol. 8, Oct. 1997, pp. 387–408.

  12. Z. Lin, “Feedback Stabilizability of MIMO n-D Linear Systems,” Multidimensional Systems and Signal Processing, vol. 9, 1998, pp. 149–172.

    Google Scholar 

  13. N. K. Bose and C. Charoenlarpnopparut “Multivariate Matrix Factorization: New Results,” presented at MTNS'98, padova, Italy, July, 1998.

  14. T. Kailath, Linear Systems, Englewood Cliffs, NJ: Prentice Hall, 1980.

    Google Scholar 

  15. D. Quillen, “Projective Modules Over Polynomial Rings,” Invent. Math, vol. 36, 1976, pp. 167–171.

    Google Scholar 

  16. A. A. Suslin, “Projective Modules Over a Polynomial Ring Are Free,” Soviet Math Dokl., vol. 17, 1976, pp. 1160–1164.

    Google Scholar 

  17. D. C. Youla and P. F. Pickel, “The Quillen- Suslin Theorem and the Structure of n-Dimensional Elementary Polynomial Matrices,” IEEE Trans. Circuits Syst., vol. 31, 1984, pp. 513–518.

    Google Scholar 

  18. B. Buchberger, “Gröbner Bases: An Algorithmic Method in Polynomial Ideal Theory,” in Multidimensional Systems Theory: Progress, Directions and Open Problems (N. K. Bose, ed.), Dordrecht: Reidel, 1985, p. 184.

    Google Scholar 

  19. A. Logar and B. Sturmfels, “Algorithms for the Quillen- Suslin Theorem,” J. Algebra, vol. 145, 1992, pp. 231–239.

    Google Scholar 

  20. H. Park and C. Woodburn, “An Algorithmic Proof of Suslin's Stability Theorem for Polynomial Rings,” J. Algebra, vol. 178, 1995, pp. 277–298.

    Google Scholar 

  21. H. Park, “A Computational Theory of Laurent Polynomial Rings and Multidimensional FIR Systems,” Ph.D. thesis, Univ. of Californial at Berkeley, 1995.

    Google Scholar 

  22. V. R. Sule, “Feedback Stabilization Over Commutative Rings: The Matrix Case,” SIAM J. Contr. Optim., vol. 32, 1994, pp. 1675–1695.

    Google Scholar 

  23. G. M. Greuel, G. Pfister, and H. Schonemann, Singular Reference Manual, Reports on Computer Algebra, No. 12, Centre of Algebra, University of Kaiserslautern, Germany. (Available from http://www.mathematik.uni-kl.de/»zca/Singular).

  24. F. R. Gantmacher, Theory of Matrices, vol. I and II, New York: Chelsea, 1959.

Download references

Author information

Authors and Affiliations

  1. School of Electrical and Electronic Engineering, Nanyang Technological University, Block S2, Nanyang Avenue, Singapore, 639798

    Zhiping Lin

Authors
  1. Zhiping Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lin, Z. Notes on n-D Polynomial Matrix Factorizations. Multidimensional Systems and Signal Processing 10, 379–393 (1999). https://doi.org/10.1023/A:1008427830183

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008427830183

Search

Navigation