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

From ApCoCoAWiki
m (fixed links to namespace ApCoCoA)
m (replaced <quotes> tag by real quotes)
 
(One intermediate revision by the same user not shown)
Line 1: Line 1:
   <command>
+
   {{Version|1}}
 +
<command>
 
     <title>Num.IsAVI</title>
 
     <title>Num.IsAVI</title>
 
     <short_description>Checks if a given set of polynomials vanishes at a given set of points.</short_description>
 
     <short_description>Checks if a given set of polynomials vanishes at a given set of points.</short_description>
Line 21: Line 22:
 
-- CoCoAServer: computing Cpu Time = 0
 
-- CoCoAServer: computing Cpu Time = 0
 
-------------------------------
 
-------------------------------
[<quotes>0.353</quotes>, <quotes>0.707</quotes>]
+
["0.353", "0.707"]
 
-------------------------------
 
-------------------------------
 
</example>
 
</example>

Latest revision as of 13:47, 29 October 2020

This article is about a function from ApCoCoA-1.

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
-------------------------------
["0.353", "0.707"]
-------------------------------

See also

Introduction to CoCoAServer