矩阵是由m×n个数组成的一个m行n列的矩形表格.特别地,一个m×1矩阵也称为一个m维列向量;而一个1×n矩阵 ,也称为一个n维行向量. public class TestMatrix { //rowA*colA 代表m行n列的矩阵 final static int rowA = 2; final static int colA = 3; final static int rowB = 3; final static int colB = 1; public static void main(String[] args) { int mA[][] = new int[rowA][colA]; int mB[][] = new int[rowB][colB]; int mC[][] = new int[rowA][colB]; /************初始化A的元素**************/ System.out.println("矩阵a:"); for (int i = 0; i < mA.length; i++) { for (int j = 0; j < mA[i].length; j++) { mA[i][j] = (int) ((Math.random() * 1000) % 15 ); System.out.printf("%d ", mA[i][j]); } System.out.println(); } /************初始化B的元素**************/ System.out.println("\n矩阵b:"); for (int i = 0; i < mB.length; i++) { for (int j = 0; j < mB[i].length; j++) { mB[i][j] = (int) ((Math.random() * 1000) % 15 ); System.out.printf("%d ", mB[i][j]); } System.out.println(); } /************矩阵C**************/ System.out.println("\n矩阵c:"); for (int i = 0; i < rowA; i++) { for (int j = 0; j < colB; j++) { for (int ac = 0; ac < colA; ac++) { mC[i][j] += mA[i][ac] * mB[ac][j]; } System.out.printf("%d ", mC[i][j]); } System.out.println(); } } }
矩阵乘法(java版简单实例)
發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.