(no commit message)

diff --git a/3d_gpu/architecture/dynamic_simd/mul.mdwn b/3d_gpu/architecture/dynamic_simd/mul.mdwn
index b350aac648967c8deb13da77ae12cadbc8dc9a0f..7a678086a9269c03f708d59e6e61700ba9fc1035 100644 (file)
--- a/3d_gpu/architecture/dynamic_simd/mul.mdwn
+++ b/3d_gpu/architecture/dynamic_simd/mul.mdwn
@@ -6,6 +6,6 @@ This is complicated!  It is necessary to compute a full NxN matrix of partial mu
 
 Therefore, for a full 64 bit multiply, with 7 partitions, a matrix of 8x8 multiplications are performed, then added up in each column of the same magnitude, in exactly the same way as described by Vedic Mathematics,
 
-<img src="https://img.fireden.net/sci/image/1483/07/1483079339205.png" />
+<img src="https://img.fireden.net/sci/image/1483/07/1483079339205.png" width="600px" />
 
 The [Wallace Tree](https://en.wikipedia.org/wiki/Wallace_tree) algorithm is presently deployed, here: we need to use the (more efficient) [Dadda algorithm](https://en.wikipedia.org/wiki/Dadda_multiplier)