Difference between revisions of "ApCoCoA-1:Num.ABM"

From ApCoCoAWiki
m (replaced <quotes> tag by real quotes)
 
(24 intermediate revisions by 6 users not shown)
Line 1: Line 1:
 +
{{Version|1}}
 
<command>
 
<command>
−
   <title>Num.BBasisOfPoints</title>
+
   <title>Num.ABM</title>
  
−
<short_description>Border basis of almost vanishing ideal for a set of points.</short_description>
+
<short_description>Computes the border basis of an almost vanishing ideal for a set of points using the ABM algorithm.</short_description>
 
<syntax>
 
<syntax>
−
Num.BBasisOfPoints(Points:MAT, Tau:RAT, GetO:BOOL):Object
+
Num.ABM(Points:MAT, Epsilon:RAT):Object
−
Num.BBasisOfPoints(Points:MAT, Tau:RAT, GetO:BOOL, Delta:RAT, NormalizeType:INT, RREFNormalizeType:INT, RREFUseEps:BOOL, RREFType:INT):Object
+
Num.ABM(Points:MAT, Epsilon:RAT, Delta:RAT, ForbiddenTerms:LIST, NormalizeType:INT):Object
 
</syntax>
 
</syntax>
  
 
<description>
 
<description>
 
<em>Please note:</em> The function(s) explained on this page is/are using the <em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them.
 
<em>Please note:</em> The function(s) explained on this page is/are using the <em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them.
 +
<par/>
 +
This command computes a border basis of an almost vanishing ideal for a set of points.
 +
<par/>
 +
The current ring has to be a ring over the rational numbers with a standard-degree
 +
compatible term-ordering. The matrix <tt>Points</tt> contains the points: each
 +
point is a row in the matrix, so the number of columns must equal the
 +
number of indeterminates in the current ring.
  
 
<itemize>
 
<itemize>
 
<item>@param <em>Points</em> The points for which a border basis is computed.</item>
 
<item>@param <em>Points</em> The points for which a border basis is computed.</item>
  
−
<item>@param <em>Tau</em> A positive rational number describing which singular values should be treated as 0 (smaller values for tau lead to bigger errors of the polynomials evaluated at the point set). Tau should be in the interval (0,1). As a rule of thumb, Tau is the expected percentage of error on the input points. </item>
+
<item>@param <em>Epsilon</em> A positive rational number describing the maximal admissible least squares error for a polynomial. (Bigger values for <tt>Epsilon</tt> lead to bigger errors of the polynomials evaluated at the point set). <tt>Epsilon</tt> should be in the interval (0,1). As a rule of thumb, <tt>Epsilon</tt> is the expected percentage of error on the input points. </item>
−
 
 
−
<item>@param <em>GetO</em> A Boolean to choose the output. If it is true, the command returns a list of two values: the first contains the border basis, the second one a vector space basis of P/I comprising those power products lying outside the leading term ideal of I. If GetO is false, the function returns only the border basis (not in a list).</item>
 
−
 
 
−
<item>@return The return value depends on the parameter GetO: GetO=FALSE: The border basis of the given points as a list of polynomials. GetO=TRUE: A list of two results. First the border basis as a list of polynomials, second the vector space basis of P/I as a list of terms.</item>
 
  
 +
<item>@return A list of two results. First the border basis as a list of polynomials, second the vector space basis of <tt>P/I</tt> as a list of terms.</item>
 
</itemize>
 
</itemize>
  
 
The following parameters are optional:
 
The following parameters are optional:
 
<itemize>
 
<itemize>
−
<item>@param <em>Delta</em> A positiv rational number. Delta describes the computing precision. In different steps, it is crucial, if a value is 0 or not. The algorithm assumes every value in [-Delta, Delta] to be 0. The default value for Delta is 0.00000000001.</item>
+
<item>@param <em>Delta</em> A positiv rational number. <tt>Delta</tt> describes the computing precision. In different steps, it is crucial, if a value is 0 or not. The algorithm assumes every value in <tt>[-Delta, Delta]</tt> to be 0. The default value for <tt>Delta</tt> is 0.00000000001.</item>
−
 
