The R Project SVN R

Rev

Rev 25099 | Go to most recent revision | Show entire file | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 25099 Rev 27625
Line 33... Line 33...
33 
  By contrast, \code{mvfft} takes a real or complex matrix as argument,
 33 
  By contrast, \code{mvfft} takes a real or complex matrix as argument,
34 
  and returns a similar shaped matrix, but with each column replaced by
 34 
  and returns a similar shaped matrix, but with each column replaced by
35 
  its discrete Fourier transform.  This is useful for analyzing
 35 
  its discrete Fourier transform.  This is useful for analyzing
36 
  vector-valued series.
 36 
  vector-valued series.
37 
 
 37 
 
38 
  The FFT is fastest when the length of of the series being transformed
 38 
  The FFT is fastest when the length of the series being transformed
39 
  is highly composite (i.e., has many factors).  If this is not the
 39 
  is highly composite (i.e., has many factors).  If this is not the
40 
  case, the transform may take a long time to compute and will use a
 40 
  case, the transform may take a long time to compute and will use a
41 
  large amount of memory.
 41 
  large amount of memory.
42 
}
 42 
}
43 
\references{
 43 
\references{