I met a last difficulty I didnt solve.
I didnt see it 4 hours ago because of the sample limitation at dimension 2.
If I work on :
Inner[dwproduct, ( {
{1, On, 0, 0},
{On, 1, On, On},
{0, On, 1, 0},
{0, On, 0, 1}
} ), ( { {V},{N},{N},{N} } ), wsum]
The given result is
{
{wsum[V, N, 0, 0]},
{wsum[V, N, N, N]},
{wsum[0, N, N, 0]},
{wsum[0, N, 0, N]}
}
So, how to define wsum a general/generic way to avoid specialize for each tuple ? (i probably will compute samples with matrices at dimension 600 and more)
Could I imagine something recursive (or not) that will transfer "evaluation capability" to binary operation ?
Let's say wsum[x1,x2,x3,...,xn]= ((((x1)+x2)+x3)+...)+xn
