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.9 required=5.0 tests=BAYES_00 autolearn=unavailable autolearn_force=no version=3.4.4 Path: eternal-september.org!reader01.eternal-september.org!feeder.eternal-september.org!aioe.org!.POSTED.2uCIJahv+a4XEBqttj5Vkw.user.gioia.aioe.org!not-for-mail From: "Dmitry A. Kazakov" Newsgroups: comp.lang.ada Subject: Re: Any good package for mathematical function in Ada? Date: Mon, 1 Jun 2020 15:37:45 +0200 Organization: Aioe.org NNTP Server Message-ID: References: <45af26dc-c35f-4a01-8115-7b30021cc064@googlegroups.com> <835a8c6a-54a8-4157-bcf1-e889d18b1b46@googlegroups.com> NNTP-Posting-Host: 2uCIJahv+a4XEBqttj5Vkw.user.gioia.aioe.org Mime-Version: 1.0 Content-Type: text/plain; charset=utf-8; format=flowed Content-Transfer-Encoding: 7bit X-Complaints-To: abuse@aioe.org User-Agent: Mozilla/5.0 (Windows NT 10.0; WOW64; rv:68.0) Gecko/20100101 Thunderbird/68.8.1 X-Notice: Filtered by postfilter v. 0.9.2 Content-Language: en-US Xref: reader01.eternal-september.org comp.lang.ada:58923 Date: 2020-06-01T15:37:45+02:00 List-Id: On 01/06/2020 13:52, Nasser M. Abbasi wrote: > On 6/1/2020 6:34 AM, Dmitry A. Kazakov wrote: > 89122152724401671806000989156340 >>> >>> Want 1,000 digits? 2,000 digits? all can be done. >> >> In how many microseconds? > > In my PC, intel i-7-8086K CPU, 4 GHZ, it takes 6.2*10^-7 second > for 20,000 digits (I put ";" to prevent the 20,000 digits from > being printed on screen) > > In[20]:= RepeatedTiming[N[BesselJ[0,1],20000];] > Out[20]= {6.2*10^-7,Null} > > "RepeatedTiming[expr] evaluates expr repeatedly and returns a list of > the average time in seconds used, together with the result obtained. > " It looks too good, though I do not know the method used. As a reference, GSL takess 34ns on a bit faster i9 machine. -- Regards, Dmitry A. Kazakov http://www.dmitry-kazakov.de