Computing the Smith normal form of a matrix. [Computer greatest common divisor of n polynomials]
Conference
·
OSTI ID:7347036
The reduction of a matrix to a normal form enables one to study the matrix in its simplest and most convenient shape and to relate the theory of matrices to scientific applications more readily. This paper presents an algorithm for computing symbolically the Smith normal form of a matrix. Besides some introductory basic comments and the above algorithm, a method for computing the greatest common divisor of n polynomials in pairwise fashion is also set forth. (RWR)
- Research Organization:
- Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
- DOE Contract Number:
- W-7405-ENG-36
- OSTI ID:
- 7347036
- Report Number(s):
- LA-UR-76-594; CONF-760808-2
- Resource Relation:
- Conference: ACM symposium on symbolic and algebraic computation, Yorktown Heights, NY, USA, 10 Aug 1976
- Country of Publication:
- United States
- Language:
- English
Similar Records
A local construction of the Smith normal form of a matrix polynomial
Jacobi algorithms for integers. [JAC WO, JAL WO, JAC OR, JAL OR, for computing greatest common divisors, in FORTRAN IV]
Sublinear parallel algorithm for computing the greatest common divisor of two integers
Journal Article
·
Mon Sep 01 00:00:00 EDT 2008
· Journal of Symbolic Computation
·
OSTI ID:7347036
Jacobi algorithms for integers. [JAC WO, JAL WO, JAC OR, JAL OR, for computing greatest common divisors, in FORTRAN IV]
Technical Report
·
Mon Dec 01 00:00:00 EST 1975
·
OSTI ID:7347036
Sublinear parallel algorithm for computing the greatest common divisor of two integers
Journal Article
·
Sun Feb 01 00:00:00 EST 1987
· SIAM J. Comput.; (United States)
·
OSTI ID:7347036