clusteringfittingintegrationinterpolationjavaleast-squaresmathoptimizationpolynomialsolverstattransforms
924041770d
this version is not finished yet, but it does work when eigenvalues are well separated and is faster than JAMA for dimensions above 100. It still needs work as the MRRR algorithm is not implemented yet (only the basic parts with twisted factorization is there). I continue working on this, but wanted to have a first version committed to let people play with it and as a basis for comparison. git-svn-id: https://svn.apache.org/repos/asf/commons/proper/math/branches/MATH_2_0@701897 13f79535-47bb-0310-9956-ffa450edef68 |
||
---|---|---|
src | ||
LICENSE.txt | ||
NOTICE.txt | ||
PROPOSAL.html | ||
RELEASE-NOTES.txt | ||
build.properties.sample | ||
build.xml | ||
checkstyle.xml | ||
doap_math.rdf | ||
findbugs-exclude-filter.xml | ||
license-header.txt | ||
maven.xml | ||
pom.xml | ||
project.properties | ||
project.xml | ||
release-notes.jsl | ||
test-jar.xml | ||
testOnly.sh |