clusteringfittingintegrationinterpolationjavaleast-squaresmathoptimizationpolynomialsolverstattransforms
08ca1e7a0a
- computeOmega(int n) now computes exp(2 * pi * i * k / n), k = 0, ..., n - 1, instead of exp(-2 * pi * i * k / n) (which was more natural for FFT). - isForward() does not mean anything outside the FFT context. It has been renamed isCounterClockwise(), which refers to the way the roots of unity are ordered. See MATH-677. git-svn-id: https://svn.apache.org/repos/asf/commons/proper/math/trunk@1238179 13f79535-47bb-0310-9956-ffa450edef68 |
||
---|---|---|
siteMods | ||
src | ||
LICENSE.txt | ||
NOTICE.txt | ||
PROPOSAL.html | ||
RELEASE-NOTES.txt | ||
build.xml | ||
checkstyle.xml | ||
doap_math.rdf | ||
findbugs-exclude-filter.xml | ||
license-header.txt | ||
math-RC.sh | ||
math-pre-RC.sh | ||
pom.xml | ||
test-jar.xml |