INNOVATION: Algorithm Of Solving Echelon Form Of Matrix

Algorithm Of Solving Echelon Form Of Matrix

Here I have one nice algorithm for solving matrix Echelon form which is very helpful finding determinant of matrix, for RREF, for LU factorization etc.

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();
            }
        }
    }
    
    public 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++;
                    }
                }
            }
        }

}

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();
        }
    }
}

INNOVATION

Saturday, 8 August 2015

Algorithm Of Solving Echelon Form Of Matrix

Algorithm Of Solving Echelon Form Of Matrix

Main Class

No comments:

Post a Comment