Changeset 731e67e in git for Singular/LIB/zeroset.lib

Timestamp:

Jul 18, 2006, 5:48:31 PM (18 years ago)

Author:

Hans Schönemann <hannes@…>

Branches:

(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')

Children:

a15d90a2e309f3fabc9f9d147ba93e4fbaff9e3d

Parents:

dd73043aece50a3b540b469cacfe1e7bb5712915

Message:

*hannes: format, typos in docu


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

File:

• Singular/LIB/zeroset.lib (modified) (7 diffs)

Singular/LIB/zeroset.lib

@@ -1 +1 @@
 // Last change 12.02.2001 (Eric Westenberger)
 ///////////////////////////////////////////////////////////////////////////////
-version="$Id: zeroset.lib,v 1.14 2005-05-10 17:56:17 Singular Exp $";
+version="$Id: zeroset.lib,v 1.15 2006-07-18 15:48:31 Singular Exp $";
 category="Symbolic-numerical solving";
 info="
@@ -7 +7 @@
 AUTHOR:   Thomas Bayer,    email: tbayer@mathematik.uni-kl.de
           http://wwwmayr.informatik.tu-muenchen.de/personen/bayert/
-          Current Adress: Institut fuer Informatik, TU Muenchen
+          Current Address: Institut fuer Informatik, TU Muenchen
 
 OVERVIEW:
  Algorithms for finding the zero-set of a zero-dim. ideal in Q(a)[x_1,..,x_n],
- Roots and Factorization of univariate polynomials over Q(a)[t]
- where a is an algebraic number. Written in the frame of the
+ roots and factorization of univariate polynomials over Q(a)[t]
+ where a is an algebraic number. Written in the scope of the
  diploma thesis (advisor: Prof. Gert-Martin Greuel) 'Computations of moduli
  spaces of semiquasihomogeneous singularities and an implementation in Singular'.
@@ -169 +169 @@
   @end format
 ASSUME:  basering = Q[x,a] ideal mpoly must be defined, it might be 0!
-NOTE:    might change the ideal mpoly !!
+NOTE:    might change the ideal mpoly!!
 EXAMPLE: example  Roots; shows an example
 "
@@ -408 +408 @@
 proc InvertNumberMain(poly f)
 "USAGE:   InvertNumberMain(f); where f is a polynomial
-PURPOSE: compute 1/f if f is a number in Q(a) i.e., f is represented by a
+PURPOSE: compute 1/f if f is a number in Q(a), i.e., f is represented by a
          polynomial in Q[a].
 RETURN:  poly 1/f
@@ -507 +507 @@
 proc QuotientMain(poly f, poly g)
 "USAGE:   QuotientMain(f, g); where f,g are polynomials
-PURPOSE: compute the quotient q and remainder r s.t. f = g*q + r, deg(r) < deg(g)
+PURPOSE: compute the quotient q and remainder r s.th. f = g*q + r, deg(r) < deg(g)
 RETURN:  list of polynomials
   @format
@@ -586 +586 @@
 "USAGE:   EGCD(f, g); where f,g are polynomials
 PURPOSE: compute the polynomial gcd of f and g over Q(a)[x]
-RETURN:  polynomial h s.t. h is a greatest common divisor of f and g (not nec.
-         monic)
+RETURN:  polynomial h s.th. h is a greatest common divisor of f and g (not
+         necessarily monic)
 ASSUME:  basering = Q(a)[t]
 EXAMPLE: example  EGCD; shows an example
@@ -719 +719 @@
   @end format
 ASSUME:  f must be squarefree, basering = Q[x,a] and ideal mpoly is equal to
-         'minpoly',this represents the ring Q(a)[x] together with 'minpoly'.
+         'minpoly', this represents the ring Q(a)[x] together with 'minpoly'.
 NOTE:   the norm is an element of Q[x]
 EXAMPLE: example  SqfrNorm; shows an example