Algorithm Of Solving Row Reduced Echelon Form Of Matrix

Algorithm Of Solving Row Reduced Echelon Form Of Matrix

• As this guy say, no one have time for solving Row Reduce Echelon Form for Matrix.
• Here I have Algorithm for solving RREF for your Matrix

import java.util.Scanner; public class Matrix { private int Row; //NO OF ROWS private int Column; //NO OF COLUMNS private float [][]Elements;//FOR CARRING ELEMENTS public Matrix(int No_Row,int No_Column)//PARAMETERIZED CONSTRUCTOR { if(No_Row>0 && No_Column>0) { Row=No_Row; Column=No_Column; Elements = new float[No_Row][No_Column]; } else { write=false; System.out.println("\nYOU CAN NOT MAKE MATRIX WITH THIS DIMENTIONS.\n"); } } public void SET_ELEMENTS_OF_MATRIX() { Scanner x=new Scanner(System.in); for(int i=0;i<Row;i++) { for(int j=0;j<Column;j++) { System.out.println("ENTER ["+i+"]["+j+"] ELEMENT OF MATRIX :- "); Elements[i][j]=x.nextFloat(); } } } private void Algorithms_of_EF() { int R=0; for(int i=0;i<Column;i++) { if(R<Row) { if(Elements[R][i]!=0) { for(int k=R+1;k<Row;k++) { float []Array=new float[Column]; for(int l=0;l<Column;l++) { Array[l]=Elements[k][l] - ((Elements[R][l]*Elements[k][i])/Elements[R][i]); } for(int l=0;l<Column;l++) { Elements[k][l]=Array[l]; } } R++; } else { int Temp=-1; for(int j=(Row-1);j>R;j--) { if(Elements[j][i]!=0) { Temp=j; break; } } if(Temp!=-1) { count++; for(int f=0;f<Column;f++) { float Temp1= Elements[Temp][f]; Elements[Temp][f]=Elements[R][f]; Elements[R][f]=Temp1; } for(int k=R+1;k<Row;k++) { float []Array=new float[Column]; for(int l=0;l<Column;l++) { Array[l]=Elements[k][l] - ((Elements[R][l]*Elements[k][i])/Elements[R][i]); } for(int l=0;l<Column;l++) { Elements[k][l]=Array[l]; } } R++; } } } } } private void Entry() { int Temp=-1;int R=0; for(int i=0;i<Column;i++) { if(R<Row) { if(Elements[R][i]!=0) { float []Array=new float[Column]; for(int d=0;d<Column;d++) { Array[d]=Elements[R][d]/Elements[R][i]; } for(int d=0;d<Column;d++) { Elements[R][d]=Array[d]; } R++; } } } } public void GET_RREF_FORM() { Algorithms_of_EF(); Entry(); int Temp=-1;int R=0; for(int i=0;i<Column;i++) { if(R<Row) { if(Elements[R][i]!=0) { for(int k=R-1;k>=0;k--) { float []Array=new float[Column]; for(int l=0;l<Column;l++) { Array[l]=Elements[k][l] - ((Elements[R][l]*Elements[k][i])/Elements[R][i]); } for(int l=0;l<Column;l++) { Elements[k][l]=Array[l]; } } R++; } } } Display(); } public void Display() { System.out.println("\n\n"); for(int i=0;i<Row;i++) { for(int j=0;j<Column;j++) { if(Elements[i][j]==(-0.0)){Elements[i][j]=0;} System.out.print(Elements[i][j]+" "); } System.out.println(); } } }


Main Class


public class Main { public static void main(String[] args) { Matrix M=new Matrix(3,3); M.SET_ELEMENTS_OF_MATRIX(); M.GET_RREF_FORM(); } }