From: "chris.danx" <spamoff.danx@ntlworld.com>
Subject: Re: In place matrix multiplication?
Date: Sun, 01 Jun 2003 14:54:02 +0200
Date: 2003-06-01T14:54:02+02:00 [thread overview]
Message-ID: <BxnCa.16707$Mu3.366629@newsfep4-glfd.server.ntli.net> (raw)
In-Reply-To: <bbcg9c$7u9v9$2@ID-77047.news.dfncis.de>
Dmitry A. Kazakov wrote:
> Something like this, I presume:
>
Thanks Dmitry.
I've simplified it by just using a floating point type, rather than an
abstraction (the abstraction provided only additional complexity and
little benefit otherwise). Now I'm wondering if the cost of the more
complex code is more expensive than doing an out of place multiplication
followed by a copy back to the original array. I guess that'd depend on
the code and the compiler. How do I find out which is cheaper in time
for a given compiler (GNAT)?
Thanks Again,
Chris
next prev parent reply other threads:[~2003-06-01 12:54 UTC|newest]
Thread overview: 4+ messages / expand[flat|nested] mbox.gz Atom feed top
2003-06-01 0:35 In place matrix multiplication? chris.danx
2003-06-01 9:18 ` Dmitry A. Kazakov
2003-06-01 12:54 ` chris.danx [this message]
2003-06-01 14:26 ` Bill Findlay
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox