Changeset e1cb99 in git

Timestamp:

Mar 2, 2010, 7:46:49 PM (13 years ago)

Author:

Viktor Levandovskyy <levandov@…>

Branches:

(u'spielwiese', '0d6b7fcd9813a1ca1ed4220cfa2b104b97a0a003')

Children:

920a1e8c8bf9b487a06f6ab6aabb70aeb007a7bb

Parents:

02c3fb9f6dcd83a27c6e5509fb8fcabe08fe47fb

Message:

*levandov: test proc and minor text changes

git-svn-id: file:///usr/local/Singular/svn/trunk@12577 2c84dea3-7e68-4137-9b89-c4e89433aadc

File:

• Singular/LIB/jacobson.lib (modified) (2 diffs)

Singular/LIB/jacobson.lib

@@ -48 +48 @@
   LIB "dmodapp.lib"; // engine
   LIB "qhmoduli.lib"; // Min
+
+proc tstjacobson()
+{
+  /* tests all procs for consistency */
+  example divideUnits;
+  example smith;
+  example jacobson;
+}
 
 proc divideUnits(list L)
@@ -678 +686 @@
 RETURN: list
 ASSUME: Basering is a (non-commutative) ring in two variables.
-PURPOSE: compute a weak Jacobson Normal Form of M over the basering
+PURPOSE: compute a weak Jacobson normal form of M over the basering
 THEORY: Groebner bases and involutions are used, following [3]
-NOTE: A list L of matrices {U,D,V} is returned. That is L[1]*M*L[3]=L[2], where
-@*      L[2] is a diagonal matrix and L[1], L[3] square invertible (unimodular) matrices.
+NOTE: A list L of matrices {U,D,V} is returned. That is L[1]*M*L[3]=L[2], 
+@*      where L[2] is a diagonal matrix and 
+@*      L[1], L[3] are square invertible polynomial (unimodular) matrices.
 @*      Note, that M can be rectangular.
 @* The optional integer @code{eng2} determines the Groebner basis engine: