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:
Java Program to Implement Randomized Binary Search Tree
Java Program to Implement Karatsuba Multiplication Algorithm
Lấy ngày giờ hiện tại trong Java
Java – Try with Resources
Java Program to Find the GCD and LCM of two Numbers
Spring Boot - Database Handling
Java Program to Emulate N Dice Roller
Java Program to Implement Variable length array
Java Program to Search Number Using Divide and Conquer with the Aid of Fibonacci Numbers
An Intro to Spring Cloud Security
Java Program to Use Boruvka’s Algorithm to Find the Minimum Spanning Tree
Apache Commons Collections SetUtils
Java Program to Perform Finite State Automaton based Search
REST Web service: Tạo ứng dụng Java RESTful Client với Jersey Client 2.x
Java – Write a Reader to File
A Custom Media Type for a Spring REST API
How to Kill a Java Thread
Spring Boot Configuration with Jasypt
Query Entities by Dates and Times with Spring Data JPA
Receive email by java client
Generate Spring Boot REST Client with Swagger
Java Program to Perform the Shaker Sort
The Guide to RestTemplate
Java Program to Implement Disjoint Sets
JUnit 5 @Test Annotation
Java Program to Find the Edge Connectivity of a Graph
Logging a Reactive Sequence
Spring Boot Integration Testing with Embedded MongoDB
Guide to Java 8 groupingBy Collector
Java Program to add two large numbers using Linked List
Java Concurrency Interview Questions and Answers
Java Program to Implement Sieve Of Atkin