The R Project SVN R

Rev

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

Rev 59039 Rev 60095
Line 1... Line 1...
1 
% File src/library/stats/man/fft.Rd
 1 
% File src/library/stats/man/fft.Rd
2 
% Part of the R package, http://www.R-project.org
 2 
% Part of the R package, http://www.R-project.org
3 
% Copyright 1995-2007 R Core Team
 3 
% Copyright 1995-2012 R Core Team
4 
% Distributed under GPL 2 or later
 4 
% Distributed under GPL 2 or later
5 
 
 5 
 
6 
\name{fft}
 6 
\name{fft}
7 
\alias{fft}
 7 
\alias{fft}
8 
\alias{mvfft}
 8 
\alias{mvfft}
Line 43... Line 43...
43 
  The FFT is fastest when the length of the series being transformed
 43 
  The FFT is fastest when the length of the series being transformed
44 
  is highly composite (i.e., has many factors).  If this is not the
 44 
  is highly composite (i.e., has many factors).  If this is not the
45 
  case, the transform may take a long time to compute and will use a
 45 
  case, the transform may take a long time to compute and will use a
46 
  large amount of memory.
 46 
  large amount of memory.
47 
}
 47 
}
- 
 
 48 
\source{
- 
 
 49 
  Uses C translation of Fortran code in Singleton (1979).
- 
 
 50 
}
48 
\references{
 51 
\references{
49 
  Becker, R. A., Chambers, J. M. and Wilks, A. R. (1988)
 52 
  Becker, R. A., Chambers, J. M. and Wilks, A. R. (1988)
50 
  \emph{The New S Language}.
 53 
  \emph{The New S Language}.
51 
  Wadsworth & Brooks/Cole.
 54 
  Wadsworth & Brooks/Cole.
52 
 
 55