矩阵加减乘除

public Matrix Invs(){

int rw=row,rk=rank;

Matrix imat=new Matrix(rw,rk);

Matrix jmat=new Matrix(rw,rk);

for(int i=0;i

for(int j=0;j

jmat.mat[i][j]=mat[i][j];

for(int i=0;i

for(int j=0;j

imat.mat[i][j]=0;

for(int i=0;i

imat.mat[i][i]=1;

for(int i=0;i

for(int j=0;j

if(i!=j){

double t=jmat.mat[j][i]/jmat.mat[i][i];

for(int k=0;k

jmat.mat[j][k]-=jmat.mat[i][k]*t;

imat.mat[j][k]-=imat.mat[i][k]*t;}}}

for(int i=0;i

if(jmat.mat[i][i]!=1){

double t=jmat.mat[i][i];

for(int j=0;j

jmat.mat[i][j]=jmat.mat[i][j]/t;

imat.mat[i][j]=imat.mat[i][j]/t;}}

return imat;}}

package model;

import java.awt.BorderLayout;

import java.awt.event.MouseAdapter; import java.awt.event.MouseEvent; import java.awt.event.WindowAdapter; import java.awt.event.WindowEvent; import javax.swing.*;

public class Face {

JFrame f=new JFrame("灰色模型");

JPanel p1=new JPanel();

JPanel p2=new JPanel();

JTextField t1=new JTextField(20);

JTextField t2=new JTextField(20);

JButton bb=new JButton("确定");

JLabel l1=new JLabel("原始数据：");

JLabel l2=new JLabel("预测数据：");

float x[];

float xx[]={0};

float z[]={0};

float B[][];

float TB[][];

float inveB[][];

float EE[][]={};

float MM[][];

double y;

protected Object newSource;

float a;

float b;

public void init()

{

p1.add(l1);

p1.add(t1);

p2.add(l2);

p2.add(t2);

f.add(p1,BorderLayout.NORTH);

f.add(p2);

f.add(bb,BorderLayout.SOUTH);

f.setVisible(true);

f.setSize(200, 200);

f.addWindowListener(new WindowAdapter()

{

public void windowClosing(WindowEvent e)

{

System.exit(0);

}

});

bb.addMouseListener(new MouseAdapter()

{

public void mouseClicked(MouseEvent e)

{

String inputs=t1.getText();

String a[]=inputs.split(",");

for(int i=0;i

x[i]=Integer.parseInt(a[i]);

t2.setText(String.valueOf(y));//强制类型转换}

});

}

public static void main(String[] args)

{

new Face().init();

}

public float[] addx(int w[])//把x[]加为xx[]

{

for(int i=0;i

for(int j=0;j<=i;j++)

xx[i]=xx[i]+w[j];

return xx;

}

public float[] addz(int a,int xx[])//求出z[]数列

{

for(int i=0;i

z[i+1]=a*xx[i+1]+(1-a)*xx[i];

return z;

}

public float[][] changeB(float m[])//求出B[][]数组来{

for(int i=0;i<2;i++)

for(int j=0;j

{ if(i==0)

{

B[j][i]=-m[j+1];

}

else

{

B[j][i]=1;

}

}

return B;

}

public float[][] tB(float e[][])

{

for(int i=0;i

for(int j=0;j

TB[j][i]=e[i][j];

return TB;

public float[][] invesM(float y[][])//求矩阵的逆矩阵

{

for(int i=0;i

for(int j=0;j

inveB[i][j]=y[i][j];

for(int i=0;i

EE[i][i]=1;

for(int i=0;i

for(int j=0;j

if(i!=j)

{

float t=inveB[j][i]/inveB[i][i];

for(int k=0;k

{

inveB[j][k]-=inveB[i][k]*t;

EE[j][k]-=EE[i][k]*t;

}

}

for(int i=0;i

if(inveB[i][i]!=1)

{

float tt=inveB[i][i];

for(int j=0;j

{

inveB[i][j]=inveB[i][j]/tt;

EE[i][j]=EE[i][j]/tt;

}

}

return EE;

}

public float[][] mulitM(float q[][],float h[][])//矩阵的乘法{

for(int i=0;i

for(int j=0;j

{

float sum=0;

for(int k=0;k

sum=sum+q[i][k]*h[k][j];

MM[i][j]=sum;

}

return MM;

}

public double rlt(float f[],int k)

for(int i=0;i

{

if(i==0)

a=f[i];

else

b=f[i];

}

y=-a*(x[0]+b/a)*Math.exp(-a*k);

return y;

}

}

1

1

1

1

2

2 4