English version
Accueil     À propos     Téléchargement     Ressources     Contactez-nous    

Ce site est rarement mis à jour. Pour les informations les plus récentes, rendez-vous sur le nouveau site OCaml à l'adresse ocaml.org.

Browse thread
BigNums in Caml Light 0.5
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 1992-11-03 (16:32)
From: menissie@m...
Subject: BigNums in Caml Light 0.5
You want to implement bigfloats but you seems to mix big integers
features (Fibonacci numbers, fact, mod and gcd) with really floating
point/real features (sqrt, exp, log, trig functions).

It is classical to work in a 2^b-basis (generally b=32). It costs more
to read or write a number but pure computation is much faster.

Here is some bibliography references which may interest you even if
they refer essentially to classical limited floating point numbers:

  David Goldberg "What every computer scientist should know about
  floating point arithmetic", Computing Surveys, 23 (1), March 1991.

  In proceedings of SIGPLAN '90 PLDI, there are two papers by Clinger,
  Steele and another one about how to read and write floating point
  numbers accurately

Otherwise, there exist arbitrarily large rational numbers in Caml V3.1
(the strong version on Unix) (numerator and denominator with less than
79803 decimal digits) with exact computation. In the other hand, we
have only built-in floating point numbers. It will be intesting to
have arbitrary large floating point numbers arithmetic . Furthermore,
it will be interesting to extend rational arithmetic to transcendantal
functions with the required precision as additional argument. 

------------------- Vale'rie ME'NISSIER - MORAIN -----------------------------
INRIA Projet Formel			        Tel: (33 1) (16 1) 39 63 55 98
Domaine de Voluceau		                Fax: (33 1) (16 1) 39 63 53 30
78153 Rocquencourt			     e-mail: menissie@margaux.inria.fr
BP 105