[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: A faster sum
From: |
Keith Goodman |
Subject: |
Re: A faster sum |
Date: |
Sat, 21 May 2005 08:07:56 -0700 |
On 5/21/05, Victor Eijkhout <address@hidden> wrote:
> You're replacing n^2 operations by n^3. Those operations run faster,
> but there are many more of them.
So in theory the relative speedup decreases as the matrix size
increases? That's not what I get in practice. For a 1000x1000 matrix
the multiplication method is about 3 times faster. For a 5000x5000
matrix it's about 8 times faster.
-------------------------------------------------------------
Octave is freely available under the terms of the GNU GPL.
Octave's home on the web: http://www.octave.org
How to fund new projects: http://www.octave.org/funding.html
Subscription information: http://www.octave.org/archive.html
-------------------------------------------------------------
- A faster sum, Keith Goodman, 2005/05/21
- Re: A faster sum, Victor Eijkhout, 2005/05/21
- Re: A faster sum,
Keith Goodman <=
- Re: A faster sum, Mike Miller, 2005/05/21
- Re: A faster sum, Victor Eijkhout, 2005/05/21
- Re: A faster sum, Keith Goodman, 2005/05/21
- Re: A faster sum, Victor Eijkhout, 2005/05/21
- Re: A faster sum, Mike Miller, 2005/05/21
- Re: A faster sum, John W. Eaton, 2005/05/21