jiri/LA_library
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

removed test prints

Browse Source
This commit is contained in:
Jiri Pittner 2025-10-22 17:12:21 +02:00
parent d46c2d7235
commit a3ace7c757
1 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
tensor.cc
View File

@ -1114,7 +1114,7 @@ if(r==1) //create an analogous output for the trivial case
return ret; return ret;
} }
//loop over all indices; relies on the fact tha unwinding does not change order of remaining indices //loop over all indices; relies on the fact that unwinding does not change order of remaining indices
for(int i=0; i<r; ++i) for(int i=0; i<r; ++i)
{ {
INDEX I=indexposition(i,shape); INDEX I=indexposition(i,shape);
@ -1128,11 +1128,11 @@ for(int i=0; i<r; ++i)
int mini=um.nrows(); if(um.ncols()<mini) mini=um.ncols(); //compact SVD, expect descendingly sorted values int mini=um.nrows(); if(um.ncols()<mini) mini=um.ncols(); //compact SVD, expect descendingly sorted values
NRMat<T> u(um.nrows(),mini),vt(mini,um.ncols()); NRMat<T> u(um.nrows(),mini),vt(mini,um.ncols());
NRVec<typename LA_traits<T>::normtype> w(mini); NRVec<typename LA_traits<T>::normtype> w(mini);
std::cout << "decomposing "<<um<<std::endl; //std::cout << "decomposing "<<um<<std::endl;
singular_decomposition(um,&u,w,&vt,0); singular_decomposition(um,&u,w,&vt,0);
std::cout << "resulting U "<<u<<std::endl; //std::cout << "resulting U "<<u<<std::endl;
std::cout << "resulting W "<<w<<std::endl; //std::cout << "resulting W "<<w<<std::endl;
std::cout << "resulting VT "<<vt<<std::endl; //std::cout << "resulting VT "<<vt<<std::endl;
um.resize(0,0); //deallocate um.resize(0,0); //deallocate
int preserve=mini; int preserve=mini;
for(int k=0; k<mini; ++k) if(w[k]<thr) {preserve=k; break;} for(int k=0; k<mini; ++k) if(w[k]<thr) {preserve=k; break;}