[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [Axiom-developer] Bernoulli puzzle

From: Raymond Rogers
Subject: Re: [Axiom-developer] Bernoulli puzzle
Date: Mon, 20 Oct 2014 17:03:59 -0400
User-agent: Mozilla/5.0 (X11; Linux x86_64; rv:31.0) Gecko/20100101 Thunderbird/31.2.0

On 10/20/2014 08:37 AM, Ralf Hemmecke wrote:
which gives excellent results. Pari uses

\[ |B_n| = \frac{2n!}{(2\pi)^n}\zeta(n) \]

with floats but you have to completely control the precision.
I don't know exactly, but I'd bet that Sage builds on flint2 for the
computation of Bernoulli (implemented (if I am not wrong) by Fredrik

Since that is free software, it would make sense to think about using
that library.


A little off topic; but I have developed an alternate way of dealing with polynomial sequences like
Bernoulli polynomials that are generated by generating functions.  It involves casting the sequences in
matrices and apply Pascal Matrices and Umbral calculus.  It makes some known relations obvious
and casts a different viewpoint on others. 
It might allow some kind of Polynomial sequence algebra or some such.  It does have the advantage of
automatically converting some (actually  most) sequences to others by symbolic/parametrized methods.
If anybody is interested let me know and I will write up the application to Bernoulli polynomials as a special case.


The primary use of conversation is to satisfy the impulse to talk
George Santanyana

reply via email to

[Prev in Thread] Current Thread [Next in Thread]