Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.soft-sys.math.mathematica > #5949
| From | Simon <simonjtyler@gmail.com> |
|---|---|
| Newsgroups | comp.soft-sys.math.mathematica |
| Subject | Which algorithm(s) does FindIntegerNullVector[] |
| Date | 2011-10-28 09:34 +0000 |
| Organization | Steven M. Christensen and Associates, Inc and MathTensor, Inc. |
| Message-ID | <j8dsuf$k65$1@smc.vnet.net> (permalink) |
I only just noticed that Mathematica 8 introduced the new function FindIntegerNullVector.
It is a integer relation function (http://mathworld.wolfram.com/IntegerRelation.html) but the documentation and a Trace[..., TraceInternal -> True] gives no hint to what class of algorithms it belongs to.
Mathematica has for a long time had a variant of the LLL lattice reduction algorithm which can be used to generate integer relations. I've got some simple code based off Paul Abbott's (http://forums.wolfram.com/mathgroup/archive/2005/Jan/msg00254.html) which seems to perform better than the new FindIntegerNullVector, i.e. it needs less precision to find the correct relation in the cases I'm interested in.
So my question is:
Is FindIntegerNullVector based on LatticeReduce or does it use some other (more efficient) algorithm such as PSQL?
----------------
For those that are interested, here's my version of Paul's code:
TranscendentalRecognize[num_Real, basis_List, ord_Integer] :=
Module[{vect, mat, lr, ans},
vect = Round[10^(ord - 1) Join[{num}, N[basis, ord]]];
mat = Append[IdentityMatrix[Length[vect]], vect];
lr = LatticeReduce[Transpose[mat]];
ans = First[lr[[1]]]^-1 Most[Rest[lr[[1]]]].basis;
Sign[N@ans] Sign[num] ans]
TranscendentalRecognize[num_Real, basis_List] :=
TranscendentalRecognize[num, basis, Precision[num] // IntegerPart]
Back to comp.soft-sys.math.mathematica | Previous | Next | Find similar | Unroll thread
Which algorithm(s) does FindIntegerNullVector[] Simon <simonjtyler@gmail.com> - 2011-10-28 09:34 +0000
csiph-web