From 6a8bad50d1c67b116203cd8e10c0becf46e8952b Mon Sep 17 00:00:00 2001 From: Shayan Davoodi <52105833+shayandavoodii@users.noreply.github.com> Date: Fri, 24 Nov 2023 00:04:01 +0330 Subject: [PATCH] Replace 'SparseArrays' by 'StaticArrays' --- Readme.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/Readme.md b/Readme.md index 906103c..e4d16ff 100644 --- a/Readme.md +++ b/Readme.md @@ -44,8 +44,8 @@ To compute any given column in $C_{(:,j)}$ of $C$ we are essentially computing a ## Benchmarking For matrices $(N\times K)$ and $(K\times M)$ we fix $N=1'000$ and $K=2'000$ and vary N. -Here's are the benchmark results, comparing against SparseArrays.jl, which ships with Julia but is single-threaded: +Here's are the benchmark results, comparing against StaticArrays.jl, which ships with Julia but is single-threaded: ![scaling benchmark](/benchmark/scaling.png) -For all N we see a speed up over `_spmul!` from the SparseArrays package of up to ~3x for N in [300, 30_000], and ~2x otherwise. +For all N we see a speed up over `_spmul!` from the StaticArrays package of up to ~3x for N in [300, 30_000], and ~2x otherwise.