This is the java program to check whether the matrix is invertible or not. The square matrix is invertible if and only if its determinant is non zero.
Here is the source code of the Java Program to Check if a Matrix is Invertible. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.
//This is a simple program to check whether the matrix is invertible or not.
//The complexity of the algorithm is O(n^3)
import java.util.*;
public class Invertible_Matrix
{
public double determinant(double A[][],int N)
{
double det=0;
if(N == 1)
{
det = A[0][0];
}
else if (N == 2)
{
det = A[0][0]*A[1][1] - A[1][0]*A[0][1];
}
else
{
det=0;
for(int j1=0;j1<N;j1++)
{
double[][] m = new double[N-1][];
for(int k=0;k<(N-1);k++)
{
m[k] = new double[N-1];
}
for(int i=1;i<N;i++)
{
int j2=0;
for(int j=0;j<N;j++)
{
if(j == j1)
continue;
m[i-1][j2] = A[i][j];
j2++;
}
}
det += Math.pow(-1.0,1.0+j1+1.0)* A[0][j1] * determinant(m,N-1);
}
}
return det;
}
public static void main(String args[])
{
Scanner input = new Scanner(System.in);
System.out.println("Enter the order of the square matrix");
int n = input.nextInt();
System.out.println("Enter the elements of the square matrix");
double[][] mat = new double[n][n];
for(int i=0; i<n; i++)
{
for(int j=0; j<n; j++)
{
mat[i][j] = input.nextDouble();
}
}
Invertible_Matrix I = new Invertible_Matrix();
if(I.determinant(mat, n) == 0)
{
System.out.println("Matrix is not Invertible, as the determinant is : "+I.determinant(mat, n));
}
else
{
System.out.println("Matrix is Invertible, as the determinant is : "+I.determinant(mat, n));
}
input.close();
}
}
Output:
$ javac Invertible_Matrix.java $ java Invertible_matrix Enter the order of the square matrix: 3 Enter the elements of the square matrix: 1 2 3 4 5 6 7 8 9 Matrix is not Invertible, as the determinant is : 0.0
Related posts:
Guide to the Java TransferQueue
Java Program to Find Whether a Path Exists Between 2 Given Nodes
Cơ chế Upcasting và Downcasting trong java
The Thread.join() Method in Java
Reactive Flow with MongoDB, Kotlin, and Spring WebFlux
Java Program to Perform Preorder Non-Recursive Traversal of a Given Binary Tree
Lớp HashMap trong Java
Guava – Join and Split Collections
A Guide to WatchService in Java NIO2
Java – Write an InputStream to a File
Lập trình mạng với java
Java Program to Implement Euler Circuit Problem
Java Program to Implement Sparse Array
Spring MVC Setup with Kotlin
Java Program to Perform Right Rotation on a Binary Search Tree
Spring Boot Configuration with Jasypt
Java Program to Implement Queue using Linked List
Batch Processing with Spring Cloud Data Flow
Java Program to Find Inverse of a Matrix
Java Program to Implement CopyOnWriteArraySet API
Java Program to Check the Connectivity of Graph Using DFS
Map Interface trong java
Java Program to Implement the Hill Cypher
Hướng dẫn sử dụng Java Reflection
Java Program to Implement Randomized Binary Search Tree
Introduction to Spring Security Expressions
Functional Interfaces in Java 8
Java – Combine Multiple Collections
Java Program to Check whether Directed Graph is Connected using DFS
Java Program to Permute All Letters of an Input String
Java Program to Implement Doubly Linked List
File Upload with Spring MVC