Algorithm 287: matrix triangulation with integer arithmetic [F1]

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Algorithm 287: matrix triangulation with integer arithmetic [F1]

Full text

Pdf (258 KB)

Source

Communications of the ACM archive
Volume 9 , Issue 7 (July 1966) table of contents

Page: 513

Year of Publication: 1966

ISSN:0001-0782

Author

W. A. Blankinship

National Security Agency, Ft. Geo. G., Meade, MD

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 31, Citation Count: 3

Additional Information:

references cited by

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/365719.365970 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	ALBERT, A. A. Fundamental Concepts of Higher Algebra. U of Chicago Press., Chicago, Ill., 1956.
	2	BLANKINSHIP, W. A. A new version of the Euclidean algorithm. Amer. Math. Month. 70 (1963), 742-745.

CITED BY 3

	Paul D. Domich, Residual hermite normal form computations, ACM Transactions on Mathematical Software (TOMS), v.15 n.3, p.275-286, Sept. 1989
	Mostafa Khorramizadeh, A note on solving linear Diophantine systems by using L3-reduction algorithm, International Journal of Computer Mathematics, v.86 n.5, p.883-896, May 2009
	Gerold Jäger , Clemens Wagner, Efficient parallelizations of Hermite and Smith normal form algorithms, Parallel Computing, v.35 n.6, p.345-357, June, 2009

Adobe Acrobat

QuickTime

Windows Media Player

Real Player