This is the java program to find the inverse of square invertible matrix. The matrix is invertible if its determinant is non zero.
Here is the source code of the Java Program to Find Inverse of a Matrix. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.
//This is sample program to find the inverse of a matrix import java.util.Scanner; public class Inverse { public static void main(String argv[]) { Scanner input = new Scanner(System.in); System.out.println("Enter the dimension of square matrix: "); int n = input.nextInt(); double a[][]= new double[n][n]; System.out.println("Enter the elements of matrix: "); for(int i=0; i<n; i++) for(int j=0; j<n; j++) a[i][j] = input.nextDouble(); double d[][] = invert(a); System.out.println("The inverse is: "); for (int i=0; i<n; ++i) { for (int j=0; j<n; ++j) { System.out.print(d[i][j]+" "); } System.out.println(); } input.close(); } public static double[][] invert(double a[][]) { int n = a.length; double x[][] = new double[n][n]; double b[][] = new double[n][n]; int index[] = new int[n]; for (int i=0; i<n; ++i) b[i][i] = 1; // Transform the matrix into an upper triangle gaussian(a, index); // Update the matrix b[i][j] with the ratios stored for (int i=0; i<n-1; ++i) for (int j=i+1; j<n; ++j) for (int k=0; k<n; ++k) b[index[j]][k] -= a[index[j]][i]*b[index[i]][k]; // Perform backward substitutions for (int i=0; i<n; ++i) { x[n-1][i] = b[index[n-1]][i]/a[index[n-1]][n-1]; for (int j=n-2; j>=0; --j) { x[j][i] = b[index[j]][i]; for (int k=j+1; k<n; ++k) { x[j][i] -= a[index[j]][k]*x[k][i]; } x[j][i] /= a[index[j]][j]; } } return x; } // Method to carry out the partial-pivoting Gaussian // elimination. Here index[] stores pivoting order. public static void gaussian(double a[][], int index[]) { int n = index.length; double c[] = new double[n]; // Initialize the index for (int i=0; i<n; ++i) index[i] = i; // Find the rescaling factors, one from each row for (int i=0; i<n; ++i) { double c1 = 0; for (int j=0; j<n; ++j) { double c0 = Math.abs(a[i][j]); if (c0 > c1) c1 = c0; } c[i] = c1; } // Search the pivoting element from each column int k = 0; for (int j=0; j<n-1; ++j) { double pi1 = 0; for (int i=j; i<n; ++i) { double pi0 = Math.abs(a[index[i]][j]); pi0 /= c[index[i]]; if (pi0 > pi1) { pi1 = pi0; k = i; } } // Interchange rows according to the pivoting order int itmp = index[j]; index[j] = index[k]; index[k] = itmp; for (int i=j+1; i<n; ++i) { double pj = a[index[i]][j]/a[index[j]][j]; // Record pivoting ratios below the diagonal a[index[i]][j] = pj; // Modify other elements accordingly for (int l=j+1; l<n; ++l) a[index[i]][l] -= pj*a[index[j]][l]; } } } }
Output:
$ javac Inverse.java $ java Inverse Enter the dimension of square matrix: 2 Enter the elements of matrix: 1 2 3 4 The Inverse is: -1.9999999999999998 1.0 1.4999999999999998 -0.49999999999999994
Related posts:
Tạo ứng dụng Java RESTful Client với thư viện OkHttp
Deploy a Spring Boot WAR into a Tomcat Server
ExecutorService – Waiting for Threads to Finish
Java Program to Implement Hash Tables with Double Hashing
Java Program to Implement Ternary Search Tree
Cơ chế Upcasting và Downcasting trong java
Java Program to find the maximum subarray sum O(n^2) time(naive method)
A Quick Guide to Spring Cloud Consul
Java Program to Implement Self organizing List
Returning Custom Status Codes from Spring Controllers
Java Program to Find Transitive Closure of a Graph
Using the Not Operator in If Conditions in Java
The StackOverflowError in Java
Câu lệnh điều khiển vòng lặp trong Java (break, continue)
Spring RequestMapping
Giới thiệu Google Guice – Binding
Guide to the Synchronized Keyword in Java
Introduction to Spring Cloud CLI
Java Program to Implement Hopcroft Algorithm
Java Program to Implement Interval Tree
Java Program to Implement LinkedBlockingDeque API
Hướng dẫn sử dụng Printing Service trong Java
Control Structures in Java
Hướng dẫn Java Design Pattern – Memento
The Thread.join() Method in Java
Introduction to PCollections
Notify User of Login From New Device or Location
A Guide to the Java ExecutorService
Hướng dẫn Java Design Pattern – Null Object
Java Program to Implement Interpolation Search Algorithm
Java Program to Check whether Directed Graph is Connected using BFS
Spring REST API with Protocol Buffers