Class TransposeAlgs_MT_FDRM

java.lang.Object
org.ejml.dense.row.misc.TransposeAlgs_MT_FDRM

@Generated("org.ejml.dense.row.misc.TransposeAlgs_FDRM") public class TransposeAlgs_MT_FDRM extends Object
Low level transpose algorithms. No sanity checks are performed. Take a look at BenchmarkTranspose to see which one is faster on your computer.
  • Constructor Details

    • TransposeAlgs_MT_FDRM

      public TransposeAlgs_MT_FDRM()
  • Method Details

    • square

      public static void square(FMatrix1Row A)
      In-place transpose for a square matrix. On most architectures it is faster than the standard transpose algorithm, but on most modern computers it's slower than block transpose.
      Parameters:
      A - The matrix that is transposed in-place. Modified.
    • block

      public static void block(FMatrix1Row A, FMatrix1Row A_tran, int blockLength)
      Performs a transpose across block sub-matrices. Reduces the number of cache misses on larger matrices. *NOTE* If this is beneficial is highly dependent on the computer it is run on. e.g: - Q6600 Almost twice as fast as standard. - Pentium-M Same speed and some times a bit slower than standard.
      Parameters:
      A - Original matrix. Not modified.
      A_tran - Transposed matrix. Modified.
      blockLength - Length of a block.
    • standard

      public static void standard(FMatrix1Row A, FMatrix1Row A_tran)
      A straight forward transpose. Good for small non-square matrices.
      Parameters:
      A - Original matrix. Not modified.
      A_tran - Transposed matrix. Modified.