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:
Hướng dẫn Java Design Pattern – Adapter
Runnable vs. Callable in Java
Creating Docker Images with Spring Boot
File Upload with Spring MVC
Java Program to Perform Right Rotation on a Binary Search Tree
Spring Security Registration – Resend Verification Email
Java Program to Generate All Possible Combinations of a Given List of Numbers
Jackson – Decide What Fields Get Serialized/Deserialized
Spring Boot - Application Properties
Primitive Type Streams in Java 8
Java Program to implement Bi Directional Map
Introduction to Spring Cloud CLI
Netflix Archaius with Various Database Configurations
Checked and Unchecked Exceptions in Java
Spring REST API + OAuth2 + Angular
Java Program to Implement Strassen Algorithm
Extra Login Fields with Spring Security
Java Program to Implement Sparse Matrix
Using Optional with Jackson
Template Engines for Spring
Java Program to Implement Fermat Primality Test Algorithm
Generic Constructors in Java
Java Program to Implement the Edmond’s Algorithm for Maximum Cardinality Matching
New Features in Java 14
The Java 8 Stream API Tutorial
Form Validation with AngularJS and Spring MVC
Spring @Primary Annotation
OAuth2 for a Spring REST API – Handle the Refresh Token in Angular
Guide to Java 8 groupingBy Collector
Java Program to Implement Stack using Two Queues
Guide to the Volatile Keyword in Java
Intersection of Two Lists in Java