MathGroup Archive 2007

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: Intensive numerical calculations

  • To: mathgroup at
  • Subject: [mg80416] Re: Intensive numerical calculations
  • From: Cristian <LumisrobTogliquesto at>
  • Date: Wed, 22 Aug 2007 04:38:33 -0400 (EDT)
  • References: <f9s445$all$><fabgog$id8$> <fae9u4$ec7$>

On Tue, 21 Aug 2007 09:06:12 +0000 (UTC), Yaroslav Bulatov
<yaroslavvb at> wrote:

>Efficiency can vary depending on your implementation. For instance
>here's a range of solutions to the problem of sampling markov chains,
>and their execution times varies by a factor of more than 2000. The
>fastest solution had similar runtime to optimized C code.

They are academic examples or almost..... tries to work with matrixes
of 10^5 x 10 ^5 ( double)  and to use some graphics and to hold
everything in memory... he goes to footstep of snail and there is no
solution... Real problem (structural project for examples )...We can
climb only on the mirrors...(matlink, etc etc etc..)  And then test in
c++ ...compile and  use.....

  • Prev by Date: Re: On partitioning lists by intervals
  • Next by Date: Re: generalized 2d IFS for D_n Cartan group using MathWorld
  • Previous by thread: Re: Intensive numerical calculations
  • Next by thread: Re: Re: Intensive numerical calculations