MathGroup Archive 2006

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

Search the Archive

Re: Re: Memory operations


> I vote for changing the way you work.
> From my experience, For is the slowest loop in Mathematica.
> Add it to the way that mathematica manage memory with apend, and I think you
> will find it hard to make a less efficient program.
> regards
> yehuda

So, i think you can suggest best how to organize FIFO (or LIFO) query  in
Mathematica(TM).

Problem is that i do not know how many results from operations I'll
get (for example multiple root finding).


TNX.
Sergey


  • Prev by Date: Re: optimization nested in root-finding
  • Next by Date: Re: pictures of mathematics on a non-white background
  • Previous by thread: Re: Memory operations
  • Next by thread: Re: Re: Re: Memory operations