# 0.4 Implementing kronecker products efficiently  (Page 2/2)

 Page 2 / 2
$\mathcal{C}\left(g\right)={\mathcal{Q}}_{g\left(1\right)}{c}_{g\left(2\right)}{c}_{g\left(3\right)}+{r}_{g\left(1\right)}{\mathcal{Q}}_{g\left(2\right)}{c}_{g\left(3\right)}+{r}_{g\left(1\right)}{r}_{g\left(2\right)}{\mathcal{Q}}_{g\left(3\right)}$

In general

$\mathcal{C}\left(g\right)=\sum _{i=1}^{n}\left(\prod _{j=1}^{i-1},{r}_{g\left(j\right)}\right){\mathcal{Q}}_{g\left(i\right)}\left(\prod _{j=i+1}^{n},{c}_{g\left(j\right)}\right).$

Therefore, the most efficient factorization of ${\otimes }_{i}{A}_{i}$ is described by the permutation $g\left(·\right)$ that minimizes $\mathcal{C}$ .

It turns out that for the Kronecker product of more than two matrices, the ordering of operations that describesthe most efficient factorization of ${\otimes }_{i}{A}_{i}$ also depends only on the ratios $\left({r}_{i}-{c}_{i}\right)/{\mathcal{Q}}_{i}$ . To show that this is the case, suppose $u\left(·\right)$ is the permutation that minimizes $\mathcal{C}$ , then $u\left(·\right)$ has the property that

$\frac{{r}_{u\left(k\right)}-{c}_{u\left(k\right)}}{{\mathcal{Q}}_{u\left(k\right)}}\le \frac{{r}_{u\left(k+1\right)}-{c}_{u\left(k+1\right)}}{{\mathcal{Q}}_{u\left(k+1\right)}}$

for $k=1,\cdots ,n-1$ . To support this, note that since $u\left(·\right)$ is the permutation that minimizes $\mathcal{C}$ , we have in particular

$\mathcal{C}\left(u\right)\le \mathcal{C}\left(v\right)$

where $v\left(·\right)$ is the permutation defined by the following:

