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

From ApCoCoAWiki
(we no longer need manual sortkeys here)
m (replaced <quotes> tag by real quotes)
 
(37 intermediate revisions by 9 users not shown)
Line 1: Line 1:
−
  <command>
+
{{Version|1}}
−
    <title>Numerical.BBasisOfPoints</title>
+
<command>
−
    <short_description>Border basis of almost vanishing ideal for a set of points</short_description>
+
  <title>Num.ABM</title>
 +
 
 +
<short_description>Computes the border basis of an almost vanishing ideal for a set of points using the ABM algorithm.</short_description>
 
<syntax>
 
<syntax>
−
$numerical.BBasisOfPoints(Points, Epsilon, GetO):Object
+
Num.ABM(Points:MAT, Epsilon:RAT):Object
 +
Num.ABM(Points:MAT, Epsilon:RAT, Delta:RAT, ForbiddenTerms:LIST, NormalizeType:INT):Object
 
</syntax>
 
</syntax>
−
    <description>
+
 
−
This command computes a border basis of an almost vanishing ideal for a set of points using the algorithm described in the paper
+
<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.
 
<par/>
 
<par/>
−
  D. Heldt, M. Kreuzer, H. Poulisse, S.Pokutta: <em>Approximate Computation
+
This command computes a border basis of an almost vanishing ideal for a set of points.  
−
  of Zero-Dimensional Ideals</em> Submitted: August 2006
 
 
<par/>
 
<par/>
−
The current ring has to be a ring over the rationals with a standard-degree
+
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
+
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
 
point is a row in the matrix, so the number of columns must equal the
−
number of indeterminates in the current ring. Epsilon is a rational &gt;0
+
number of indeterminates in the current ring.  
−
describing which singular values should be treated as 0 (smaller values for
+
 
−
Epsilon lead to bigger errors of the polynomials evaluated at the point
+
<itemize>
−
set). Epsilon should be in the interval (0,1). As a rule of thumb,  
+
<item>@param <em>Points</em> The points for which a border basis is computed.</item>
−
Epsilon is the expected percentage of error on the input points. GetO must
+
 
−
be either True or False.  If it is true, the command returns a list  
+
<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>
−
of two values: the first contains the border basis, the
+
 
−
second one a vector space basis of P/I comprising those power products
+
<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>
−
lying outside the leading term ideal of I. If GetO is false, the function
+
</itemize>
−
returns only the border basis (not in a list).
+
 
 +
The following parameters are optional:
 +
<itemize>
 +
<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 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>
 +
 
 
<example>
 
<example>
−
Points := Mat([[1,0,0],[0,0,1],[0,2,0]]);
+
Use P::=QQ[x,y,z];
−
$numerical.BBasisOfPoints(Points,0.001,True);
+
 
 +
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
 
-------------------------------
 
-------------------------------
−
[[x + 9007199254740991/18014398509481984y + z - 1, z^2 - 9007199254740991/9007199254740992z, 1/2yz, xz, 1/4y^2 - 9007199254740991/18014398509481984y, 1/2xy], [y, z, 1]]
+
["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 "]
 +
-------------------------------
 +
</example>
 +
</description>
  
−
</example>
 
−
    </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>Heldt</key>
+
     <key>ABM</key>
−
     <key>numerical.bbasisofpoints</key>
+
     <key>Num.ABM</key>
−
     <key>numericalbbasisofpoints</key>
+
     <key>numerical.ABM</key>
−
     <wiki-category>Package_Numerical</wiki-category>
+
     <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"