日撸Java三百行 day08(矩阵相乘)

MATH_Drill

已于 2023-04-20 22:24:44 修改

阅读量134

点赞数

分类专栏：日撸JAVA 文章标签：矩阵算法线性代数

于 2023-04-20 22:22:18 首次发布

本文链接：https://blog.csdn.net/icecokenuo/article/details/130276901

版权

日撸JAVA 专栏收录该内容

27 篇文章 0 订阅

订阅专栏

1.矩阵相乘

矩阵相乘需满足前一个矩阵的列数等于后一个矩阵的行数，所以在做矩阵运算前需判断该条件。

计算方法:

$c[m][p] = a[m][n] * b[n][p]$

$c[i][j] = \sum_{k=0}^{n-1} a[i][k]+a[k][j] (0<=i<m, 0<=j<p)$

这里使用了i,j,k三个递增变量,则需用到三次循环

2.矩阵相乘的简单测试

package basic;

import java.util.Arrays;

/**
 * The usage of the sth.
 * 
 * @author Yunhua Hu yunhuahu0528@163.com.
 */
public class MatrixMultiplication {

	/**
	 *********************
	 * The entrance of the program.
	 *
	 * @param args Not used now.
	 *********************
	 */
	public static void main(String args[]) {
		matrixMultiplicationTest();
	} // Of main

	/**
	 *********************
	 * Matrix multiplication. The columns of the first matrix should be equal to the
	 * rows of the second one.
	 * 
	 * @param paraFirstMatrix The first matrix.
	 * @param paraSecondMatrix The second matrix.
	 * @return The result matrix.
	 *********************
	 */
	public static int[][] multiplication(int[][] paraFirstMatrix, int[][] paraSecondMatrix) {
		int m = paraFirstMatrix.length;
		int n = paraFirstMatrix[0].length;
		int p = paraSecondMatrix[0].length;

		// Step 1. Dimension check.
		if (paraSecondMatrix.length != n) {
			System.out.println("The two matrices cannot be multiplied.");
			return null;
		} // Of if

		// Step 2. The loop.
		int[][] resultMatrix = new int[m][p];
		for (int i = 0; i < m; i++) {
			for (int j = 0; j < p; j++) {
				for (int k = 0; k < n; k++) {
					resultMatrix[i][j] += paraFirstMatrix[i][k] * paraSecondMatrix[k][j];
				} // Of for k
			} // Of for j
		} // Of for i

		return resultMatrix;
	}// Of multiplication

	/**
	 *********************
	 * Unit test for respective method.
	 *********************
	 */
	public static void matrixMultiplicationTest() {
		int[][] tempFirstMatrix = new int[2][3];
		for (int i = 0; i < tempFirstMatrix.length; i++) {
			for (int j = 0; j < tempFirstMatrix[0].length; j++) {
				tempFirstMatrix[i][j] = i + j;
			} // Of for j
		} // Of for i
		System.out.println("The first matrix is: \r\n" + Arrays.deepToString(tempFirstMatrix));

		int[][] tempSecondMatrix = new int[3][2];
		for (int i = 0; i < tempSecondMatrix.length; i++) {
			for (int j = 0; j < tempSecondMatrix[0].length; j++) {
				tempSecondMatrix[i][j] = i * 10 + j;
			} // Of for j
		} // Of for i
		System.out.println("The second matrix is: \r\n" + Arrays.deepToString(tempSecondMatrix));

		int[][] tempThirdMatrix = multiplication(tempFirstMatrix, tempSecondMatrix);
		System.out.println("The third matrix is: \r\n" + Arrays.deepToString(tempThirdMatrix));

		System.out.println("Trying to multiply the first matrix with itself.\r\n");
		tempThirdMatrix = multiplication(tempFirstMatrix, tempFirstMatrix);
		System.out.println("The result matrix is: \r\n" + Arrays.deepToString(tempThirdMatrix));
	} // Of matrixMultiplicationTest

}// Of class MatrixMultiplication

输出: