ApCoCoA-1:Num.IsAVI: Difference between revisions
From ApCoCoAWiki
No edit summary |
No edit summary |
||
Line 18: | Line 18: | ||
<example> | <example> | ||
Use P::=Q[x,y,z]; | Use P::=Q[x,y,z]; | ||
Num.IsAVI([x+1,x^2],[[0]],0.1); | Dec(Num.IsAVI([x+1,x^2],[[0]],0.1),3); | ||
-- CoCoAServer: computing Cpu Time = 0 | -- CoCoAServer: computing Cpu Time = 0 | ||
------------------------------- | ------------------------------- | ||
[ | [<quotes>0.353</quotes>, <quotes>0.707</quotes>] | ||
------------------------------- | ------------------------------- | ||
</example> | </example> |
Revision as of 15:17, 13 December 2010
Num.IsAVI
Checks if a given set of polynomials vanishes at a given set of points.
Syntax
Num.IsAVI(Polys:LIST, Points:MAT, Epsilon:RAT):[A:INT or RAT,B:INT or RAT];
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 checks if a set of polynomials vanishes at a set of points Epsilon approximately. The polynomials are preprocessed first to have norm 1.
@param Polys A list of polynomials.
@param Points A matrix containing the points to check.
@param Epsilon Rational number
@return A number A which specifies how well the points vanish on average and a number B which contains the maximal evaluation value
Example
Use P::=Q[x,y,z]; Dec(Num.IsAVI([x+1,x^2],[[0]],0.1),3); -- CoCoAServer: computing Cpu Time = 0 ------------------------------- [<quotes>0.353</quotes>, <quotes>0.707</quotes>] -------------------------------
See also