$v\left(i\right)=\left\{\begin{array}{cc}u\left(i\right)\hfill & ik+1\hfill \\ u\left(k+1\right)\hfill & i=k\hfill \\ u\left(k\right)\hfill & i=k+1\hfill \end{array}.$

Because only two terms in [link] are different, we have from [link]

$\sum _{i=k}^{k+1}\left(\prod _{j=1}^{i-1},{r}_{u\left(j\right)}\right){\mathcal{Q}}_{u\left(i\right)}\left(\prod _{j=i+1}^{n},{c}_{u\left(j\right)}\right)\le \sum _{i=k}^{k+1}\left(\prod _{j=1}^{i-1},{r}_{v\left(j\right)}\right){\mathcal{Q}}_{v\left(i\right)}\left(\prod _{j=i+1}^{n},{c}_{v\left(j\right)}\right)$

which, after canceling common terms from each side, gives

${\mathcal{Q}}_{u\left(k\right)}{c}_{u\left(k+1\right)}+{r}_{u\left(k\right)}{\mathcal{Q}}_{u\left(k+1\right)}\le {\mathcal{Q}}_{v\left(k\right)}{c}_{v\left(k+1\right)}+{r}_{v\left(k\right)}{\mathcal{Q}}_{v\left(k+1\right)}.$

Since $v\left(k\right)=u\left(k+1\right)$ and $v\left(k+1\right)=u\left(k\right)$ this becomes

${\mathcal{Q}}_{u\left(k\right)}{c}_{u\left(k+1\right)}+{r}_{u\left(k\right)}{\mathcal{Q}}_{u\left(k+1\right)}\le {\mathcal{Q}}_{u\left(k+1\right)}{c}_{u\left(k\right)}+{r}_{u\left(k+1\right)}{\mathcal{Q}}_{u\left(k\right)}$

which is equivalent to [link] . Therefore, to find the best factorization of ${\otimes }_{i}{A}_{i}$ it is necessary only to compute the ratios $\left({r}_{i}-{c}_{i}\right)/{\mathcal{Q}}_{i}$ and to order them in an non-decreasing order. The operation ${A}_{i}$ whose index appears first in this list is applied to the data vector $x$ first, and so on

As above, if ${r}_{u\left(k+1\right)}>{c}_{u\left(k+1\right)}$ and ${r}_{u\left(k\right)}<{c}_{u\left(k\right)}$ then [link] is always true. Therefore, in the most computationally efficientfactorization of ${\otimes }_{i}{A}_{i}$ , all matrices with fewer rows than columns are always applied to the data vector $x$ before any matrices with more rows than columns.If some matrices are square, then their ordering does not affect the computational efficiency as longas they are applied after all matrices with fewer rows than columns and before all matrices with more rows than columns.

Once the permutation $g\left(·\right)$ that minimizes $\mathcal{C}$ is determined by ordering the ratios $\left({r}_{i}-{c}_{i}\right)/{\mathcal{Q}}_{i}$ , ${\otimes }_{i}{A}_{i}$ can be written as

$\underset{i=1}{\overset{n}{\otimes }}{A}_{i}=\prod _{i=n}^{1}{I}_{a\left(i\right)}\otimes {A}_{g\left(i\right)}\otimes {I}_{b\left(i\right)}$

where

$a\left(i\right)=\prod _{k=1}^{g\left(i\right)-1}\gamma \left(i,k\right)$
$b\left(i\right)=\prod _{k=g\left(i\right)+1}^{n}\gamma \left(i,k\right)$

and where $\gamma \left(·\right)$ is defined by

$\gamma \left(i,k\right)=\left\{\begin{array}{cc}{r}_{k}\hfill & \text{if}\phantom{\rule{4.pt}{0ex}}g\left(i\right)>g\left(k\right)\hfill \\ {c}_{k}\hfill & \text{if}\phantom{\rule{4.pt}{0ex}}g\left(i\right)

## Some matlab code

A Matlab program that computes the permutation that describes the computationally most efficientfactorization of ${\otimes }_{i=1}^{n}{A}_{i}$ is cgc() . It also gives the resulting computational cost.It requires the computational cost of each of the matrices ${A}_{i}$ and the number of rows and columns of each.

function [g,C] = cgc(Q,r,c,n)% [g,C] = cgc(Q,r,c,n);% Compute g and C % g : permutation that minimizes C% C : computational cost of Kronecker product of A(1),...,A(n) % Q : computation cost of A(i)% r : rows of A(i) % c : columns of A(i)% n : number of terms f = find(Q==0);Q(f) = eps * ones(size(Q(f))); Q = Q(:);r = r(:); c = c(:);[s,g] = sort((r-c)./Q);C = 0; for i = 1:nC = C + prod(r(g(1:i-1)))*Q(g(i))*prod(c(g(i+1:n))); endC = round(C);

The Matlab program kpi() implements the Kronecker product ${\otimes }_{i=1}^{n}{A}_{i}$ .

function y = kpi(d,g,r,c,n,x) % y = kpi(d,g,r,c,n,x);% Kronecker Product : A(d(1)) kron ... kron A(d(n)) % g : permutation of 1,...,n% r : [r(1),...,r(n)] % c : [c(1),..,c(n)]% r(i) : rows of A(d(i)) % c(i) : columns of A(d(i))% n : number of terms for i = 1:na = 1; for k = 1:(g(i)-1)if i>find(g==k) a = a * r(k);else a = a * c(k);end endb = 1; for k = (g(i)+1):nif i>find(g==k) b = b * r(k);else b = b * c(k);end end% y = (I(a) kron A(d(g(i))) kron I(b)) * x; y = IAI(d(g(i)),a,b,x);end

where the last line of code calls a function that implements $\left({I}_{a}\otimes {A}_{d\left(g\left(i\right)\right)}\otimes {I}_{b}\right)x$ . That is, the program IAI(i,a,b,x) implements $\left({I}_{a}\otimes A\left(i\right)\otimes {I}_{b}\right)x$ .

The Matlab program IAI implements $y=\left({I}_{m}\otimes A\otimes {I}_{n}\right)x$

function y = IAI(A,r,c,m,n,x) % y = (I(m) kron A kron I(n))x% r : number of rows of A % c : number of columns of Av = 0:n:n*(r-1); u = 0:n:n*(c-1);for i = 0:m-1 for j = 0:n-1y(v+i*r*n+j+1) = A * x(u+i*c*n+j+1); endend

It simply uses two loops to implement the $mn$ copies of $A$ . Each copy of $A$ is applied to a different subset of the elements of $x$ .

## Vector/parallel interpretation

The command $I\otimes A\otimes I$ where $\otimes$ is the Kronecker (or Tensor) product can be interpreted as avector/parallel command [link] , [link] . In these references, the implementation of thesecommands is discussed in detail and they have found that the Tensor product is“an extremely useful tool for matching algorithms to computer architectures [link] .”

The expression $I\otimes A$ can easily be seen to represent a parallel command:

$I\otimes A=\left[\begin{array}{cccc}A& & & \\ & A& & \\ & & \ddots & \\ & & & A\end{array}\right].$

Each block along the diagonal acts on non-overlapping sections of the data vector - so that each sectioncan be performed in parallel. Since each section represents exactly the same operation, this form isamenable to implementation on a computer with aparallel architectural configuration. The expression $A\otimes I$ can be similarly seen to represent a vector command, see [link] .

It should also be noted that by employing `stride' permutations, the command $\left(I\otimes A\otimes I\right)x$ can be replaced by either $\left(I\otimes A\right)x$ or $\left(A\otimes I\right)x$ [link] , [link] . It is only necessary to permute the input and output.It is also the case that these stride permutations are natural loading and storing commands for some architectures.

In the programs we have written in conjunction with this paper we implement the commands $y=\left(I\otimes A\otimes I\right)x$ with loops in a set of subroutines. The circular convolution and prime length FFT programswe present, however, explicitly use the form $I\otimes A\otimes I$ to make clear the structure of the algorithm, to make themmore modular and simpler, and to make them amenable to implementation on special architectures.In fact, in [link] it is suggested that it might be practical to develop tensor product compilers.The FFT programs we have generated will be well suited for such compilers.

find the 15th term of the geometric sequince whose first is 18 and last term of 387
I know this work
salma
The given of f(x=x-2. then what is the value of this f(3) 5f(x+1)
hmm well what is the answer
Abhi
how do they get the third part x = (32)5/4
can someone help me with some logarithmic and exponential equations.
20/(×-6^2)
Salomon
okay, so you have 6 raised to the power of 2. what is that part of your answer
I don't understand what the A with approx sign and the boxed x mean
it think it's written 20/(X-6)^2 so it's 20 divided by X-6 squared
Salomon
I'm not sure why it wrote it the other way
Salomon
I got X =-6
Salomon
ok. so take the square root of both sides, now you have plus or minus the square root of 20= x-6
oops. ignore that.
so you not have an equal sign anywhere in the original equation?
hmm
Abhi
is it a question of log
Abhi
🤔.
Abhi
I rally confuse this number And equations too I need exactly help
salma
But this is not salma it's Faiza live in lousvile Ky I garbage this so I am going collage with JCTC that the of the collage thank you my friends
salma
Commplementary angles
hello
Sherica
im all ears I need to learn
Sherica
right! what he said ⤴⤴⤴
Tamia
hii
Uday
hi
salma
what is a good calculator for all algebra; would a Casio fx 260 work with all algebra equations? please name the cheapest, thanks.
a perfect square v²+2v+_
kkk nice
algebra 2 Inequalities:If equation 2 = 0 it is an open set?
or infinite solutions?
Kim
The answer is neither. The function, 2 = 0 cannot exist. Hence, the function is undefined.
Al
y=10×
if |A| not equal to 0 and order of A is n prove that adj (adj A = |A|
rolling four fair dice and getting an even number an all four dice
Kristine 2*2*2=8
Differences Between Laspeyres and Paasche Indices
No. 7x -4y is simplified from 4x + (3y + 3x) -7y
how do you translate this in Algebraic Expressions
Need to simplify the expresin. 3/7 (x+y)-1/7 (x-1)=
. After 3 months on a diet, Lisa had lost 12% of her original weight. She lost 21 pounds. What was Lisa's original weight?
what's the easiest and fastest way to the synthesize AgNP?
China
Cied
types of nano material
I start with an easy one. carbon nanotubes woven into a long filament like a string
Porter
many many of nanotubes
Porter
what is the k.e before it land
Yasmin
what is the function of carbon nanotubes?
Cesar
I'm interested in nanotube
Uday
what is nanomaterials​ and their applications of sensors.
what is nano technology
what is system testing?
preparation of nanomaterial
Yes, Nanotechnology has a very fast field of applications and their is always something new to do with it...
what is system testing
what is the application of nanotechnology?
Stotaw
In this morden time nanotechnology used in many field . 1-Electronics-manufacturad IC ,RAM,MRAM,solar panel etc 2-Helth and Medical-Nanomedicine,Drug Dilivery for cancer treatment etc 3- Atomobile -MEMS, Coating on car etc. and may other field for details you can check at Google
Azam
anybody can imagine what will be happen after 100 years from now in nano tech world
Prasenjit
after 100 year this will be not nanotechnology maybe this technology name will be change . maybe aftet 100 year . we work on electron lable practically about its properties and behaviour by the different instruments
Azam
name doesn't matter , whatever it will be change... I'm taking about effect on circumstances of the microscopic world
Prasenjit
how hard could it be to apply nanotechnology against viral infections such HIV or Ebola?
Damian
silver nanoparticles could handle the job?
Damian
not now but maybe in future only AgNP maybe any other nanomaterials
Azam
Hello
Uday
I'm interested in Nanotube
Uday
this technology will not going on for the long time , so I'm thinking about femtotechnology 10^-15
Prasenjit
can nanotechnology change the direction of the face of the world
At high concentrations (>0.01 M), the relation between absorptivity coefficient and absorbance is no longer linear. This is due to the electrostatic interactions between the quantum dots in close proximity. If the concentration of the solution is high, another effect that is seen is the scattering of light from the large number of quantum dots. This assumption only works at low concentrations of the analyte. Presence of stray light.
the Beer law works very well for dilute solutions but fails for very high concentrations. why?
how did you get the value of 2000N.What calculations are needed to arrive at it
Privacy Information Security Software Version 1.1a
Good
Got questions? Join the online conversation and get instant answers!