Skip to main content
SpringerLink
Log in

On the computation of the Smith normal form of compound matrices

  • Published:
Numerical Algorithms Aims and scope Submit manuscript

Abstract

Compound matrices are encountered in many fields such as Matrix Theory, Systems Theory, Control Theory, etc. In the present paper we develop an efficient algorithm computing the Smith normal form of compound matrices. This algorithm is based on a new theorem establishing an equivalence relation between the Smith normal form of the compounds of a given matrix and the compounds of the Smith normal form of the given matrix.

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. G.H. Bradley, Algorithms for Hermite and Smith normalmatrices and linear diophantine equations, Math. Comp. 25 (1971) 897–907.

    Article  MATH  MathSciNet  Google Scholar 

  2. R.A. Horn and C.R. Johnson, Matrix Analysis (CambridgeUniv. Press, Cambridge, 1985).

  3. N. Karcanias and C. Giannakopoulos,Grassmann invariants, almost zeros and the determinantal zero pole assignment problems of linear systems, Int. J. Control 40 (1984) 673–698.

    MATH  MathSciNet  Google Scholar 

  4. C. Koukouvinos, M. Mitrouli and J. Seberry, On the Smith normal formof D-optimal designs, Linear Algebra Appl. 247 (1996) 277–295.

    Article  MATH  MathSciNet  Google Scholar 

  5. M. Mitrouli, N. Karcanias and C. Giannakopoulos, The computationalframework of the determinantal assignment problem, in: Proceedings ECC '91 European Control Conference, Grenoble, France (1991) Vol. 1, pp. 98–103.

    Google Scholar 

  6. C.C. Macduffee, The Theory of Matrices (Chelsea,New York, Reprint of 1st ed., 1964).

  7. M. Marcus and H. Minc, ASurvey of Matrix Theory and Matrix Inequalities (Allyn and Bacon, Boston, 1964).

  8. M. Marcus, Matrices and Matlab (Prentice-Hall, Englewood Cliffs,NJ, 1993).

    Google Scholar 

  9. M. Mitrouli and G. Kalogeropoulos, A compound matrixalgorithm for the computation of the Smith form of polynomial matrices, Numer. Algorithms 7 (1994) 145–159.

    Article  MATH  MathSciNet  Google Scholar 

  10. H.J.S. Smith,Arithmetical notes, Proc. London Math. Soc. 4 (1873) 236–253.

    MATH  Google Scholar 

  11. F. Zhang, A majorization conjecture for Hadamard products and compoundmatrices, Linear and Multilinear Algebra 33 (1993) 301–303.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Athens, Panepistemiopolis, GR-15784, Athens, Greece

    M. Mitrouli

  2. Department of Mathematics, National Technical University of Athens, Zografou, GR-15773, Athens, Greece

    C. Koukouvinos

Authors
  1. M. Mitrouli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. Koukouvinos
    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

Mitrouli, M., Koukouvinos, C. On the computation of the Smith normal form of compound matrices. Numerical Algorithms 16, 95–105 (1997). https://doi.org/10.1023/A:1019182912676

Download citation

  • Issue Date:

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

Search

Navigation