Funny this should come up. William just gave a take-home midterm in which we had to predict the runtime for various computations, so I wrote some generic code to help. According to my code, and some liberal assumptions, it should take 5.1 days. I've attached the plots that show the curves I fit to some runtime data (x-axis is log(n,1.5) y-axis is seconds).
However, this same code predicted that computing the determinant of a 10000x10000 matrix with single-digit entries would take 20 hours, but it really took 30 hours. So my estimates are not to be trusted too much as the numbers grow... On Fri, 2 May 2008, David Harvey wrote: > > > On May 2, 2008, at 3:43 PM, Bill Hart wrote: > >> I think the asymptotics aren't going to go our way if we use pari. It >> takes 11s for 10^5 and I've been sitting here for quite a few minutes >> and didn't get 10^6 yet. > > So far I have on a 2.6GHz opteron: > > sage: time x = bernoulli(60000) > Wall time: 3.79 > > sage: time x = bernoulli(120000) > Wall time: 16.97 > > sage: time x = bernoulli(240000) > Wall time: 118.24 > > sage: time x = bernoulli(480000) > Wall time: 540.25 > > and I'll report back with 960000 hopefully within an hour. > > david > > > > > --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
<<inline: bernoulli.png>>
