Merge pull request #34 from timholy/teh/perf

Improve perf of adjoint multiplication

Author: JordiManyer

src/SparseMatrixCSR.jl

@@ -351,6 +351,23 @@ end
 
 *(A::SparseMatrixCSR, v::Vector) = (y = similar(v,size(A,1));mul!(y,A,v))
 
+function mul!(y::AbstractVector,A::Adjoint{T, <:SparseMatrixCSR},v::AbstractVector) where T
+  P = A.parent
+  P.n == size(y, 1) || throw(DimensionMismatch())
+  P.m == size(v, 1) || throw(DimensionMismatch())
+  fill!(y,zero(eltype(y)))
+  o = getoffset(P)
+  for row = 1:size(P, 1)
+    for nz in nzrange(P,row)
+      col = P.colval[nz]+o
+      y[col] += P.nzval[nz]*v[row]
+    end
+  end
+  return y
+end
+
+*(A::Adjoint{T, <:SparseMatrixCSR}, v::AbstractVector) where T = (y = similar(v, promote_type(eltype(v),T), size(A,1)); mul!(y, A, v))
+
 function show(io::IO, ::MIME"text/plain", S::SparseMatrixCSR)
   xnnz = nnz(S)
   print(io, S.m, "×", S.n, " ", typeof(S), " with ", xnnz, " stored ",

test/SparseMatrixCSR.jl

@@ -106,6 +106,7 @@ function test_csr(Bi,Tv,Ti)
   mul!(z,CSC,x)
   @test y ≈ z
   @test CSR*x ≈ CSC*x
+  @test CSR'*y ≈ CSC'*z
 
   mul!(y,CSR,x,1,2)
   mul!(z,CSC,x,1,2)