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:
@Lookup Annotation in Spring
Java Program to Perform Deletion in a BST
Java Program to Solve a Matching Problem for a Given Specific Case
Java Program to Implement Stein GCD Algorithm
Lập trình hướng đối tượng (OOPs) trong java
Circular Dependencies in Spring
Java Program to Check Whether a Given Point is in a Given Polygon
Java Program to Implement Hash Tables with Quadratic Probing
Generic Constructors in Java
Debug a HttpURLConnection problem
Java Program to Implement HashTable API
Java Program to Compute DFT Coefficients Directly
Java Program to Find the Shortest Path Between Two Vertices Using Dijkstra’s Algorithm
Convert Hex to ASCII in Java
Java – Random Long, Float, Integer and Double
Java – Write a Reader to File
Guide to the Synchronized Keyword in Java
The Order of Tests in JUnit
Binary Numbers in Java
Quick Guide on Loading Initial Data with Spring Boot
The Spring @Controller and @RestController Annotations
Java Program to Describe the Representation of Graph using Adjacency Matrix
Difference Between Wait and Sleep in Java
Spring Security Logout
Java Program to Implement the MD5 Algorithm
Java Program to Implement the Program Used in grep/egrep/fgrep
Java Program to Implement Shunting Yard Algorithm
Introduction to the Java NIO Selector
A Guide to Java HashMap
Java Program to Implement Hash Trie
Java Program to Print the Kind of Rotation the AVL Tree is Undergoing
Converting String to Stream of chars