Author: Hakan Ardo <[email protected]>
Branch: extradoc
Changeset: r4586:5a5e657ff7c5
Date: 2012-08-15 19:46 +0200
http://bitbucket.org/pypy/extradoc/changeset/5a5e657ff7c5/
Log: cleanup
diff --git a/talk/dls2012/licm.pdf b/talk/dls2012/licm.pdf
index
d44c6adbc9741258517f595c681611569b3e9240..4e41479628229f6b9c2635f91c7f58c4684ae264
GIT binary patch
[cut]
diff --git a/talk/dls2012/paper.tex b/talk/dls2012/paper.tex
--- a/talk/dls2012/paper.tex
+++ b/talk/dls2012/paper.tex
@@ -1072,7 +1072,7 @@
\item {\bf SparseMatMult}$\left(n, z, c\right)$: Matrix multiplication between
a $n\times n$ sparse matrix,
stored in compressed-row format, and a full storage vector, stored in a normal
array. The matrix has $z$ non-zero elements and the calculation is repeated $c$
times.
\item {\bf MonteCarlo}$\left(n\right)$: Monte Carlo integration by generating
$n$ points uniformly distributed over the unit square and computing the ratio
of those within the unit circle.
-\item {\bf LU}$\left(n, c\right)$: Computes the LU factorization of a $n
\times n$ matrix. The rows of the matrix is shuffled which makes the previously
used two-dimensional array class unsuitable. Instead a list of arrays is used
to represent the matrix. The calculation is repeated $c$ times.
+\item {\bf LU}$\left(n, c\right)$: LU factorization of an $n \times n$ matrix.
The rows of the matrix is shuffled which makes the previously used
two-dimensional array class unsuitable. Instead a list of arrays is used to
represent the matrix. The calculation is repeated $c$ times.
\item {\bf FFT}$\left(n, c\right)$: Fast Fourier Transform of a vector with
$n$ elements, represented as an array, repeated $c$ times.
\end{itemize}
_______________________________________________
pypy-commit mailing list
[email protected]
http://mail.python.org/mailman/listinfo/pypy-commit
