Você está na página 1de 4

MATRIZ TRIANGULAR

PROBLEMA 1
package javaapplication67;

public class Triangula {

double [][]triangularSup(double [][]A, int n){


double det=1;
for(int i=0; i<=n-1; i++){
det= det*A[i][i];
if(det==0){
System.out.println("No hay Solucion");
}
else{
for(int k=i+1; k<=n-1; k++){
for(int j=i+1; j<=n; j++){
A[k][j]= A[k][j]-A[k][i]*A[i][j]/A[i][i];
}
A[k][i]=0;
}
}
}
return A;
}

void visualizar(double [][]A,int n){


for(int i=0; i<n; i++){
for( int j=0; j<n+1; j++){
System.out.printf("%.2f\t",A[i][j]);
}
System.out.println();
}
}
double []solutriangularSup(double [][]A, double
[]x,int n){

x[n-1]= A[n-1][n]/A[n-1][n-1];
for(int i=n-2; i>=0; i--){
x[i]=A[i][n];
for(int j=i+1; j<=n-2; j++){
x[i]= x[i]-A[i][j]*x[j];
}
x[i]= x[i]/A[i][i];
}

return x;
}
void imprimir(double []x,int n){
for(int i=0; i<n; i++){
System.out.printf("x%d = ",i+1);
System.out.printf("%.2f\n",x[i]);

public static void main(String[] args) {


Triangula ob= new Triangula();
double [][]A={{3,6,7,-4},{1,3,1,1},{-2,1,3,-
2}};
double []x=new double [10];
int n=A.length;
System.out.println("La matriz aumentada es:");
A=ob.triangularSup(A, n);
ob.visualizar(A, n);
System.out.println("La solucion es:");
x=ob.solutriangularSup(A, x, n);
ob.imprimir(x,n);

}
}
COMPILACION :

Você também pode gostar