From 06337f0dc8114c70fd0c7767083971a0d091750a Mon Sep 17 00:00:00 2001
From: Sandeep Gupta
Date: Wed, 5 Jul 2017 12:41:25 +0530
Subject: LinearAlgebra and MatrixOperation Update

---
 src/c/linearAlgebra/svd/zsvda.c | 33 +++++++++++++++++++++------------
 1 file changed, 21 insertions(+), 12 deletions(-)

(limited to 'src/c/linearAlgebra/svd/zsvda.c')

diff --git a/src/c/linearAlgebra/svd/zsvda.c b/src/c/linearAlgebra/svd/zsvda.c
index 0d36022..12a07aa 100644
--- a/src/c/linearAlgebra/svd/zsvda.c
+++ b/src/c/linearAlgebra/svd/zsvda.c
@@ -113,7 +113,16 @@ void zsvda(doubleComplex *in1,int row,int col,int in2,int nout, doubleComplex *o
 						out3[i+j*N] = zconjs(VT[j+i*N]);
 						out3[j+i*N] = zconjs(VT[i+j*N]);				
 					}
-				}			
+				}	
+				/* output from zgesvd is copied to out2 variables in required format*/
+				for(j=0;j<M;j++){
+					for(k=0;k<N;k++){
+						if(j == k)
+							out2[j*(Min(M,N))+k] = DoubleComplex(S[j],0);
+						else 
+							out2[j*(Min(M,N))+k] = DoubleComplex(0,0);					
+					}
+				}		
 				//ztransposea(VT,LDVT,Min(M,N),out3);
 				/*for(i=0;i<N;i++){
 					for(j=0;j<N;j++){
@@ -124,7 +133,7 @@ void zsvda(doubleComplex *in1,int row,int col,int in2,int nout, doubleComplex *o
 				//free(U);
 				//free(VT);
 			}
-			else{
+			else{	/*svd(x,'e')*/
 				LDA = M;
 				LDU = M;
 				if(M > N){
@@ -156,18 +165,18 @@ void zsvda(doubleComplex *in1,int row,int col,int in2,int nout, doubleComplex *o
 					for(j=0;j<N;j++){
 						out3[j+i*N] = zconjs(VT[i+j*Min(M,N)]);				
 					}
-				}								
+				}
+				/* output from zgesvd is copied to out2 variables in required format*/
+				for(j=0;j<Min(M,N);j++){
+					for(k=0;k<Min(M,N);k++){
+						if(j == k)
+							out2[j*(Min(M,N))+k] = DoubleComplex(S[j],0);
+						else 
+							out2[j*(Min(M,N))+k] = DoubleComplex(0,0);					
+					}
+				}						
 				//free(U);
 				//free(VT);
 			}
-			/* output from zgesvd is copied to out2 variables in required format*/
-			for(j=0;j<Min(M,N);j++){
-				for(k=0;k<Min(M,N);k++){
-					if(j == k)
-						out2[j*(Min(M,N))+k] = DoubleComplex(S[j],0);
-					else 
-						out2[j*(Min(M,N))+k] = DoubleComplex(0,0);					
-				}
-			}
 		}
 }
-- 
cgit 


From ea958d3c401761dcc24865d9639b2fab31038db8 Mon Sep 17 00:00:00 2001
From: Brijeshcr
Date: Thu, 6 Jul 2017 15:48:47 +0530
Subject: Revert "LinearAlgebra Function Added"

---
 src/c/linearAlgebra/svd/zsvda.c | 33 ++++++++++++---------------------
 1 file changed, 12 insertions(+), 21 deletions(-)

(limited to 'src/c/linearAlgebra/svd/zsvda.c')

diff --git a/src/c/linearAlgebra/svd/zsvda.c b/src/c/linearAlgebra/svd/zsvda.c
index 12a07aa..0d36022 100644
--- a/src/c/linearAlgebra/svd/zsvda.c
+++ b/src/c/linearAlgebra/svd/zsvda.c
@@ -113,16 +113,7 @@ void zsvda(doubleComplex *in1,int row,int col,int in2,int nout, doubleComplex *o
 						out3[i+j*N] = zconjs(VT[j+i*N]);
 						out3[j+i*N] = zconjs(VT[i+j*N]);				
 					}
-				}	
-				/* output from zgesvd is copied to out2 variables in required format*/
-				for(j=0;j<M;j++){
-					for(k=0;k<N;k++){
-						if(j == k)
-							out2[j*(Min(M,N))+k] = DoubleComplex(S[j],0);
-						else 
-							out2[j*(Min(M,N))+k] = DoubleComplex(0,0);					
-					}
-				}		
+				}			
 				//ztransposea(VT,LDVT,Min(M,N),out3);
 				/*for(i=0;i<N;i++){
 					for(j=0;j<N;j++){
@@ -133,7 +124,7 @@ void zsvda(doubleComplex *in1,int row,int col,int in2,int nout, doubleComplex *o
 				//free(U);
 				//free(VT);
 			}
-			else{	/*svd(x,'e')*/
+			else{
 				LDA = M;
 				LDU = M;
 				if(M > N){
@@ -165,18 +156,18 @@ void zsvda(doubleComplex *in1,int row,int col,int in2,int nout, doubleComplex *o
 					for(j=0;j<N;j++){
 						out3[j+i*N] = zconjs(VT[i+j*Min(M,N)]);				
 					}
-				}
-				/* output from zgesvd is copied to out2 variables in required format*/
-				for(j=0;j<Min(M,N);j++){
-					for(k=0;k<Min(M,N);k++){
-						if(j == k)
-							out2[j*(Min(M,N))+k] = DoubleComplex(S[j],0);
-						else 
-							out2[j*(Min(M,N))+k] = DoubleComplex(0,0);					
-					}
-				}						
+				}								
 				//free(U);
 				//free(VT);
 			}
