Re: FFT Multiplication on Disk?



"Ben Pfaff" <blp@xxxxxxxxxxxxxxx> wrote in message
news:87ejguky6m.fsf@xxxxxxxxxxxxxxxxxxx
mike3 <mike4ty4@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/01263520.pdf
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
wade@xxxxxxxxxxx
"I ain't got time to bleed."


.

Relevant Pages

  • Re: FFT Multiplication on Disk?
    ... transpositions of a square matrix. ... efficient algorithm to do those? ... I asked you earlier about authentic tasks with your trees and ...
    (comp.programming)
  • Re: FFT Multiplication on Disk?
    ... transpositions of a square matrix. ... efficient algorithm to do those? ... "J'avais trouv'e ma religion: ...
    (comp.programming)
  • Re: FFT Multiplication on Disk?
    ... transpositions of a square matrix. ... efficient algorithm to do those? ... Richard Harter, cri@xxxxxxxx ...
    (comp.programming)
  • Re: FFT Multiplication on Disk?
    ... transpositions of a square matrix. ... Richard Harter, c...@xxxxxxxxxxxx://home.tiac.net/~cri,http://www.varinoma.com ... I want to minimize the amount of disk operations, ...
    (comp.programming)