[Caml-list] Surreal-0.0.3

[Caml-list] Surreal-0.0.3

[YAMAGATA yoriyuki]

Surreal-0.0.3 is released.

Surreal library is another exact real arithmetic library for objective
caml.

The library is currently just a rough sketch, and not well tested.
There is no plan to further development.  I am tired of error bound
estimation.  However, if someone is interested, I would love to share
ideas.

For more info, look to the home page.
http://www.mars.sphere.ne.jp/yoriyuki/surreal.html

I would appreciate your feedbacks

--
Yamagata Yoriyuki
http://www.mars.sphere.ne.jp/yoriyuki/
-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners

Re: [Caml-list] Surreal-0.0.3

[Markus Mottl]

On Fri, 17 May 2002, YAMAGATA yoriyuki wrote:
> The library is currently just a rough sketch, and not well tested.
> There is no plan to further development.  I am tired of error bound
> estimation.  However, if someone is interested, I would love to
> share ideas.

Has anybody ever attempted to implement exact real arithmetic in OCaml
in a "lazy" way such that one doesn't have to estimate error bounds? E.g.:

  http://www.dcs.ed.ac.uk/home/als/Research/lazy.ps.gz

The only problem of such a library might be its efficiency...

Regards,
Markus Mottl

-- 
Markus Mottl                                             markus@oefai.at
Austrian Research Institute
for Artificial Intelligence                  http://www.oefai.at/~markus
-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners

Re: [Caml-list] Surreal-0.0.3

[YAMAGATA yoriyuki]

From: Markus Mottl <markus@oefai.at>
Subject: Re: [Caml-list] Surreal-0.0.3
Date: Thu, 16 May 2002 19:03:47 +0200

> The only problem of such a library might be its efficiency...

A pioneer work by Böhm et al shows that a naive approach using
functions as reals achieves better performance than a lazy approach
(at least the one using infinite n-base expansion).

The main point of Surreal is performance.  (So, I don't use lazy
approaches.)  I tried some idea to boost performance for large scale
computation.  Another reason I was discouraged is that I don't know
how to show the performance improvement.  I hope someone who has
experience with numerical computation looks my idea and judges whether
it is useful.

Yet another problem I have encountered is memory exhaustion.  In my
experiment, memory is major limitation (rather time).  caml lazy
construct always memorizes values, so one may encounter a similar
problem.  Haskel or other lazy languages may have better space
efficiency, though.

That's my thought.
--
Yamagata Yoriyuki
http://www.mars.sphere.ne.jp/yoriyuki/
-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners