高斯消去法:
/**
*
* 高斯消元算法
* @author luzi
*
*/
public class guess {
double[] x2 = {0,0,0,0,0,0,0,0};
//列主元高斯消去法
public void guess1(double[][] A,double[] b,int n,int target){
//选主元,消元
double max = Double.MIN_VALUE;
for(int k = 0; k < n - 1; k++){
int t = k;
int p = k;
//选主元
for(; t < n;t++){
if(A[t][k] > max){
max = A[t][k];
p = t;
}
}
//主元交换
if(p != k){
double temp = 0;
for(int i = 0;i < n;i++){
temp = A[p][i];
A[p][i] = A[k][i];
A[k][i] = temp;
}
temp = b[p];
b[p] = b[k];
b[k] = temp;
}
for(int i = k + 1; i < n; i++){
double tp = A[i][k]/A[k][k];
b[i] = b[i] - tp*b[k];
//A[i][k] = 0;
for(int j =