Abstract
Smith normal form computation has many applications in group theory, module theory and number theory. As the entries of the matrix and of its corresponding transformation matrices can explode during the computation, it is a very difficult problem to compute the Smith normal form of large dense matrices. The computation has two main problems: the high execution time and the memory requirements, which might exceed the memory of one processor. To avoid these problems, we develop two parallel Smith normal form algorithms using MPI. These are the first algorithms computing the Smith normal form with corresponding transformation matrices, both over the rings ℤ and \(\mathbb{F}\)[x]. We show that our parallel algorithms both have a good efficiency, i.e. by doubling the processes, the execution time is nearly halved, and succeed in computing the Smith normal form of dense example matrices over the rings ℤ and \(\mathbb{F}_2\)[x] with more than thousand rows and columns.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Fang, X.G., Havas, G.: On the worst-case complexity of integer gaussian elimination. In: Proc. of ISSAC, pp. 28-31 (1997)
Giesbrecht, M.: Fast Computation of the Smith Normal Form of an Integer Matrix. In: Proc. of ISSAC, pp. 110-118 (1995)
Hafner, J.L., McCurley, K.S.: Asymptotically Fast Triangularization of Matrices over Rings. SIAM J. Computing 20(6), 1068–1083 (1991)
Hartley, B., Hawkes, T.O.: Rings, Modules and Linear Algebra. Chapman and Hall, London (1976)
Havas, G., Sterling, L.S.: Integer Matrices and Abelian Groups. In: Ng, K.W. (ed.) EUROSAM 1979 and ISSAC 1979. LNCS, vol. 72, pp. 431–451. Springer, Heidelberg (1979)
Hermite, C.: Sur l’introduction des variables continues dans la théorie des nombres. J. Reine Angew. Math. 41, 191–216 (1851)
Kaltofen, E., Krishnamoorthy, M.S., Saunders, B.D.: Fast parallel computation of Hermite and Smith forms of polynomial matrices. SIAM J. Algebraic and Discrete Methods 8, 683–690 (1987)
Kaltofen, E., Krishnamoorthy, M.S., Saunders, B.D.: Parallel Algorithms for Matrix Normal Forms. Linear Algebra and its Applications 136, 189–208 (1990)
Kannan, R., Bachem, A.: Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix. SIAM J. Computing 8(4), 499–507 (1979)
Kowalsky, H.-J., Michler, G.O.: Lineare Algebra, de Gruyter, Berlin (1998)
Michler, G.O., Staszewski, R.: Diagonalizing Characteristic Matrices on Parallel Machines, Preprint 27, Institut für Experimentelle Mathematik, Universität/GH Essen (1995)
Sims, C.C.: Computation with finitely presented groups. Cambridge University Press, Cambridge (1994)
Smith, H.J.S.: On Systems of Linear Indeterminate Equations and Congruences. Philos. Trans. Royal Soc. London 151, 293–326 (1861)
Storjohann, A.: Computing Hermite and Smith normal forms of triangular integer matrices. Linear Algebra and its Applications 282, 25–45 (1998)
Storjohann, A.: Near Optimal Algorithms for Computing Smith Normal Forms of Integer Matrices. In: Proc. of ISSAC, pp. 267-274 (1996)
Storjohann, A., Labahn, G.: A Fast Las Vegas Algorithm for Computing the Smith Normal Form of a Polynomial Matrix. Linear Algebra and its Applications 253, 155–173 (1997)
Villard, G.: Fast parallel computation of the Smith normal form of poylynomial matrices. In: Proc. of ISSAC, pp. 312-317 (1994)
Wagner, C.: Normalformenberechnung von Matrizen über euklidischen Ringen, Ph.D. Thesis, Institut für Experimentelle Mathematik, Universität/GH Essen (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jäger, G. (2003). Parallel Algorithms for Computing the Smith Normal Form of Large Matrices. In: Dongarra, J., Laforenza, D., Orlando, S. (eds) Recent Advances in Parallel Virtual Machine and Message Passing Interface. EuroPVM/MPI 2003. Lecture Notes in Computer Science, vol 2840. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39924-7_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-39924-7_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20149-6
Online ISBN: 978-3-540-39924-7
eBook Packages: Springer Book Archive