computeFft: Fast Fourier Transform
In rmaestre/variableStars: Efficient software to study patterns on variable stars.
Description
Usage
Arguments
Value
Author(s)
Examples
Description
Compute the discrete fourier transform using the
the fast FT algorithm provided by the Armadillo library
Usage
1
computeFft(v)
Arguments
v
Armadillo vector with numeric elements
Value
A complex vector with the FT result
Author(s)
Roberto Maestre
Examples
1
2
3
4
5
## Not run:
# simple call:
computeFft(sin(seq(1:100)))
## End(Not run)
rmaestre/variableStars documentation built on April 11, 2020, 11:10 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description Usage Arguments Value Author(s) Examples
Description
Compute the discrete fourier transform using the the fast FT algorithm provided by the Armadillo library
Usage
1 | computeFft(v)
|
Arguments
v |
Armadillo vector with numeric elements |
Value
A complex vector with the FT result
Author(s)
Roberto Maestre
Examples
1 2 3 4 5 | ## Not run:
# simple call:
computeFft(sin(seq(1:100)))
## End(Not run)
|
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.