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

tensor: generalized reinterpretation as matrix

Browse Source
This commit is contained in:
Jiri Pittner
2025-11-20 16:24:17 +01:00
parent a342032b58
commit e867a7a8c9
2 changed files with 7 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
tensor.cc
View File

@@ -1731,7 +1731,7 @@ for(int i=0; i<r; ++i)
{ {
Tensor<T> uu=unwind_index(I); Tensor<T> uu=unwind_index(I);
ushape=uu.shape; ushape=uu.shape;
um=uu.matrix(); um=uu.matrix(1);
} }
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());

7
tensor.h
View File

@@ -248,7 +248,12 @@ public:
explicit Tensor(const NRVec<T> &x); explicit Tensor(const NRVec<T> &x);
explicit Tensor(const NRMat<T> &x, bool flat=false); explicit Tensor(const NRMat<T> &x, bool flat=false);
explicit Tensor(const NRSMat<T> &x); explicit Tensor(const NRSMat<T> &x);
NRMat<T> matrix() const {return NRMat<T>(data,data.size()/groupsizes[0],groupsizes[0],0);}; //reinterpret as matrix with column index being the tensor's leftmost index group (typically the unwound single index) //@@@generalize to column index being n leftmost tensor index groups NRMat<T> matrix(int n=1) const //reinterpret as matrix with column index being the tensor's n leftmost index groups (typically the unwound single index)
{
if(n<0||n>shape.size()) laerror("wrong number n in tensor:: matrix()");
LA_largeindex ncol = (n==shape.size()) ? data.size() : cumsizes[n];
return NRMat<T>(data,data.size()/ncol,ncol,0);
};
bool is_named() const {if(names.size()==0) return false; if(names.size()!=myrank) laerror("bad number of index names"); return true;}; bool is_named() const {if(names.size()==0) return false; if(names.size()!=myrank) laerror("bad number of index names"); return true;};
bool is_uniquely_named() const; //no repeated names bool is_uniquely_named() const; //no repeated names