|
Kevin Ryde on Tue, 23 Feb 2016 08:37:22 +0100
|
[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]
- To: pari-users@pari.math.u-bordeaux.fr
- Subject: Re: recurrence-guess.gp
- From: Kevin Ryde <user42_kevin@yahoo.com.au>
- Date: Tue, 23 Feb 2016 18:30:13 +1100
- Delivery-date: Tue, 23 Feb 2016 08:37:22 +0100
- Dkim-signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=yahoo.com.au; s=s2048; t=1456213033; bh=hy9LX+Kl2xVnKTd78Niimk2aTTRox00+8QwA5UoRubw=; h=From:To:Subject:References:Date:In-Reply-To:From:Subject; b=A8d4Ul105QJTc9H8eRgH+d1jFWZd9lyTQYK/g/4w2RTIImbkzAsvSjM+PfdTPnIfx3xPVWtZIS2qEjMQM0FLfU6jVlZLMkL+ULYMCcDZyUKR5vUXApRohOoiHZxx64EYp4ZfOIAJ1BzZWCyDc/hDDdr+NGtGe/Zfdb/LLV8kloRMuxzIWxTajEifdP8b6Oq39/2qUqyLi5G6/5UymXi2w9t9lCldnMx2gZC5cT9bvrGr31/XE79vUhBYLwFFagZzhfgBBf3nI0nHtSnINS83iO9ft7sG0wzsz6mR0kHTeKHYoILgE/I6ZMowM08a+MMZbzzhvyz8NqKearN2p8+VFw==
- In-reply-to: <20160221185414.GB30153@yellowpig> (Bill Allombert's message of "Sun, 21 Feb 2016 19:54:14 +0100")
- Organization: Bah Humbug
- References: <87egc6fqbj.fsf@blah.blah> <20160221185414.GB30153@yellowpig>
- User-agent: Gnus/5.13 (Gnus v5.13) Emacs/24.5 (gnu/linux)
Bill Allombert <Bill.Allombert@math.u-bordeaux.fr> writes:
>
> ? recurrence_guess(v)=denominator(bestapprPade(Ser(v)));
Ah. That'll be something big on a non-recurrence will it, so check the
result against extra values held back? Or give them but say a limit?
bestapprPade(Ser( vector(100,n,n!) ))
=> big
Is it normally quicker? I saw Charles Greathouse had qflll() too, but I
didn't know what relative merit. (Except that also possible lindep()
seemed much slower for "not found".)
I want, I think, inputs exact, possibly complex or quads, if that makes
a difference. My own use has only been recurrences up to about 100
terms, found from maybe 300 or 400 input values.