Changeset cb1e43b in git

Timestamp:

Jan 3, 2001, 2:28:48 AM (23 years ago)

Author:

Gert-Martin Greuel <greuel@…>

Branches:

(u'spielwiese', '17f1d200f27c5bd38f5dfc6e8a0879242279d1d8')

Children:

f875fae3f8c98402b705e50855bccd0ce2c50d90

Parents:

9cc5d37df563ce9febe8a449f39cf9986d705e1e

Message:

* GMG: Kosmetik


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

File:

• Singular/LIB/matrix.lib (modified) (8 diffs)

Singular/LIB/matrix.lib

@@ -1 +1 @@
 // GMG/BM, last modified: 8.10.98
 ///////////////////////////////////////////////////////////////////////////////
-version="$Id: matrix.lib,v 1.17 2001-01-02 13:10:59 greuel Exp $";
+version="$Id: matrix.lib,v 1.18 2001-01-03 01:28:48 greuel Exp $";
 category="Linear Algebra";
 info="
@@ -505 +505 @@
 "USAGE:   gauss_col(A[,e]); A matrix, e any type
 RETURN:  - a matrix B, if called with one argument; B is the complete column-
-           reduced upper-triangular normal form of A if A is constant, resp.
-           as far as this is possible if A is a polynomial matrix 
-           (no division by polynomials).
+           reduced upper-triangular normal form of A if A is constant, 
+           (resp. as far as this is possible if A is a polynomial matrix;
+           no division by polynomials).
 @*       - a list L of two matrices, if called with two arguments;  
            L satidfies L[1] = A * L[2] with L[1] the column-reduced form of A
@@ -534 +534 @@
    option(redSB);
    M = simplify(interred(M),1);
+ /*
+   if (#[1] == 0)
+   {
+     M = simplify(std(M),1);
+   }
+   if (#[1] == 1)
+   {
+     M = simplify(interred(M),1);
+   }
+ /*
    if (size(#) != 0)
    {
@@ -588 +598 @@
 "USAGE:  gauss_row(A); A matrix, e any type
 RETURN: - a matrix B, if called with one argument; B is the complete row-
-          reduced lower-triangular normal form of A if A is constant, resp.
-          as far as this is possible if A is a polynomial matrix 
-          (no division by polynomials).
+          reduced lower-triangular normal form of A if A is constant,
+          (resp. as far as this is possible if A is a polynomial matrix;
+          no division by polynomials).
 @*      - a list L of two matrices, if called with two arguments; 
           L satidfies L[1] = L[2] * A with L[1] the row-reduced form of A 
@@ -749 +759 @@
 proc rowred (matrix A,list #)
 "USAGE:   rowred(A[,e]);  A matrix, e any type
-RETURN:  - a matrix B, being the row reduced form of A, as far as this
-           is possible over the polynomial ring (no division by polynomials)
-           (if rowred is called with one argument).
+RETURN:  - a matrix B, being the row reduced form of A, if rowred is called 
+           with one argument.
+           (as far as this is possible over the polynomial ring; no division 
+           by polynomials)
 @*       - a list L of two matrices, such that L[1] = L[2] * A with L[1]
            the row-reduced form of A and L[2] the transformation matrix
@@ -759 +770 @@
            library (no standard basis computation), hence it is not very 
            efficient. The transformation matrix is obtained by concatenating
-           a unit matrix to A.
+           a unit matrix to A, proc gauss_red should be faster.
 @*       * It should only be used with exact coefficient field (there is no
            pivoting) over the polynomial ring (ordering lp or dp).
@@ -832 +843 @@
 proc colred (matrix A,list #)
 "USAGE:   colred(A[,e]);  A matrix, e any type
-RETURN:  - a matrix B, being the column reduced form of A, as far as this
-           is possible over the polynomial ring (no division by polynomials)
-           (if colred is called with one argument).
+RETURN:  - a matrix B, being the column reduced form of A, if colred is 
+           called with one argument.
+           (as far as this is possible over the polynomial ring; 
+           no division by polynomials)
 @*       - a list L of two matrices, such that L[1] = A * L[2] with L[1]
            the column-reduced form of A and L[2] the transformation matrix
@@ -840 +852 @@
 NOTE:    * This procedure is designed for teaching purposes only.
 @*       * It applies rowred to the transposed matrix, hence it is not very 
-           efficient (cf. rowred).
+           efficient (cf. rowred); proc gauss_col should be faster.
 @*       * It should only be used with exact coefficient field (there is no
            pivoting) over the polynomial ring (ordering lp or dp).