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

tensor: name treatment in apply_permutation_algebra

Browse Source
This commit is contained in:
Jiri Pittner
2025-11-13 17:57:26 +01:00
parent 883b8565c0
commit c7c21ee1a8
3 changed files with 49 additions and 11 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
t.cc
View File

@@ -3568,7 +3568,7 @@ v.printsorted(cout,1,false);
}
if(0)
if(1)
{
//grassmann product of n identical rank=2 tensors in m-dim space
int n,m;
@@ -4140,7 +4140,7 @@ cout <<x*s1<<endl;
cout<<s1*s2<<endl;
}
if(1)
if(0)
{
int r;
int n;

54
tensor.cc
View File

@@ -1242,6 +1242,15 @@ auxmatmult<T>(nn,mm,kk,&data[0],&u.data[0], &rhsu.data[0],alpha,beta,conjugate);
}
template<typename T>
bool Tensor<T>::is_uniquely_named() const
{
if(!is_named()) return false;
bool r=true;
for(int i=1; i<names.size();++i) for(int j=0; j<i; ++j) if(names[i]==names[j]) r=false;
return r;
}
template<typename T>
void Tensor<T>::addcontractions(const Tensor &rhs1, const INDEXLIST &il1, const Tensor &rhs2, const INDEXLIST &il2, T alpha, T beta, bool doresize, bool conjugate1, bool conjugate2)
@@ -1406,14 +1415,14 @@ FLATINDEX J = superindex2flat(I);
for(int p=0; p<help_pa<T>->size(); ++p)
{
FLATINDEX Jp = J.permuted((*help_pa<T>)[p].perm,help_inverse);
*v += help_alpha<T> * (*help_pa<T>)[p].weight * (*help_t<T>)(Jp);
*v += help_alpha<T> * (*help_pa<T>)[p].weight * (*help_tt<T>)(Jp);
}
}
static int help_tn;
template<typename T>
static Tensor<T> *help_tv;
static const Tensor<T> *help_tv;
template<typename T>
static void permutationalgebra_callback2(const SUPERINDEX &I, T *v)
@@ -1447,7 +1456,18 @@ copyonwrite();
if(rank()!=rhs.rank()) laerror("rank mismatch in apply_permutation_algebra");
help_t<T> = const_cast<Tensor<T> *>(&rhs);
if(rhs.is_named())
{
NRVec<INDEXNAME> namperm = rhs.names.permuted(pa[0].perm,inverse);
if(is_named())
{
if(names!=namperm) laerror("inconsistent index names in apply_permutation_algebra");
}
else
names=namperm;
}
help_tt<T> = &rhs;
help_pa<T> = &pa;
help_inverse = inverse;
help_alpha<T> = alpha;
@@ -1466,7 +1486,22 @@ int totrank=0;
for(int i=0; i<rhsvec.size(); ++i) totrank+=rhsvec[i].rank();
if(totrank!=rank()) laerror("rank mismatch in apply_permutation_algebra");
help_tv<T> = const_cast<Tensor<T> *>(&rhsvec[0]);
bool allnamed=true;
for(int i=0; i<rhsvec.size(); ++i) if(!rhsvec[i].is_named()) allnamed=false;
if(allnamed)
{
NRVec<INDEXNAME> allrhsnames=rhsvec[0].names;
for(int i=1; i<rhsvec.size(); ++i) allrhsnames.concatme(rhsvec[i].names);
NRVec<INDEXNAME> namperm = allrhsnames.permuted(pa[0].perm,inverse);
if(is_named())
{
if(names!=namperm) laerror("inconsistent index names in apply_permutation_algebra");
}
else
names=namperm;
}
help_tv<T> = &rhsvec[0];
help_tn = rhsvec.size();
help_pa<T> = &pa;
help_inverse = inverse;
@@ -1512,9 +1547,10 @@ if(data.size()!=newsize) laerror("internal error in split_index_group");
template<typename T>
void Tensor<T>::split_index_group1(int group)
{
const INDEXGROUP *sh = &(* const_cast<const NRVec<INDEXGROUP> *>(&shape))[0];
if(group<0||group >= shape.size()) laerror("illegal index group number");
if(shape[group].number==1) return; //nothing to split
if(shape[group].symmetry!=0) laerror("only non-symmetric index group can be splitted, use flatten instead");
if(sh[group].number==1) return; //nothing to split
if(sh[group].symmetry!=0) laerror("only non-symmetric index group can be splitted, use flatten instead");
NRVec<INDEXGROUP> newshape(shape.size()+1);
int gg=0;
@@ -1522,15 +1558,15 @@ for(int g=0; g<shape.size(); ++g)
{
if(g==group)
{
newshape[gg] = shape[group];
newshape[gg] = sh[group];
newshape[gg].number = 1;
gg++;
newshape[gg] = shape[group];
newshape[gg] = sh[group];
newshape[gg].number -= 1;
gg++;
}
else
newshape[gg++] = shape[g];
newshape[gg++] = sh[g];
}
shape=newshape;

2
tensor.h
View File

@@ -225,6 +225,7 @@ public:
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)
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_flat() const {for(int i=0; i<shape.size(); ++i) if(shape[i].number>1) return false; return true;};
bool is_compressed() const {for(int i=0; i<shape.size(); ++i) if(shape[i].number>1&&shape[i].symmetry!=0) return true; return false;};
bool has_symmetry() const {for(int i=0; i<shape.size(); ++i) if(shape[i].symmetry!=0) return true; return false;};
@@ -264,6 +265,7 @@ public:
int findflatindex(const INDEXNAME nam) const;
INDEX findindex(const INDEXNAME nam) const;
NRVec<INDEX> findindexlist(const NRVec<INDEXNAME> &names) const;
void renameindex(const INDEXNAME namfrom, const INDEXNAME nameto) {int i=findflatindex(namfrom); names[i]=nameto;};
inline Tensor& operator+=(const Tensor &rhs)
{