X-Git-Url: https://git.donarmstrong.com/?p=mothur.git;a=blobdiff_plain;f=linearalgebra.h;h=5819ea85d8deefba15ca1c45ccf03efd21c9321a;hp=286649374e1bd5a4768c257f564e86fb8ca14567;hb=b25ede2ad307ae76f8a610443e0ec3ec69621ce7;hpb=37eac2026d91179acda0494c4dcca22f176551b9

diff --git a/linearalgebra.h b/linearalgebra.h
index 2866493..5819ea8 100644
--- a/linearalgebra.h
+++ b/linearalgebra.h
@@ -12,6 +12,7 @@
 
 #include "mothurout.h"
 
+
 class LinearAlgebra {
 	
 public:
@@ -19,15 +20,58 @@ public:
 	~LinearAlgebra() {}
 	
 	vector<vector<double> > matrix_mult(vector<vector<double> >, vector<vector<double> >);
+	void recenter(double, vector<vector<double> >, vector<vector<double> >&);
 	int tred2(vector<vector<double> >&, vector<double>&, vector<double>&);
 	int qtli(vector<double>&, vector<double>&, vector<vector<double> >&);
-	vector< vector<double> > calculateEuclidianDistance(vector<vector<double> >&, int);
+	vector< vector<double> > calculateEuclidianDistance(vector<vector<double> >&, int); //pass in axes and number of dimensions
+	vector< vector<double> > calculateEuclidianDistance(vector<vector<double> >&); //pass in axes
+	vector<vector<double> > getObservedEuclideanDistance(vector<vector<double> >&);
 	double calcPearson(vector<vector<double> >&, vector<vector<double> >&);
+	double calcSpearman(vector<vector<double> >&, vector<vector<double> >&);
+	double calcKendall(vector<vector<double> >&, vector<vector<double> >&);
+    double calcKruskalWallis(vector<spearmanRank>&, double&);
+    double calcWilcoxon(vector<double>&, vector<double>&, double&);
 	
+	double calcPearson(vector<double>&, vector<double>&, double&);
+	double calcSpearman(vector<double>&, vector<double>&, double&);
+	double calcKendall(vector<double>&, vector<double>&, double&);
+    
+	double calcSpearmanSig(double, double, double, double); //length, f^3 - f where f is the number of ties in x, f^3 - f where f is the number of ties in y, sum of squared diffs in ranks. - designed to find the sif of one score.
+    double calcPearsonSig(double, double); //length, coeff.
+    double calcKendallSig(double, double); //length, coeff.
+    
+    vector<double> solveEquations(vector<vector<double> >, vector<double>);
+    vector<float> solveEquations(vector<vector<float> >, vector<float>);
+    vector<vector<double> > getInverse(vector<vector<double> >);
+    
+    
 private:
 	MothurOut* m;
 	
 	double pythag(double, double);
+    double betacf(const double, const double, const double);
+    double betai(const double, const double, const double);
+    double gammln(const double);
+    double gammq(const double, const double);
+    double gser(double&, const double, const double, double&);
+    double gcf(double&, const double, const double, double&);
+    double erfcc(double);
+    double gammp(const double, const double);
+    
+    double ran0(int&); //for testing 
+    double ran1(int&); //for testing
+    double ran2(int&); //for testing
+    double ran3(int&); //for testing
+    double ran4(int&); //for testing
+    void psdes(unsigned long &, unsigned long &); //for testing
+    
+    void ludcmp(vector<vector<double> >&, vector<int>&, double&);
+    void lubksb(vector<vector<double> >&, vector<int>&, vector<double>&);
+    
+    void ludcmp(vector<vector<float> >&, vector<int>&, float&);
+    void lubksb(vector<vector<float> >&, vector<int>&, vector<float>&);
+
+    
 };
 
 #endif