Skip to content
Snippets Groups Projects
Commit 2600d421 authored by René Heß's avatar René Heß
Browse files

Fix documentation typo

parent 9d68f1bc
No related branches found
No related tags found
No related merge requests found
......@@ -364,8 +364,8 @@ def sum_factorization_kernel(a_matrices,
A_l * X --> [m_l,n_l] * [n_l, ...] = [m_l,n_{l+1},...,n_{d-1},m_0,...,m_{l-1}]
R_l (A_l*X) --> [n_{l+1},...,n_{d-1},m_0,...,m_{l-1}]
So the multiplication with A_l is reduction over one index and the
transformation brings the next reduction index in the fastest
So the multiplication with A_l is a reduction over one index and
the transformation brings the next reduction index in the fastest
position.
Note: In the code below the transformation step is directly done
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment