Package org.ejml.dense.row.mult

Class MatrixMatrixMult_FDRM

java.lang.Object
org.ejml.dense.row.mult.MatrixMatrixMult_FDRM
@Generated("org.ejml.dense.row.mult.GenerateMatrixMatrixMult_FDRM") public class MatrixMatrixMult_FDRM extends Object

This class contains various types of matrix matrix multiplication operations for FMatrix1Row.

Two algorithms that are equivalent can often have very different runtime performance. This is because of how modern computers uses fast memory caches to speed up reading/writing to data. Depending on the order in which variables are processed different algorithms can run much faster than others, even if the number of operations is the same.

Algorithms that are labeled as 'reorder' are designed to avoid caching jumping issues, some times at the cost of increasing the number of operations. This is important for large matrices. The straight forward implementation seems to be faster for small matrices.

Algorithms that are labeled as 'aux' use an auxiliary array of length n. This array is used to create a copy of an out of sequence column vector that is referenced several times. This reduces the number of cache misses. If the 'aux' parameter passed in is null then the array is declared internally.

Typically the straight forward implementation runs about 30% faster on smaller matrices and about 5 times slower on larger matrices. This is all computer architecture and matrix shape/size specific.

DO NOT MODIFY. Automatically generated code created by GenerateMatrixMatrixMult_FDRM