removed characters needing a specific encoding
git-svn-id: https://svn.apache.org/repos/asf/commons/proper/math/trunk@724205 13f79535-47bb-0310-9956-ffa450edef68
This commit is contained in:
parent
1021f180e5
commit
3ac5b7b902
|
@ -16,12 +16,12 @@
|
|||
*/
|
||||
package org.apache.commons.math.transform;
|
||||
|
||||
import java.lang.reflect.Array;
|
||||
import java.io.Serializable;
|
||||
import java.util.Arrays;
|
||||
import org.apache.commons.math.analysis.*;
|
||||
import org.apache.commons.math.complex.*;
|
||||
import java.lang.reflect.Array;
|
||||
|
||||
import org.apache.commons.math.MathException;
|
||||
import org.apache.commons.math.analysis.UnivariateRealFunction;
|
||||
import org.apache.commons.math.complex.Complex;
|
||||
|
||||
/**
|
||||
* Implements the <a href="http://mathworld.wolfram.com/FastFourierTransform.html">
|
||||
|
@ -569,8 +569,9 @@ public class FastFourierTransformer implements Serializable {
|
|||
* Performs a multi-dimensional Fourier transform on a given
|
||||
* array, using {@link #inversetransform2(Complex[])} and
|
||||
* {@link #transform2(Complex[])} in a row-column implementation
|
||||
* in any number of dimensions with Θ(N×log(N)) complexity with
|
||||
* N=n_1×n_2×n_3×⋯×n_d, n_x=number of elements in dimension x,
|
||||
* in any number of dimensions with O(N×log(N)) complexity with
|
||||
* N=n<sub>1</sub>×n<sub>2</sub>×n<sub>3</sub>×...×n<sub>d</sub>,
|
||||
* n<sub>x</sub>=number of elements in dimension x,
|
||||
* and d=total number of dimensions.
|
||||
*
|
||||
* @param forward inverseTransform2 is preformed if this is false
|
||||
|
|
Loading…
Reference in New Issue