1. Gambaran keseluruhan
Dalam tutorial ini, kita akan melihat bagaimana kita dapat mengalikan dua matriks di Java.
Oleh kerana konsep matriks tidak wujud secara asli dalam bahasa, kami akan menerapkannya sendiri, dan kami juga akan bekerjasama dengan beberapa perpustakaan untuk melihat bagaimana mereka mengendalikan pendaraban matriks.
Pada akhirnya, kami akan membuat penanda aras sedikit penyelesaian yang kami terokai untuk menentukan penyelesaian terpantas.
2. Contohnya
Mari kita mulakan dengan memberikan contoh yang dapat kita rujuk sepanjang tutorial ini.
Pertama, kita akan membayangkan matriks 3 × 2:
Sekarang mari kita bayangkan matriks kedua, dua baris dengan empat lajur kali ini:
Kemudian, pendaraban matriks pertama dengan matriks kedua, yang akan menghasilkan matriks 3 × 4:
Sebagai peringatan, hasil ini diperoleh dengan mengira setiap sel matriks yang dihasilkan dengan formula ini :
Di mana r adalah bilangan baris matriks A , c adalah bilangan lajur matriks B dan n adalah bilangan lajur matriks A , yang mesti sepadan dengan bilangan baris matriks B .
3. Pendaraban Matriks
3.1. Pelaksanaan Sendiri
Mari mulakan dengan pelaksanaan matriks kita sendiri.
Kami akan memastikan ia mudah dan hanya menggunakan dua dimensi dua tatasusunan :
double[][] firstMatrix = { new double[]{1d, 5d}, new double[]{2d, 3d}, new double[]{1d, 7d} }; double[][] secondMatrix = { new double[]{1d, 2d, 3d, 7d}, new double[]{5d, 2d, 8d, 1d} };Itulah dua matriks contoh kami. Mari buat yang diharapkan sebagai hasil pendaraban mereka:
double[][] expected = { new double[]{26d, 12d, 43d, 12d}, new double[]{17d, 10d, 30d, 17d}, new double[]{36d, 16d, 59d, 14d} };Sekarang semuanya sudah siap, mari kita laksanakan algoritma pendaraban. Kami mula-mula membuat susunan hasil kosong dan melakukan lelaran melalui selnya untuk menyimpan nilai yang diharapkan dalam setiap satu daripadanya:
double[][] multiplyMatrices(double[][] firstMatrix, double[][] secondMatrix) { double[][] result = new double[firstMatrix.length][secondMatrix[0].length]; for (int row = 0; row < result.length; row++) { for (int col = 0; col < result[row].length; col++) { result[row][col] = multiplyMatricesCell(firstMatrix, secondMatrix, row, col); } } return result; }Akhirnya, mari kita laksanakan pengiraan satu sel. Untuk mencapainya, kami akan menggunakan formula yang ditunjukkan sebelumnya dalam pembentangan contoh :
double multiplyMatricesCell(double[][] firstMatrix, double[][] secondMatrix, int row, int col) { double cell = 0; for (int i = 0; i < secondMatrix.length; i++) { cell += firstMatrix[row][i] * secondMatrix[i][col]; } return cell; }Akhirnya, mari kita periksa bahawa hasil algoritma sesuai dengan hasil yang diharapkan:
double[][] actual = multiplyMatrices(firstMatrix, secondMatrix); assertThat(actual).isEqualTo(expected);3.2. EJML
Perpustakaan pertama yang akan kita perhatikan adalah EJML, singkatan dari Effective Java Matrix Library. Semasa menulis tutorial ini, ia adalah salah satu perpustakaan matriks Java yang paling baru dikemas kini . Tujuannya adalah seefisien mungkin mengenai perhitungan dan penggunaan memori.
Kita mesti menambahkan kebergantungan ke perpustakaan di pom.xml kami :
org.ejml ejml-all 0.38 Kami akan menggunakan corak yang hampir sama seperti sebelumnya: membuat dua matriks mengikut contoh kami dan periksa bahawa hasil pendaraban mereka adalah yang kami kirakan sebelumnya.
Oleh itu, mari buat matriks kami menggunakan EJML. Untuk mencapai ini, kami akan menggunakan kelas SimpleMatrix yang ditawarkan oleh perpustakaan .
Ia boleh mengambil dua dimensi double lokasi sebagai input untuk pembina yang:
SimpleMatrix firstMatrix = new SimpleMatrix( new double[][] { new double[] {1d, 5d}, new double[] {2d, 3d}, new double[] {1d ,7d} } ); SimpleMatrix secondMatrix = new SimpleMatrix( new double[][] { new double[] {1d, 2d, 3d, 7d}, new double[] {5d, 2d, 8d, 1d} } );Dan sekarang, mari tentukan matriks yang diharapkan untuk pendaraban:
SimpleMatrix expected = new SimpleMatrix( new double[][] { new double[] {26d, 12d, 43d, 12d}, new double[] {17d, 10d, 30d, 17d}, new double[] {36d, 16d, 59d, 14d} } );Sekarang kita semua sudah siap, mari kita lihat bagaimana mengalikan dua matriks itu bersama-sama. The SimpleMatrix tawaran kelas mult () kaedah mengambil satu lagi SimpleMatrix sebagai parameter dan kembali pendaraban dua matriks:
SimpleMatrix actual = firstMatrix.mult(secondMatrix);Mari kita periksa sama ada keputusan yang diperoleh sesuai dengan yang diharapkan.
Oleh kerana SimpleMatrix tidak mengganti kaedah sama () , kita tidak boleh bergantung kepadanya untuk melakukan pengesahan. Tetapi, ia menawarkan alternatif: yang isIdentical () kaedah yang mengambil bukan sahaja satu lagi parameter matriks tetapi juga double satu kesalahan toleransi untuk mengabaikan perbezaan kecil kerana ketepatan dua:
assertThat(actual).matches(m -> m.isIdentical(expected, 0d));Itu menyimpulkan pendaraban matriks dengan perpustakaan EJML. Mari lihat apa yang ditawarkan oleh yang lain.
3.3. ND4J
Mari sekarang cuba Perpustakaan ND4J. ND4J adalah perpustakaan pengiraan dan merupakan sebahagian daripada projek deeplearning4j. Antara lain, ND4J menawarkan ciri pengiraan matriks.
Pertama sekali, kita mesti mendapatkan pergantungan perpustakaan:
org.nd4j nd4j-native 1.0.0-beta4 Perhatikan bahawa kami menggunakan versi beta di sini kerana nampaknya terdapat beberapa bug dengan pelepasan GA.
For the sake of brevity, we won't rewrite the two dimensions double arrays and just focus on how they are used with each library. Thus, with ND4J, we must create an INDArray. In order to do that, we'll call the Nd4j.create() factory method and pass it a double array representing our matrix:
INDArray matrix = Nd4j.create(/* a two dimensions double array */);As in the previous section, we'll create three matrices: the two we're going to multiply together and the one being the expected result.
After that, we want to actually do the multiplication between the first two matrices using the INDArray.mmul() method:
INDArray actual = firstMatrix.mmul(secondMatrix);Then, we check again that the actual result matches the expected one. This time we can rely on an equality check:
assertThat(actual).isEqualTo(expected);This demonstrates how the ND4J library can be used to do matrix calculations.
3.4. Apache Commons
Let's now talk about the Apache Commons Math3 module, which provides us with mathematic computations including matrices manipulations.
Again, we'll have to specify the dependency in our pom.xml:
org.apache.commons commons-math3 3.6.1 Once set up, we can use the RealMatrix interface and its Array2DRowRealMatrix implementation to create our usual matrices. The constructor of the implementation class takes a two-dimensional double array as its parameter:
RealMatrix matrix = new Array2DRowRealMatrix(/* a two dimensions double array */);As for matrices multiplication, the RealMatrix interface offers a multiply() method taking another RealMatrix parameter:
RealMatrix actual = firstMatrix.multiply(secondMatrix);We can finally verify that the result is equal to what we're expecting:
assertThat(actual).isEqualTo(expected);Let's see the next library!
3.5. LA4J
This one's named LA4J, which stands for Linear Algebra for Java.
Let's add the dependency for this one as well:
org.la4j la4j 0.6.0 Now, LA4J works pretty much like the other libraries. It offers a Matrix interface with a Basic2DMatrix implementation that takes a two-dimensional double array as input:
Matrix matrix = new Basic2DMatrix(/* a two dimensions double array */);As in the Apache Commons Math3 module, the multiplication method is multiply() and takes another Matrix as its parameter:
Matrix actual = firstMatrix.multiply(secondMatrix);Once again, we can check that the result matches our expectations:
assertThat(actual).isEqualTo(expected);Let's now have a look at our last library: Colt.
3.6. Colt
Colt is a library developed by CERN. It provides features enabling high performance scientific and technical computing.
As with the previous libraries, we must get the right dependency:
colt colt 1.2.0 In order to create matrices with Colt, we must make use of the DoubleFactory2D class. It comes with three factory instances: dense, sparse and rowCompressed. Each is optimized to create the matching kind of matrix.
For our purpose, we'll use the dense instance. This time, the method to call is make() and it takes a two-dimensional double array again, producing a DoubleMatrix2D object:
DoubleMatrix2D matrix = doubleFactory2D.make(/* a two dimensions double array */);Once our matrices are instantiated, we'll want to multiply them. This time, there's no method on the matrix object to do that. We've got to create an instance of the Algebra class which has a mult() method taking two matrices for parameters:
Algebra algebra = new Algebra(); DoubleMatrix2D actual = algebra.mult(firstMatrix, secondMatrix);Then, we can compare the actual result to the expected one:
assertThat(actual).isEqualTo(expected);4. Benchmarking
Now that we're done with exploring the different possibilities of matrix multiplication, let's check which are the most performant.
4.1. Small Matrices
Let's begin with small matrices. Here, a 3×2 and a 2×4 matrices.
In order to implement the performance test, we'll use the JMH benchmarking library. Let's configure a benchmarking class with the following options:
public static void main(String[] args) throws Exception { Options opt = new OptionsBuilder() .include(MatrixMultiplicationBenchmarking.class.getSimpleName()) .mode(Mode.AverageTime) .forks(2) .warmupIterations(5) .measurementIterations(10) .timeUnit(TimeUnit.MICROSECONDS) .build(); new Runner(opt).run(); }This way, JMH will make two full runs for each method annotated with @Benchmark, each with five warmup iterations (not taken into the average computation) and ten measurement ones. As for the measurements, it'll gather the average time of execution of the different libraries, in microseconds.
We then have to create a state object containing our arrays:
@State(Scope.Benchmark) public class MatrixProvider { private double[][] firstMatrix; private double[][] secondMatrix; public MatrixProvider() { firstMatrix = new double[][] { new double[] {1d, 5d}, new double[] {2d, 3d}, new double[] {1d ,7d} }; secondMatrix = new double[][] { new double[] {1d, 2d, 3d, 7d}, new double[] {5d, 2d, 8d, 1d} }; } }That way, we make sure arrays initialization is not part of the benchmarking. After that, we still have to create methods that do the matrices multiplication, using the MatrixProvider object as the data source. We won't repeat the code here as we saw each library earlier.
Finally, we'll run the benchmarking process using our main method. This gives us the following result:
Benchmark Mode Cnt Score Error Units MatrixMultiplicationBenchmarking.apacheCommonsMatrixMultiplication avgt 20 1,008 ± 0,032 us/op MatrixMultiplicationBenchmarking.coltMatrixMultiplication avgt 20 0,219 ± 0,014 us/op MatrixMultiplicationBenchmarking.ejmlMatrixMultiplication avgt 20 0,226 ± 0,013 us/op MatrixMultiplicationBenchmarking.homemadeMatrixMultiplication avgt 20 0,389 ± 0,045 us/op MatrixMultiplicationBenchmarking.la4jMatrixMultiplication avgt 20 0,427 ± 0,016 us/op MatrixMultiplicationBenchmarking.nd4jMatrixMultiplication avgt 20 12,670 ± 2,582 us/opAs we can see, EJML and Colt are performing really well with about a fifth of a microsecond per operation, where ND4j is less performant with a bit more than ten microseconds per operation. The other libraries have performances situated in between.
Also, it's worth noting that when increasing the number of warmup iterations from 5 to 10, performance is increasing for all the libraries.
4.2. Large Matrices
Now, what happens if we take larger matrices, like 3000×3000? To check what happens, let's first create another state class providing generated matrices of that size:
@State(Scope.Benchmark) public class BigMatrixProvider { private double[][] firstMatrix; private double[][] secondMatrix; public BigMatrixProvider() {} @Setup public void setup(BenchmarkParams parameters) { firstMatrix = createMatrix(); secondMatrix = createMatrix(); } private double[][] createMatrix() { Random random = new Random(); double[][] result = new double[3000][3000]; for (int row = 0; row < result.length; row++) { for (int col = 0; col < result[row].length; col++) { result[row][col] = random.nextDouble(); } } return result; } }As we can see, we'll create 3000×3000 two-dimensions double arrays filled with random real numbers.
Let's now create the benchmarking class:
public class BigMatrixMultiplicationBenchmarking { public static void main(String[] args) throws Exception { Map parameters = parseParameters(args); ChainedOptionsBuilder builder = new OptionsBuilder() .include(BigMatrixMultiplicationBenchmarking.class.getSimpleName()) .mode(Mode.AverageTime) .forks(2) .warmupIterations(10) .measurementIterations(10) .timeUnit(TimeUnit.SECONDS); new Runner(builder.build()).run(); } @Benchmark public Object homemadeMatrixMultiplication(BigMatrixProvider matrixProvider) { return HomemadeMatrix .multiplyMatrices(matrixProvider.getFirstMatrix(), matrixProvider.getSecondMatrix()); } @Benchmark public Object ejmlMatrixMultiplication(BigMatrixProvider matrixProvider) { SimpleMatrix firstMatrix = new SimpleMatrix(matrixProvider.getFirstMatrix()); SimpleMatrix secondMatrix = new SimpleMatrix(matrixProvider.getSecondMatrix()); return firstMatrix.mult(secondMatrix); } @Benchmark public Object apacheCommonsMatrixMultiplication(BigMatrixProvider matrixProvider) { RealMatrix firstMatrix = new Array2DRowRealMatrix(matrixProvider.getFirstMatrix()); RealMatrix secondMatrix = new Array2DRowRealMatrix(matrixProvider.getSecondMatrix()); return firstMatrix.multiply(secondMatrix); } @Benchmark public Object la4jMatrixMultiplication(BigMatrixProvider matrixProvider) { Matrix firstMatrix = new Basic2DMatrix(matrixProvider.getFirstMatrix()); Matrix secondMatrix = new Basic2DMatrix(matrixProvider.getSecondMatrix()); return firstMatrix.multiply(secondMatrix); } @Benchmark public Object nd4jMatrixMultiplication(BigMatrixProvider matrixProvider) { INDArray firstMatrix = Nd4j.create(matrixProvider.getFirstMatrix()); INDArray secondMatrix = Nd4j.create(matrixProvider.getSecondMatrix()); return firstMatrix.mmul(secondMatrix); } @Benchmark public Object coltMatrixMultiplication(BigMatrixProvider matrixProvider) { DoubleFactory2D doubleFactory2D = DoubleFactory2D.dense; DoubleMatrix2D firstMatrix = doubleFactory2D.make(matrixProvider.getFirstMatrix()); DoubleMatrix2D secondMatrix = doubleFactory2D.make(matrixProvider.getSecondMatrix()); Algebra algebra = new Algebra(); return algebra.mult(firstMatrix, secondMatrix); } }When we run this benchmarking, we obtain completely different results:
Benchmark Mode Cnt Score Error Units BigMatrixMultiplicationBenchmarking.apacheCommonsMatrixMultiplication avgt 20 511.140 ± 13.535 s/op BigMatrixMultiplicationBenchmarking.coltMatrixMultiplication avgt 20 197.914 ± 2.453 s/op BigMatrixMultiplicationBenchmarking.ejmlMatrixMultiplication avgt 20 25.830 ± 0.059 s/op BigMatrixMultiplicationBenchmarking.homemadeMatrixMultiplication avgt 20 497.493 ± 2.121 s/op BigMatrixMultiplicationBenchmarking.la4jMatrixMultiplication avgt 20 35.523 ± 0.102 s/op BigMatrixMultiplicationBenchmarking.nd4jMatrixMultiplication avgt 20 0.548 ± 0.006 s/opAs we can see, the homemade implementations and the Apache library are now way worse than before, taking nearly 10 minutes to perform the multiplication of the two matrices.
Colt is taking a bit more than 3 minutes, which is better but still very long. EJML and LA4J are performing pretty well as they run in nearly 30 seconds. But, it's ND4J which wins this benchmarking performing in under a second on a CPU backend.
4.3. Analysis
That shows us that the benchmarking results really depend on the matrices' characteristics and therefore it's tricky to point out a single winner.
5. Conclusion
In this article, we've learned how to multiply matrices in Java, either by ourselves or with external libraries. After exploring all solutions, we did a benchmark of all of them and saw that, except for ND4J, they all performed pretty well on small matrices. On the other hand, on larger matrices, ND4J is taking the lead.
As usual, the full code for this article can be found over on GitHub.