Dear all,
I want to understand a certain algorithm and then try to implement it, but I come across some mathematical notations which make me sick!
I therefore need help to understand how the following matrix of indexed function f evolves.
where ; and is the canonical vector.
Can some one please explain:
1. How the elements of the matrix obtained? The most difficult thing for me is to understand how the indexing goes.
2. what are the actual elements of and how does the canonical vector look?
3. What kind of operation can I take on ?
Any idea is appreciated.
NB. I'm using TEX to wrap the matrix but still I see <br/>; any one who knows how to fix this is welcome to help!
You:
\left[\begin{array}{c}
f_{\alpha - k_{1} + e_{d},1}, \dots ,f_{\alpha + k_{1} + e_{d},1}\\
.\\
.\\
.\\
f_{\alpha - k_{l} + e_{d},L}, \dots ,f_{\alpha + k_{l} + e_{d},L}
\end{array}\right]
Plato:
\left[\begin{array}{c} f_{\alpha - k_{1} + e_{d},1}, \dots ,f_{\alpha + k_{1} + e_{d},1}\\.\\.\\.\\f_{\alpha - k_{l} + e_{d},L}, \dots ,f_{\alpha + k_{l} + e_{d},L}\end{array}\right]
Dear all,
I want to understand a certain algorithm and then try to implement it, but I come across some mathematical notations which make me sick!
I therefore need help to understand how the elements of the following matrix of indexed function evolve:
where ; and is the canonical vector.
Can some one please explain:
1. How the elements of the matrix obtained? The most difficult thing for me is to understand how the indexing goes.
2. What are the actual elements of and how does the canonical vector look?
3. What kind of operation can I take on ?
Any idea is welcome.