Difference between revisions of "ApCoCoA-1:Num.SubAVI"
(Corrected a copy and past error) |
|||
Line 1: | Line 1: | ||
<command> | <command> | ||
<title>Num.SubAVI</title> | <title>Num.SubAVI</title> | ||
− | <short_description>Computes a border basis of an almost vanishing sub-ideal for a set of points and ideal.</short_description> | + | <short_description>Computes a border basis of an almost vanishing sub-ideal for a set of points and an ideal using the <ref>Num.AVI</ref> algorithm.</short_description> |
<syntax> | <syntax> | ||
Num.SubAVI(Points:MAT, Tau:RAT, GBasis:LIST):Object | Num.SubAVI(Points:MAT, Tau:RAT, GBasis:LIST):Object | ||
Line 9: | Line 9: | ||
<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/> | <par/> | ||
− | This command computes a border basis of an almost vanishing sub-ideal for a set of points and ideal. | + | This command computes a border basis of an almost vanishing sub-ideal for a set of points and an ideal using the <ref>Num.ABM</ref> algorithm. |
<par/> | <par/> | ||
− | The current ring has to be a ring over the | + | The current ring has to be a ring over the rational numbers with a standard-degree |
− | compatible term-ordering. | + | compatible term-ordering. Each row in the matrix <tt>Points</tt> represents one point, so the number of columns must equal the |
− | |||
number of indeterminates in the current ring. | number of indeterminates in the current ring. | ||
Line 21: | Line 20: | ||
<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>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>GBasis</em> A homogeneous Groebner Basis in the current ring. This basis defines the ideal we compute the approximate vanishing ideal | + | <item>@param <em>GBasis</em> A homogeneous Groebner Basis in the current ring. This basis defines the ideal in which we compute the basis of the approximate vanishing ideal. <em>Warning:</em> For reasons of efficiency the function does not check the validity of <tt>GBasis</tt>.</item> |
<item>@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.</item> | <item>@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.</item> | ||
Line 29: | Line 28: | ||
The following parameters are optional: | The following parameters are optional: | ||
<itemize> | <itemize> | ||
− | <item>@param <em>Delta</em> A | + | <item>@param <em>Delta</em> A positive rational number which 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>NormalizeType</em> A integer of the | + | <item>@param <em>NormalizeType</em> A integer of the set <tt>{1,2,3,4}</tt>. The default value is 1. This parameter describes, if and where required the input points are normalized. If <tt>NormalizeType</tt> equals 1, each coordinate of a point is divided by the maximal absolute value of all coordinates of this point. This ensures that all coordinates of the points are within <tt>[-1,1]</tt>. With <tt>NormalizeType=2</tt> no normalization is done at all. <tt>NormalizeType=3</tt> shifts each coordinate to <tt>[-1,1]</tt>, i.e. the minimal coordinate of a point is mapped to -1 and the maximal coordinate to 1, which describes a unique affine mapping. The last option is <tt>NormalizeType=4</tt>. In this case, each point is normalized by its euclidean norm. Although <tt>NormalizeType=3</tt> is in most cases a better choice, the default value is due to backward compatibility 1.</item> |
− | <item>@param <em>RREFNormalizeType</em> Describes, how in each RREF | + | <item>@param <em>RREFNormalizeType</em> Describes, how in each RREF step the columns are normalized. The options correspond to the ones for <tt>NormalizeType</tt> and the default is 1 again.</item> |
− | <item>@param <em>RREFUseEps</em> | + | <item>@param <em>RREFUseEps</em> A boolean value. If <tt>RREFUseEps=TRUE</tt>, the given <tt>Delta</tt> is used within the RREF to decide if a value equals 0 or not. If <tt>RREFUseEps=FALSE</tt>, a replacement value for <tt>Delta</tt> is used, which is based on the norm of the matrix.</item> |
− | <item>@param <em>RREFType</em> | + | <item>@param <em>RREFType</em> A integer of the set <tt>{1,2}</tt>. If <tt>RREFType=1</tt>, the RREF operates column-wise, otherwise it works row-wise. The default value is 1.</item> |
</itemize> | </itemize> | ||
Revision as of 13:41, 8 July 2009
Num.SubAVI
Computes a border basis of an almost vanishing sub-ideal for a set of points and an ideal using the Num.AVI algorithm.
Syntax
Num.SubAVI(Points:MAT, Tau:RAT, GBasis:LIST):Object Num.SubAVI(Points:MAT, Tau:RAT, GBasis:LIST, Delta:RAT, NormalizeType:INT, RREFNormalizeType:INT, RREFUseEps:BOOL, RREFType: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 sub-ideal for a set of points and an ideal using the Num.ABM algorithm.
The current ring has to be a ring over the rational numbers with a standard-degree
compatible term-ordering. Each row in the matrix Points represents one point, 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 Tau 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.
@param GBasis A homogeneous Groebner Basis in the current ring. This basis defines the ideal in which we compute the basis of the approximate vanishing ideal. Warning: For reasons of efficiency the function does not check the validity of GBasis.
@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 positive rational number which 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 NormalizeType A integer of the set {1,2,3,4}. The default value is 1. This parameter describes, if and where required the input points are normalized. If NormalizeType equals 1, each coordinate of a point is divided by the maximal absolute value of all coordinates of this point. This ensures that all coordinates of the points are within [-1,1]. With NormalizeType=2 no normalization is done at all. NormalizeType=3 shifts each coordinate to [-1,1], i.e. the minimal coordinate of a point is mapped to -1 and the maximal coordinate to 1, which describes a unique affine mapping. The last option is NormalizeType=4. In this case, each point is normalized by its euclidean norm. Although NormalizeType=3 is in most cases a better choice, the default value is due to backward compatibility 1.
@param RREFNormalizeType Describes, how in each RREF step the columns are normalized. The options correspond to the ones for NormalizeType and the default is 1 again.
@param RREFUseEps A boolean value. If RREFUseEps=TRUE, the given Delta is used within the RREF to decide if a value equals 0 or not. If RREFUseEps=FALSE, a replacement value for Delta is used, which is based on the norm of the matrix.
@param RREFType A integer of the set {1,2}. If RREFType=1, the RREF operates column-wise, otherwise it works row-wise. The default value is 1.
Example
Use P::=QQ[x,y,z]; Points := Mat([[2/3,0,0],[0,1,0],[0,0,1/3]]); R:=Num.SubAVI(Points, 0.1, [1,x]); Dec(R[1],2); R[2]; -- CoCoAServer: computing Cpu Time = 0 ------------------------------- [<quotes>0.83 x^2 -0.55 x </quotes>, <quotes>1 xy </quotes>, <quotes>1 xz </quotes>, <quotes>0.00 x </quotes>, <quotes>0.41 x +0.27 y +0.82 z -0.27 </quotes>, <quotes>1 xz </quotes>, <quotes>1 yz </quotes>, <quotes>0.94 z^2 -0.31 z </quotes>] ------------------------------- [1, x, z] -------------------------------
See also