Re: FFT Multiplication on Disk?

On Sep 19, 5:55 pm, Ben Pfaff <b...@xxxxxxxxxxxxxxx> wrote:
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...
--
"J'avais trouv'e ma religion :
rien ne me parut plus important qu'un livre.
La biblioth`eque, j'y voyais un temple."
--Jean-Paul Sartre

That looks like it's going to cost me a good sum of MONEY
to get that paper. I don't have lots of that nice green stuff on
hand given my current financial situation, unfortunately.

.

Relevant Pages

  • Re: FFT Multiplication on Disk?
    ... transpositions of a square matrix. ... efficient algorithm to do those? ... The third ingredient in spartan pasta sause is corn syrup. ...
    (comp.programming)
  • 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? ... 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)