PointCheckAttempts -- Number of times the the function will search for a point

Description

When calling randomPoints, and functions that call it, with a BruteForce strategy strategy, this denotes the number of trials for brute force point checking. When calling it with a LinearIntersection strategy, this controls how many linear spaces are created.

i1 : R = ZZ/11[x,y,z];

i2 : I = ideal(x,y);

o2 : Ideal of R

i3 : randomPoints(I, PointCheckAttempts=>1)

o3 = {{0, 0, 1}}

o3 : List

i4 : randomPoints(I, PointCheckAttempts=>1000)

o4 = {{0, 0, 1}}

o4 : List

Functions with optional argument named `PointCheckAttempts` :

"extendIdealByNonZeroMinor(...,PointCheckAttempts=>...)"
"findANonZeroMinor(...,PointCheckAttempts=>...)"
"randomPoints(...,PointCheckAttempts=>...)"

For the programmer

The object PointCheckAttempts is a symbol.

PointCheckAttempts -- Number of times the the function will search for a point

Description

See also

Functions with optional argument named PointCheckAttempts :

For the programmer

Functions with optional argument named `PointCheckAttempts` :