+			/* output from zgesvd is copied to out2 variables in required format*/
+			for(j=0;j<Min(M,N);j++){
+				for(k=0;k<Min(M,N);k++){
+					if(j == k)
+						out2[j*(Min(M,N))+k] = DoubleComplex(S[j],0);
+					else 
+						out2[j*(Min(M,N))+k] = DoubleComplex(0,0);					
+				}
+			}
 		}
 }
-- 
cgit 


From 7a7f685a8436b456b246c49baf76bb8af930b214 Mon Sep 17 00:00:00 2001
From: Sandeep Gupta
Date: Fri, 7 Jul 2017 00:29:35 +0530
Subject: NORM

---
 src/c/linearAlgebra/svd/zsvda.c | 33 +++++++++++++++++++++------------
 1 file changed, 21 insertions(+), 12 deletions(-)

(limited to 'src/c/linearAlgebra/svd/zsvda.c')

diff --git a/src/c/linearAlgebra/svd/zsvda.c b/src/c/linearAlgebra/svd/zsvda.c
index 0d36022..12a07aa 100644
--- a/src/c/linearAlgebra/svd/zsvda.c
+++ b/src/c/linearAlgebra/svd/zsvda.c
@@ -113,7 +113,16 @@ void zsvda(doubleComplex *in1,int row,int col,int in2,int nout, doubleComplex *o
 						out3[i+j*N] = zconjs(VT[j+i*N]);
 						out3[j+i*N] = zconjs(VT[i+j*N]);				
 					}
-				}			
+				}	
+				/* output from zgesvd is copied to out2 variables in required format*/
+				for(j=0;j<M;j++){
+					for(k=0;k<N;k++){
+						if(j == k)
+							out2[j*(Min(M,N))+k] = DoubleComplex(S[j],0);
+						else 
+							out2[j*(Min(M,N))+k] = DoubleComplex(0,0);					
+					}
+				}		
 				//ztransposea(VT,LDVT,Min(M,N),out3);
 				/*for(i=0;i<N;i++){
 					for(j=0;j<N;j++){
@@ -124,7 +133,7 @@ void zsvda(doubleComplex *in1,int row,int col,int in2,int nout, doubleComplex *o
 				//free(U);
 				//free(VT);
 			}
-			else{
+			else{	/*svd(x,'e')*/
 				LDA = M;
 				LDU = M;
 				if(M > N){
@@ -156,18 +165,18 @@ void zsvda(doubleComplex *in1,int row,int col,int in2,int nout, doubleComplex *o
 					for(j=0;j<N;j++){
 						out3[j+i*N] = zconjs(VT[i+j*Min(M,N)]);				
 					}
-				}								
+				}
+				/* output from zgesvd is copied to out2 variables in required format*/
+				for(j=0;j<Min(M,N);j++){
+					for(k=0;k<Min(M,N);k++){
+						if(j == k)
+							out2[j*(Min(M,N))+k] = DoubleComplex(S[j],0);
+						else 
+							out2[j*(Min(M,N))+k] = DoubleComplex(0,0);					
+					}
+				}						
 				//free(U);
 				//free(VT);
 			}
-			/* output from zgesvd is copied to out2 variables in required format*/
-			for(j=0;j<Min(M,N);j++){
-				for(k=0;k<Min(M,N);k++){
-					if(j == k)
-						out2[j*(Min(M,N))+k] = DoubleComplex(S[j],0);
-					else 
-						out2[j*(Min(M,N))+k] = DoubleComplex(0,0);					
-				}
-			}
 		}
 }
-- 
cgit 


From eecd667c2f6ad705cb56fa0c8718b4ab37ac92d5 Mon Sep 17 00:00:00 2001
From: Sandeep Gupta
Date: Fri, 7 Jul 2017 01:57:31 +0530
Subject: SVA Function

---
 src/c/linearAlgebra/svd/zsvda.c | 1 +
 1 file changed, 1 insertion(+)

(limited to 'src/c/linearAlgebra/svd/zsvda.c')

diff --git a/src/c/linearAlgebra/svd/zsvda.c b/src/c/linearAlgebra/svd/zsvda.c
index 12a07aa..c75cc50 100644
--- a/src/c/linearAlgebra/svd/zsvda.c
+++ b/src/c/linearAlgebra/svd/zsvda.c
@@ -19,6 +19,7 @@
 #include "matrixTranspose.h"
 #include "conj.h"
 
+/* Lapack functions used . */
 extern doubleComplex zgesvd_( char* , char* , int* , int* ,doubleComplex *,\
                 int* , double* ,doubleComplex* , int* ,doubleComplex* , int* ,\
                  doubleComplex* , int* , double* , int* );
-- 
cgit