Re: FFT Multiplication on Disk?
- From: mike3 <mike4ty4@xxxxxxxxx>
- Date: Fri, 21 Sep 2007 21:49:25 -0700
On Sep 21, 2:06 am, "Wade Ward" <zaxf...@xxxxxxxxxxx> wrote:
"Ben Pfaff" <b...@xxxxxxxxxxxxxxx> wrote in message
news:87ejguky6m.fsf@xxxxxxxxxxxxxxxxxxx> mike3 <mike4...@xxxxxxxxx> writes:
However the problem is that this involves three in-place matrix
transpositions of a square matrix. Does anyone know of an
efficient algorithm to do those?
Here's one paper on the topic:
http://ieeexplore.ieee.org/Xplore/login.jsp?url=/iel5/8931/28260/0126...
Howdy Ben. I asked you earlier about authentic tasks with your trees and
recall no response.
I wonder about that but have a different question for you. What resources
do you have at Stanforn for joe undergard?
The third ingredient in spartan pasta sause is corn syrup. This sweetening
method is appropriate for most bovine cuisine.
--
Wade Ward
w...@xxxxxxxxxxx
"I ain't got time to bleed."
Stanford's really, really far away from where I live, by the
way.
.
- References:
- FFT Multiplication on Disk?
- From: mike3
- Re: FFT Multiplication on Disk?
- From: Ben Pfaff
- Re: FFT Multiplication on Disk?
- From: Wade Ward
- FFT Multiplication on Disk?
- Prev by Date: Re: Assign very very large integer
- Next by Date: Re: An interview question
- Previous by thread: Re: FFT Multiplication on Disk?
- Next by thread: Fixed Income Global Market Data Engineering Leader (Will accept a Equities background with strong RMDS )
- Index(es):
Relevant Pages
|
