On May 24, 2005, at 3:49 PM, [EMAIL PROTECTED] wrote:
Doesn't the Gnu Scientific Library have this stuff?
No. While the GSL includes an admirably wide range of functions
(and I may
steal some of their algorithms...), every last one of them is of
strictly
*finite* precision, i.e. it's only
On May 24, 2005, at 2:42 PM, Stephen Barncard wrote:
but... EVERY platform has limits...eventually - memory, speed. How can
any tool be 'infinite'?? Better, bigger, faster, perhaps, but ...
infinite? Aren't you instead trying to craft tools that are...
scaleable?
We're getting into
...And not forgetting that the old testament shows us
that Moses was the first person ever to own a car ...
...and he came down the mountain in his Triumph
Gordon
--- Dar Scott [EMAIL PROTECTED] wrote:
On May 24, 2005, at 2:42 PM, Stephen Barncard wrote:
but... EVERY platform has
or was it a bike?
X)
-Original Message-
From: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED] On Behalf Of
Gordon Webster
Sent: Wednesday, May 25, 2005 18:50
To: How to use Revolution
Subject: Re: Infinite-precision arithmetic (getting OT ;-)
...And not forgetting that the old
: Re: Infinite-precision arithmetic (getting OT ;-)
...And not forgetting that the old testament shows us that
Moses was the first person ever to own a car ...
...and he came down the mountain in his Triumph
Gordon
Best
Klaus Major
[EMAIL PROTECTED]
http://www.major-k.de
I've just started to work on a suite of handlers for infinite-precision
calculations. The core idea I shall exploit: Break up each calculation into a
series of smaller operations which are within the machine's capability, and
combine the results into an aggregate result which would otherwise
Very nice!
That's the easy part though ;)
Divisions is where it gets harder and using arrays may be much more
efficient than
using strings or numbers... But items could work well too but wouldn't it
be slower?
cheers
Xavier
On 24.05.2005 11:02:36 use-revolution-bounces wrote:
I've just
sez [EMAIL PROTECTED]:
Very nice!
Thanks!
That's the easy part though ;)
[nods] Don't I know it!
Divisions is where it gets harder...
And square roots... and powers... and DIV and MOD... and...
I've already come up with an infinite-precision algorithm for
multiplication which looks
If you want to tackle multiplications, you should do it via bases...
10 and 2 being the easiest but not the most efficient.
Knowing the laws of power series and logs will be of great help
as they can tell you what digit goes where... But Rev can't handle
the sums so you need an array (or items)
On May 24, 2005, at 5:02 AM, [EMAIL PROTECTED] wrote:
I've just started to work on a suite of handlers for
infinite-precision
calculations.
Wouldn't it be easier to interface to an existing bigint library?
Doesn't the Gnu Scientific Library have this stuff?
V.
! ;)
cheers
Xav
-Original Message-
From: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED] On Behalf Of
Victor Eijkhout
Sent: Tuesday, May 24, 2005 18:12
To: How to use Revolution
Subject: Re: Infinite-precision arithmetic
On May 24, 2005, at 5:02 AM, [EMAIL PROTECTED] wrote
If some are interested, i can send you a blog i just wrote but never would
send to the list
I would be interested!
[EMAIL PROTECTED]
Thanks
___
use-revolution mailing list
use-revolution@lists.runrev.com
On May 24, 2005, at 3:55 AM, [EMAIL PROTECTED] wrote:
Naturally, there's also the option of splitting N1 and N2 up into
7-character chunks, doing all the multiplies for the relevant
chunk-pairs, and
combining the results of said multiplies. That looks like it'd be a
pain to code, so
I am
You probably can find a long list of ACM Programming Contest long
math algorithms. At least when I was on our College's team, the ACM
loved to put problems involving long math in the mix. As far as I
know every team had ready-to-go source for long-math operations just
for that reason. We only
sez [EMAIL PROTECTED]:
On May 24, 2005, at 5:02 AM, [EMAIL PROTECTED] wrote:
I've just started to work on a suite of handlers for
infinite-precision calculations.
Wouldn't it be easier to interface to an existing bigint library?
The whole point of what I'm doing with this is two-fold: (a)
On May 24, 2005, at 1:49 PM, [EMAIL PROTECTED] wrote:
Wouldn't it be easier to interface to an existing bigint library?
The whole point of what I'm doing with this is two-fold: (a) To
have a
suite of functions with truly *infinite* precision -- not 15 places,
not 45
places, but *as many
but... EVERY platform has limits...eventually - memory, speed. How
can any tool be 'infinite'?? Better, bigger, faster, perhaps, but ...
infinite? Aren't you instead trying to craft tools that are...
scaleable?
We're getting into theoretical physics, cosmology here whoa...
Doesn't the
I have always found binary coded decimal (BCD) the simplest for this
purpose, as it is directly extensible to any length, with only a few
lines of code. Please see any (low-level; i.e., machine-code) book
on arithmetic algorithms. They may not teach BCD anymore, but back
in the day...
On May 24, 2005, at 9:07 PM, John Vokey wrote:
I have always found binary coded decimal (BCD) the simplest for this
purpose, as it is directly extensible to any length, with only a few
lines of code. Please see any (low-level; i.e., machine-code) book on
arithmetic algorithms. They may not
19 matches
Mail list logo
