This is a java program to LU Decomposition of a given matrix. LU decomposition is the process of reducing single matrix into 2 matrices such that, upon multiplication we get the original matrix, having property that one of them is lower trinagular matrix and other one is upper trinagular matrix.
Here is the source code of the Java Program to Perform LU Decomposition of any Matrix. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.
//This is a sample program to calulate the LU decomposition of the given matrix import java.util.Scanner; public class LUDecomposition { public static void main(String args[]) { System.out.println("Enter the dimension of the matrix:"); Scanner sc = new Scanner(System.in); int n = sc.nextInt(); double [][]mat = new double[n][n]; for(int i=0; i<n; i++) for(int j=0; j<n; j++) mat[i][j] = sc.nextDouble(); if(n==2) { double [][]l = new double[n][n]; l[0][0] = l[1][1] = 1; l[0][1] = 0; double [][]u = new double[n][n]; u[1][0] = 0; u[0][0] = mat[0][0]; u[0][1] = mat[0][1]; l[1][0] = mat[1][0]/mat[0][0]; u[1][1] = mat[1][1] - (l[1][0]*u[0][1]); //mat[2][2]-(mat[2][1]*mat[1][2]/mat[1][1]); System.out.println("The L Component is:"); for(int i=0; i<n; i++) { for(int j=0; j<n; j++) System.out.print(" "+l[i][j]); System.out.println(); } System.out.println("The U Component is:"); for(int i=0; i<n; i++) { for(int j=0; j<n; j++) System.out.print(" "+u[i][j]); System.out.println(); } } if(n==3) { double [][]l = new double[n][n]; l[0][0] = l[1][1] = l[2][2] = 1; l[0][1] = l[0][2] = l[1][2] = 0; double [][]u = new double[n][n]; u[1][0] = u[2][0] = u[2][1] = 0; u[0][0] = mat[0][0]; u[0][1] = mat[0][1]; u[0][2] = mat[0][2]; l[1][0] = mat[1][0]/mat[0][0]; u[1][1] = mat[1][1] - (l[1][0]*u[0][1]); //mat[2][2]-(mat[2][1]*mat[1][2]/mat[1][1]); u[1][2] = mat[1][2] - (l[1][0]*u[0][2]); l[2][0] = mat[2][0]/u[0][0]; l[2][1] = (mat[2][1] - l[2][1]*u[0][1])/u[1][1]; u[2][2] = mat[2][2] - (l[2][0]*u[0][2]) - (l[2][1]*u[1][2]); System.out.println("The L Component is:"); for(int i=0; i<n; i++) { for(int j=0; j<n; j++) System.out.print(" "+l[i][j]); System.out.println(); } System.out.println("The U Component is:"); for(int i=0; i<n; i++) { for(int j=0; j<n; j++) System.out.print(" "+u[i][j]); System.out.println(); } } sc.close(); } }
Output:
$ javac LUDecomposition.java $ java LUDecomposition.java Enter the dimension of the matrix: 3 2 3 1 4 5 1 1 1 1 The L Component is: 1.0 0.0 0.0 2.0 1.0 0.0 0.5 -1.0 1.0 The U Component is: 2.0 3.0 1.0 0.0 -1.0 -1.0 0.0 0.0 -0.5
Related posts:
@Before vs @BeforeClass vs @BeforeEach vs @BeforeAll
Java 8 and Infinite Streams
Java Streams vs Vavr Streams
Spring MVC Custom Validation
Test a REST API with Java
“Stream has already been operated upon or closed” Exception in Java
Java Program to Find the Peak Element of an Array O(n) time (Naive Method)
Guide to Guava Multimap
Giới thiệu Google Guice – Aspect Oriented Programming (AOP)
Java Program to Generate a Random Subset by Coin Flipping
Java Program to Implement the One Time Pad Algorithm
How to Change the Default Port in Spring Boot
Introduction to Using FreeMarker in Spring MVC
Java Program to Compute Discrete Fourier Transform Using the Fast Fourier Transform Approach
Guide to @ConfigurationProperties in Spring Boot
Spring Boot - Application Properties
Java Program to Find a Good Feedback Vertex Set
Java Program to Compute Determinant of a Matrix
Hashing a Password in Java
How to Add a Single Element to a Stream
Java Program to Implement Shell Sort
Mockito and JUnit 5 – Using ExtendWith
Spring Security Remember Me
Java equals() and hashCode() Contracts
Java Program to Implement Repeated Squaring Algorithm
Java Program to Perform Searching Based on Locality of Reference
Spring Data – CrudRepository save() Method
Java Program to Implement Naor-Reingold Pseudo Random Function
Database Migrations with Flyway
Java Program to Find a Good Feedback Edge Set in a Graph
Java Program to Implement Doubly Linked List
Handle EML file with JavaMail