MathGroup Archive 2007

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

Search the Archive

Re: speed of multiplying polynomials


Roman Pearce wrote:
> I bet it is incrementally adding up large numbers.  For example, if I
> have 1000 numbers c[0], ..., c[999], and those numbers are big, then
> the obvious algorithm (in C):
>
> for(i=0, sum=0; i < 1000; i++)
>   sum += c[i];
>
> is a disaster.

Sorry, this is nonsense.  I was confusing addition with multiplication.


  • Prev by Date: MathKernel crashes
  • Next by Date: Re: Re: A Series test
  • Previous by thread: Re: speed of multiplying polynomials
  • Next by thread: Re: speed of multiplying polynomials