+
<item>@param <em>ForbiddenTerms</em> A list containing the terms which are not allowed to show up in the order ideal.</item>
−
<item>@param <em>NormalizeType</em> A integer of the range 1..4. The default value is 1. This parameter describes, if / how the input points are normalized. If NormalizeType equals 1, each coordinate is divided by the maximal absolut value of the matrix's corresponding column. This ensures that all point's coordinates are in [-1,1]. With NormalizeType=2 no normalization is done at all. NormalizeType=3 shifts each coordinate to [-1,1]. So it's minimum is mapped to -1 and the maximum to one, describing a unique affine mapping. The last option is NormalizeType=4. In this case, each coordinate is normalized, using the column's euclidian norm. Due to backward compatibility, the default is 1, although 3 is in most cases a better choice.</item>
 
−
 
 
−
<item>@param <em>RREFNormalizeType</em> Describes, how in each RREF steps the columns are normalized. The options correspond to the ones for NormalizeType and the default is 1 again.</item>
 
−
 
 
−
<item>@param <em>RREFUseEps</em> must be either true or false! If RREFUseEps is true, the given Delta is used within the RREF to decide if a value equals 0 or not. If this parameter is false, a replacement value for Delta is used, which is based on the matrix's norm. </item>
 
  
−
<item>@param <em>RREFType</em> This must be 1 or 2. If RREFType=1, the rref operates column-wise. Otherwise it works row-wise. The default is 1.</item>
+
<item>@param <em>NormalizeType</em> A integer of the range 1..4. The default value is 2. This parameter describes, if/how the input points are normalized. If <tt>NormalizeType</tt> equals 1, each coordinate is divided by the maximal absolute value of the corresponding column of the matrix. This ensures that all coordinates of points are in [-1,1]. With <tt>NormalizeType=2</tt> no normalization is done at all. <tt>NormalizeType=3</tt> shifts each coordinate to [-1,1]. So it's minimum is mapped to -1 and the maximum to one, describing a unique affine mapping. The last option is <tt>NormalizeType=4</tt>. In this case, each coordinate is normalized, using the column's euclidian norm.</item>
 
</itemize>
 
</itemize>
−
 
−
This command computes a border basis of an almost vanishing ideal for a set of points.
 
−
<par/>
 
−
The current ring has to be a ring over the rationals with a standard-degree
 
−
compatible term-ordering.  The matrix Points contains the points: each
 
−
point is a row in the matrix, so the number of columns must equal the
 
−
number of indeterminates in the current ring.
 
  
 
<example>
 
<example>
 
Use P::=QQ[x,y,z];
 
Use P::=QQ[x,y,z];
  
−
Points := Mat([[1,0,0],[0,0,1],[0,2,0]]);
+
Points := Mat([[1,0,0],[0,0,1],[0,0.99,0]]);
−
Num.BBasisOfPoints(Points,0.001,True);
+
Res := Num.ABM(Points,0.1);
 +
 
 +
Dec(Res[1],2);
 +
 
 +
-- CoCoAServer: computing Cpu Time = 0.016
 +
-------------------------------
 +
["1 x +1.01 y +0.99 z -0.99  ", "1 z^2 -0.99 z +0.00  ", "1 yz ", "1 xz ", "1 y^2 -0.98 y -0.00  ", "1 xy "]
 
-------------------------------
 
-------------------------------
−
[[x + 9007199254740991/18014398509481984y + z - 1, z^2 - 9007199254740991/9007199254740992z, 1/2yz, xz, 1/4y^2 - 9007199254740991/18014398509481984y, 1/2xy], [y, z, 1]]
 
 
</example>
 
</example>
 
</description>
 
</description>
  
 
     <seealso>
 
     <seealso>
−
       <see>Introduction to CoCoAServer</see>
+
       <see>ApCoCoA-1:Introduction to CoCoAServer|Introduction to CoCoAServer</see>
−
       <see>Numerical.GBasisOfPoints</see>
