This is a java program to perform a simple matrix multiplication. For matrix multiplication to happen the column of the first matrix should be equal to the row of the second matrix.
Here is the source code of the Java Program to Perform Matrix Multiplication. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.
// This is sample program for matrix multiplication
// The complexity of the algorithm is O(n^3)
package com.sanfoundry.numerical;
import java.util.Scanner;
public class MatixMultiplication
{
public static void main(String args[])
{
int n;
Scanner input = new Scanner(System.in);
System.out.println("Enter the base of squared matrices");
n = input.nextInt();
int[][] a = new int[n][n];
int[][] b = new int[n][n];
int[][] c = new int[n][n];
System.out.println("Enter the elements of 1st martix row wise \n");
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
a[i][j] = input.nextInt();
}
}
System.out.println("Enter the elements of 2nd martix row wise \n");
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
b[i][j] = input.nextInt();
}
}
System.out.println("Multiplying the matrices...");
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
for (int k = 0; k < n; k++)
{
c[i][j] = c[i][j] + a[i][k] * b[k][j];
}
}
}
System.out.println("The product is:");
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
System.out.print(c[i][j] + " ");
}
System.out.println();
}
input.close();
}
}
Output:
$ javac MatixMultiplication.java $ java MatixMultiplication Enter the base of squared matrices: 3 Enter the elements of 1st martix row wise: 1 2 3 4 5 6 7 8 9 Enter the elements of 2nd martix row wise: 2 3 4 5 6 7 8 9 1 Multiplying the matrices... The product is: 36 42 21 81 96 57 126 150 93
Related posts:
Guide to the Volatile Keyword in Java
Notify User of Login From New Device or Location
Java Program to Implement Cartesian Tree
Java Program to Implement Efficient O(log n) Fibonacci generator
Validate email address exists or not by Java Code
Java Program to Perform Postorder Recursive Traversal of a Given Binary Tree
Java Program to Check the Connectivity of Graph Using DFS
Java Program to Implement AA Tree
Java Program to Implement Binary Search Tree
Java Program to Implement AVL Tree
Migrating from JUnit 4 to JUnit 5
Finding the Differences Between Two Lists in Java
Java Program to Find Basis and Dimension of a Matrix
Java Program to Implement Merge Sort on n Numbers Without tail-recursion
Java Program to Implement Sieve Of Sundaram
Java Program to Implement a Binary Search Algorithm for a Specific Search Sequence
Mảng (Array) trong Java
Format ZonedDateTime to String
Introduction to Spring Cloud CLI
Removing all Nulls from a List in Java
Hướng dẫn Java Design Pattern – Proxy
A Guide To UDP In Java
Prevent Brute Force Authentication Attempts with Spring Security
Java 8 – Powerful Comparison with Lambdas
How to Get All Spring-Managed Beans?
Java Program to Implement Binary Heap
Convert String to int or Integer in Java
Tạo ứng dụng Java RESTful Client với thư viện OkHttp
Annotation trong Java 8
Java Program to Implement Solovay Strassen Primality Test Algorithm
Java Program to Implement Park-Miller Random Number Generation Algorithm
Spring Data Java 8 Support