General matrix multiplication for f32, f64 matrices.

Allows arbitrary row, column strided matrices.

Uses the same microkernel algorithm as BLIS, but in a much simpler and less featureful implementation. See their multithreading page for a very good diagram over how the algorithm partitions the matrix (Note: this crate does not implement multithreading).

.. _BLIS: https://github.com/flame/blis

.. _multithreading: https://github.com/flame/blis/wiki/Multithreading

Please read the API documentation here__

__ http://bluss.github.io/matrixmultiply/

|buildstatus| |crates|_

.. |buildstatus| image:: https://travis-ci.org/bluss/matrixmultiply.svg?branch=master .. _buildstatus: https://travis-ci.org/bluss/matrixmultiply

.. |crates| image:: http://meritbadge.herokuapp.com/matrixmultiply .. _crates: https://crates.io/crates/matrixmultiply

NOTE: Compile this crate using RUSTFLAGS="-C target-cpu=native" so that the compiler can produce the best output.

Recent Changes

• 0.1.3

  • Silence some debug prints

• 0.1.2

  • Major performance improvement for sgemm and dgemm (20-30% when using AVX). Since it all depends on what the optimizer does, I'd love to get issue reports that report good or bad performance.
  • Made the kernel masking generic, which is a cleaner design

• 0.1.1

  • Minor improvement in the kernel