A sequence of real or complex numbers specified in the Lindep field. They may be input as floating point approximations or as exact numbers. In the latter case, it will first be evaluated in floating point at precision specified in the precision field.
The Lindep function uses the LLL or the PSLQ algorithms to find a vector of integers such that its dot-product with the vector of input numbers is zero, i.e. it finds an integer linear dependence among the input numbers.
If no integer relation of given precision exist among the input numbers, then Lindep outputs coefficients of size roughly equal to the given precision divided by the cardinality of the input.
of Integer Relation Algorithms
by Jonathan M. Borwein and Petr Lisonek, Discrete Mathematics (Special issue for FPSAC 1997)
Back to IntegerRelations.