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

*To*: bear <bear@xxxxxxxxx>*Subject*: Re: Multiple precisions of floating-point arithmetic*From*: Bradley Lucier <lucier@xxxxxxxxxxxxxxx>*Date*: Sun, 26 Feb 2006 14:16:00 -0600*Cc*: Bradley Lucier <lucier@xxxxxxxxxxxxxxx>, srfi-77@xxxxxxxxxxxxxxxxx*Delivered-to*: srfi-77@xxxxxxxxxxxxxxxxx*In-reply-to*: <Pine.LNX.4.58.0602261158440.12907@xxxxxxxxxxxxxx>*References*: <AD3705D9-F0AA-4C2D-BDCA-0446ACDF570B@xxxxxxxxxxxxxxx> <Pine.LNX.4.58.0602261158440.12907@xxxxxxxxxxxxxx>

On Feb 26, 2006, at 2:00 PM, bear wrote:

On Sun, 26 Feb 2006, Bradley Lucier wrote:Then Colin Percival published his paper "Rapid multiplication modulo the sum and difference of highly composite numbers", www.ams.org/mcom/2003-72-241/S0025-5718-02-01419-9/ S0025-5718-02-01419-9.pdf which gives new bounds for the error in FFTs implemented in floating- point arithmetic. This allows you to use FFTs to implement bignum arithmetic with inputs of size 256 * (1024)^2 bits in 64-bit IEEE arithmetic with proven accuracy.This is a very interesting potential implementation technique. Is there a URL for this article that someone who is not a member of the American Mathematical Society can access? Or a publication we can find at a local print library? Bear

http://www.daemonology.net/papers/ The citation is

Brad

**References**:**Multiple precisions of floating-point arithmetic***From:*Bradley Lucier

**Re: Multiple precisions of floating-point arithmetic***From:*bear

- Prev by Date:
**Re: Multiple precisions of floating-point arithmetic** - Next by Date:
**Re: Integer residue-classes** - Previous by thread:
**Re: Multiple precisions of floating-point arithmetic** - Next by thread:
**implementations that can't represent infinities or NaNs** - Index(es):