From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,88a843cdd1eb738a
X-Google-Attributes: gid103376,public
From: Gautier <gautier.demontmollin@maths.unine.ch>
Subject: Re: Language Challenge 2000
Date: 2000/02/04
Message-ID: <389AB8E3.5C2288AF@maths.unine.ch>#1/1
X-Deja-AN: 581464637
Content-Transfer-Encoding: 7bit
References: <38964D82.3423805@sdynamix.com>
To: bvoh@sdynamix.com
X-Accept-Language: en
Content-Type: text/plain; charset=us-ascii
X-Trace: 4 Feb 2000 11:31:29 +0100, 130.125.13.32
MIME-Version: 1.0
Newsgroups: comp.lang.ada
Date: 2000-02-04T00:00:00+00:00
List-Id: <comp.lang.ada>

> Criteria:

>         a)  Execution time
>         b)  Size of executable

Another remark: besides the language/system problem,
the lack of information about weighting between a) and b)
blocks the choice of the algorithm!

To reach the same precision, you can use a simple Euler
method with small steps (tiny but slow program) or
a 13-stage, with variable step, Dormand-Prince method
that will reach the goal in a few steps but
with a bigger code...

-- 
Gautier

_____\\________________\_______\_________
http://members.xoom.com/gdemont/gsoft.htm