算法为(1)找出A的元素中的最大公约数 (2)将它调到(1,1)位置上去 (3)使第一行和第一列的所有其他元素都为零 这可用基本行或列来变换: 交换两行(列) 一行(列)减去另一行(列)的整数倍 这样得到矩阵B,置S11=b11,对(m-1)x(n-1)的矩阵[bij]重复以上算法,重复r次就可得到smith标准形. This topic gives a version of the Gauss elimination algorithm for a commutative principal ideal domain which is usually described only for a field.
Let be a -matrix with entries from a commutative principal ideal domain . For denotes the number of prime factors of . Start with and choose to be the smallest column index of with a non-zero entry.
(I) If and , exchange rows 1 and . (II) If there is an entry at position such that , then set and choose such that 9 O& ?8 _- H2 p
By left-multiplication with an appropriate matrix it can be achieved that row 1 of the matrix product is the sum of row 1 multiplied by and row multiplied by . Then we get at position , where . Repeating these steps one obtains a matrix having an entry at position that divides all entries in column . (III) Finally, adding appropriate multiples of row , it can be achieved that all entries in column except for that at position are zero. This can be achieved by left-multiplication with an appropriate matrix. Applying the steps described above to the remaining non-zero columns of the resulting matrix (if any), we get an -matrix with column indices where , each of which satisfies the following: the entry at position is non-zero; all entries below and above position as well as entries left of are zero. Furthermore, all rows below the -th row are zero. Now we can re-order the columns of this matrix so that elements on positions for are nonzero and for ; and all columns right of the -th column (if present) are zero. For short set for the element at position . has non-negative integer values; so is equivalent to being a unit of . can either happen if and differ by a unit factor, or if they are relatively prime. In the latter case one can add column to column (which doesn't change and then apply appropriate row manipulations to get . And for and one can apply step (II) after adding column to column . This diminishes the minimum -values for non-zero entries of the matrix, and by reordering columns etc. we end up with a matrix whose diagonal elements satisfy .
Since all row and column manipulations involved in the process are invertible, this shows that there exist invertible and -matrices so that is
This is the Smith normal form of the matrix. The elements are unique up to associates and are called elementary divisors
有没有谁能够根据上述算法,将程序编出来............. 谢谢!!!!!!! 作者: toniby1978 时间: 2008-12-15 17:43 标题: 留个脚印 # Y& |9 ]7 [& B& X& b3 ^5 A8 t0 N3 G/ |& c D, c. _
* Y, n, Z' H2 r0 {- ~: t& e
) D" ~0 C# j1 {9 f2 Q5 ?( e9 s* k8 C1 F+ y' v; N
0 V* N& `( |' q2 ]. M8 A; z6 w6 B0 C0 |% \/ ~4 l
$ d7 ~) s- _8 d7 _% D0 [6 {; H( @& K8 `" B
+ U) e- P+ M( p- ?4 S8 x O- ]3 \0 V
) ]' e. Z, f( t: h
2 ? N) O# U, V( K' D3 V % b4 B+ s( w+ F. W. |* O0 e4 Z! T1 F1 W2 c2 w4 t
3 R" f2 o8 A# g$ n2 r2 H- p
) T( n4 h2 @, S" u& K2 y / a5 @5 @+ }6 p& F1 {4 Q. }4 h0 D- F) \6 k
" j1 j# ]. I1 ]7 i/ c4 g0 d/ E
# [% v+ q, |* L; I+ b
( a2 t7 N8 b' d7 Q3 H% }2 s
8 `( Q# W. {0 a9 |
! `9 D( n1 D; e8 j5 S3 R% y! p/ J* @$ d' w1 B# B
天下风云出我辈， 一入江湖岁月催。 皇图霸业谈笑中， 不胜人生一场醉。 * I+ o* d C3 c& | C' b. \专业深圳SEO服务:百度优化,Google优化,深圳SEO优化,注册香港公司SEO优化
% y! p/ J* @$ d' w1 B# B