next up previous contents
Next: 4.1.3.2 Algorithms for Up: 4.1.3 Matrix-by-Matrix-operations (BLAS3) Previous: 4.1.3 Matrix-by-Matrix-operations (BLAS3)   Contents

4.1.3.1 Matrix-by-Matrix multiplication

$\displaystyle \boxed{
C_{N\times N} \;:=\; A_{N\times M} \ast B_{M\times N}
\;...
...a_{ik}\cdot b_{kj}
\;\; {\scriptstyle i,j = \overline{1,N} \makebox[0pt]{} }
}$


\begin{algorithmus}
% latex2html id marker 8468\caption{Basic algorithm for M...
...> END DO \\
\> END DO \\
END DO
\end{tabbing}\hfill\mbox{}
\end{algorithmus}

$ \Longrightarrow$ 6 different algorithms can be realized with respect to $ \Longrightarrow$ Concrete efficient implementation strongly depends on hardware and compiler chosen :
next up previous contents
Next: 4.1.3.2 Algorithms for Up: 4.1.3 Matrix-by-Matrix-operations (BLAS3) Previous: 4.1.3 Matrix-by-Matrix-operations (BLAS3)   Contents
Gundolf Haase 2000-03-20