+
       <see>ApCoCoA-1:Num.SubABM|Num.SubABM</see>
−
      <see>Numerical.HBasisOfPoints</see>
 
−
      <see>Numerical.GBasisOfPointsInIdeal</see>
 
−
      <see>Numerical.BBasisOfPointsInIdeal</see>
 
−
      <see>Numerical.HBasisOfPointsInIdeal</see>
 
−
      <see>Numerical.FirstVanishingRelations</see>
 
−
      <see>Numerical.FirstVanishingRelationsInIdeal</see>
 
 
     </seealso>
 
     </seealso>
 
     <types>
 
     <types>
−
       <type>cocoaserver</type>
+
       <type>apcocoaserver</type>
 +
      <type>points</type>
 
     </types>
 
     </types>
−
     <key>bbasisofpoints</key>
+
     <key>ABM</key>
−
     <key>Num.bbasisofpoints</key>
+
     <key>Num.ABM</key>
−
     <wiki-category>Package_Numerical</wiki-category>
+
    <key>numerical.ABM</key>
 +
     <wiki-category>ApCoCoA-1:Package_numerical</wiki-category>
 
   </command>
 
   </command>

Latest revision as of 13:45, 29 October 2020

This article is about a function from ApCoCoA-1.

Num.ABM

Computes the border basis of an almost vanishing ideal for a set of points using the ABM algorithm.

Syntax

Num.ABM(Points:MAT, Epsilon:RAT):Object
Num.ABM(Points:MAT, Epsilon:RAT, Delta:RAT, ForbiddenTerms:LIST, NormalizeType:INT):Object

Description

Please note: The function(s) explained on this page is/are using the ApCoCoAServer. You will have to start the ApCoCoAServer in order to use it/them.

This command computes a border basis of an almost vanishing ideal for a set of points.

The current ring has to be a ring over the rational numbers with a standard-degree

compatible term-ordering. The matrix Points contains the points: each

point is a row in the matrix, so the number of columns must equal the number of indeterminates in the current ring.

  • @param Points The points for which a border basis is computed.

  • @param Epsilon A positive rational number describing the maximal admissible least squares error for a polynomial. (Bigger values for Epsilon lead to bigger errors of the polynomials evaluated at the point set). Epsilon should be in the interval (0,1). As a rule of thumb, Epsilon is the expected percentage of error on the input points.

  • @return A list of two results. First the border basis as a list of polynomials, second the vector space basis of P/I as a list of terms.

The following parameters are optional:

  • @param Delta A positiv rational number. Delta describes the computing precision. In different steps, it is crucial, if a value is 0 or not. The algorithm assumes every value in [-Delta, Delta] to be 0. The default value for Delta is 0.00000000001.

  • @param ForbiddenTerms A list containing the terms which are not allowed to show up in the order ideal.

  • @param NormalizeType A integer of the range 1..4. The default value is 2. This parameter describes, if/how the input points are normalized. If NormalizeType equals 1, each coordinate is divided by the maximal absolute value of the corresponding column of the matrix. This ensures that all coordinates of points are in [-1,1]. With NormalizeType=2 no normalization is done at all. NormalizeType=3 shifts each coordinate to [-1,1]. So it's minimum is mapped to -1 and the maximum to one, describing a unique affine mapping. The last option is NormalizeType=4. In this case, each coordinate is normalized, using the column's euclidian norm.

Example

Use P::=QQ[x,y,z];

Points := Mat([[1,0,0],[0,0,1],[0,0.99,0]]);
Res := Num.ABM(Points,0.1);

Dec(Res[1],2);

-- CoCoAServer: computing Cpu Time = 0.016
-------------------------------
["1 x +1.01 y +0.99 z -0.99  ", "1 z^2 -0.99 z +0.00  ", "1 yz ", "1 xz ", "1 y^2 -0.98 y -0.00  ", "1 xy "]
-------------------------------

See also

Introduction to CoCoAServer

Num.SubABM




Retrieved from "http://apcocoa.uni-passau.de/wiki/index.php?title=ApCoCoA-1:Num.ABM&oldid=16161"