MathGroup Archive 2002

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: PSLQ implementation?

  • To: mathgroup at smc.vnet.net
  • Subject: [mg34231] Re: PSLQ implementation?
  • From: Peter <petsie at arcor.de>
  • Date: Fri, 10 May 2002 03:05:17 -0400 (EDT)
  • References: <abdft1$cha$1@smc.vnet.net>
  • Reply-to: petsie at arcor.de
  • Sender: owner-wri-mathgroup at wolfram.com

Ronald Bruck wrote:
> Is there an implementation of the PSLQ algorithm in Mathematica?  For
> my purposes, it would be enough to be able to find the minimal
> polynomial of a decimal approximation r of an algebraic number z, to
> within a given degree d.  (That is, to find the polynomial p(x) of
> smallest degree <= d with integer coefficients for which |p(r)| is
> smallest.)
>
> Currently, I have to do such computations in Maple, which is **not**
> convenient.  In Maple you must first set the precision; Mathematica has
> the ability of adapting to the precision of the given approximation r.
> Furthermore, Maple 7 **still** does not run native in Mac OS X.
>
> Best of all would be a special-purpose implementation using the Gnu
> Multiprecision Library, or equivalent.  It would be interesting to
> compare the speed to that of a Mathematica implementation.
>
> I don't want to reinvent the wheel.  Is there such a package?  (My
> numbers often seem to have degree > 32, but I know them to a couple of
> thousand digits; Maple takes forever.  Probably Mathematica will too,
> but I want to try an alternative.)
>
> --Ron Bruck
>

Dear Ron,
it is easy to find
  http://www.mathsource.com/Content/WhatsNew/0211-903
I hope this is what you're looking for.
Cheers,
   Peter




  • Prev by Date: Re: How to integrate over a constrained domain
  • Next by Date: FindRoot starting values
  • Previous by thread: Re: PSLQ implementation?
  • Next by thread: Re: PSLQ implementation?