int t;
int m;
double[][]A=new double[n][n];
double erro=Math.pow(0.1, Erro);
double b;
double c;
double d;
double g;
double xy;
double p;
double q;
double r;
double x;
double s;
double e;
double f;
double z;
double y;
int loop1=LoopNu;
Hessenberg(Matrix,n,A);//将方阵K1转化成上Hessenberg矩阵A
m=n;
while(m!=0)
{
t=m-1;
while(t>0)
{
if(Math.abs(A[t][t-1])>erro*(Math.abs(A[t-1][t-1])+Math.abs(A[t][t])))
{
t-=1;
}
else
{
break;
}
}
if(t==m-1)
{
Ret[m-1][0]=A[m-1][m-1];
Ret[m-1][1]=0;
m-=1;
loop1=LoopNu;
}
else if(t==m-2)
{
b=-(A[m-