Computation of the Smith normal form of polynomial matrices

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Computation of the Smith normal form of polynomial matrices

Full text

Pdf (826 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 1993 international symposium on Symbolic and algebraic computation table of contents

Kiev, Ukraine

Pages: 209 - 217

Year of Publication: 1993

ISBN:0-89791-604-2

Author

Gilles Villard

Sponsor

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 6, Downloads (12 Months): 35, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/164081.164127 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	E.H. Bareiss. Computational solution of matrix problems over an integral domain. J. Inst. Math. Appl., 10:68-104, 1972.
	2	S. Cabay , T. P. L. Lam, Congruence Techniques for the Exact Solution of Integer Systems of Linear Equations, ACM Transactions on Mathematical Software (TOMS), v.3 n.4, p.386-397, Dec. 1977 [doi>10.1145/355759.355765]
	3	T.3. Chou and G.E. Collins. Algorithms for the solution of systems of linear diophantine equations. SIAM J. Comput., 11(4):687-708, 1982.
	4	Stephen A. Cook, The Classifikation of Problems which have Fast Parallel Algorithms, Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory, p.78-93, August 21-27, 1983
	5	P. D. Domich , R. Kannan , L. E. Trotter, Jr., Hermite normal form computation using modulo determinant arithmetic, Mathematics of Operations Research, v.12 n.1, p.50-59, Feb. 1987 [doi>10.1287/moor.12.1.50]
	6	M.A. Frumkin. Polynomial time algorithms in the theory of linear diophantine equations. In Fundamentals of Computatzon Theory, pages 386-392. LNCS 56, Springer, New-York, 1977.
	7	F.R. Gantmacher. Thdorie des matrices. Dunod, Paris, France, 1966.
	8	James L. Hafner , Kevin S. McCurley, Asymptotically fast triangularization of matrices over rings, SIAM Journal on Computing, v.20 n.6, p.1068-1083, Dec. 1991 [doi>10.1137/0220067]
	9	Costas S. Iliopoulos, Worst-case complexity bounds on algorithms for computing the canonical structure of finite Abelian groups and the Hermite and Smith normal forms of an integer matrix, SIAM Journal on Computing, v.18 n.4, p.658-669, Aug. 1989 [doi>10.1137/0218045]
	10	E. Kaltofen , M. S. Krishnamoorthy , B. D. Saunders, Fast parallel computation of hermite and smith forms of polynomial matrices, SIAM Journal on Algebraic and Discrete Methods, v.8 n.4, p.683-690, Oct. 1987 [doi>10.1137/0608057]
	11	Erich Kaltofen , M. S. Krishnamoorthy , B. David Saunders, Mr. Smith goes to Las Vegas: Randomized parallel computation of the Smith Normal Form of polynomial matrices, Proceedings of the European Conference on Computer Algebra, p.317-322, June 02-05, 1987
	12	M. Kaminski and A. Paz. Computing the Hermite normal form on an integer matrice. Technical Report 1986, Computer Science Dpt., TECHNION Israel Institute of Technology, June 1986.
	13	R. Kannan. Solving systems of linear equations over polynomials. Theoretical Computer Science, 39:69-88, 1985.
	14	R. Kannan and A. Bachem. Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix. SIAM J. Comput., 8 4, pp 499-507, 1979.
	15	S.E. Labhalla, H. Lombardi, and R. Marlin. Algorithmes de calcul de la rSduction d'Hermite d'une matrice h coefficients polynomiaux. In Comptes. Rendus de MEGA92, Nice, France. Birkhauser, 1992. Submitted to JSC.
	16	S.E. Labhalla, H. Lombardi, and R. Marlin. A1- gorithmes modulaires de calcul des rdductions d'Hermite et de Smith. Manuscript, April 1992.
	17	M.A. Laidacker. Another theorem relating Sylvester's matrix and the greatest common divisor. Mathematics Magazine, 42:126-128, 1969.
	18	M. Newman. Integral Matmces. Academic Press, 1972.
	19	Alexandeer Schrijver, Theory of linear and integer programming, John Wiley & Sons, Inc., New York, NY, 1986