I wrote my own (simple) version of mul!, for comparison: function mymul!(y, A, x) y .= 0.0 @inbounds for j = 1:length(x) @simd for i = 1:length(y) y[i] += A[i,j] * x[j] end end end However comparing this to LinearAlgebra.mul! shows that the later is much fas…

Why mul! is so fast?

e3c6 November 26, 2019, 6:02pm 10

Wow, that’s amazing!

It would be a good idea to add this code to LinearAlgebra.dot!

Topic		Replies	Views
@inbounds: is the compiler now so smart that this is no longer necessary? Performance	33	2934	July 16, 2018
Julia matrix-multiplication performance Performance linearalgebra	20	8713	October 30, 2022
Why is this simple function twice as slow as its Python version Performance question	97	4491	April 12, 2021
We can write an optimized BLAS library in pure Julia (please skip OP and jump to post 4) Numerics	17	13588	October 30, 2019
Benchmark MATLAB & Julia for Matrix Operations Performance	148	19849	October 15, 2019