Mailing-List: contact dev-help@commons.apache.org; run by ezmlm
Precedence: bulk
Reply-To: "Commons Developers List" <dev@commons.apache.org>
Received-SPF: pass (athena.apache.org: domain of
 SRS0=Evch=DZ=m4x.org=sebastien.brisard@bounces.m4x.org designates
 129.104.30.34 as permitted sender)
MIME-Version: 1.0
In-Reply-To: <4FB96D62.3080308@gmail.com>
References: <4FB96D62.3080308@gmail.com>
Date: Mon, 21 May 2012 07:32:06 +0200
Message-ID: 
 <CAGRH7HqQcgCwLRJrGTT-BYRQTufWvgfBfLmjYaiCjpqYjwgrvg@mail.gmail.com>
Subject: Re: [math] numerical stability problems of continued fraction
From: =?ISO-8859-1?Q?S=E9bastien_Brisard?= <sebastien.brisard@m4x.org>
To: Commons Developers List <dev@commons.apache.org>
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: quoted-printable

Hi Thomas,
>
> This seems to solve all the described problems, but the question remains
> if this can be included without problems into CM. The algorithm
> description in NR is not in source code but on an higher level.
>
Looking at the relevant chapter in NR, I don't think there is any
license issue (no code provided in NR).
However, if you really want to play it safe, the paper by Thompson is
available here
http://www.fresco.org.uk/papers/Thompson-JCP64p490.pdf
I guess downloading it is OK, as www.fresco.org.uk seems to be
Thompson's own website.
What you could do is conform closely to Thompson's notation, instead
of NR's notation.

S=E9bastien


---------------------------------------------------------------------
To unsubscribe, e-mail: dev-unsubscribe@commons.apache.org
For additional commands, e-mail: dev-help@commons.apache.org