矩阵卷积算法

1
public double[,] M;
2
public double[,] N;
3

4
public Algo(double[,] M, double[,]N)
5
{
6
this.M = M;
7
this.N = N;
8
}

1
/// <summary>
2
/// 判断Mij的条件
3
/// </summary>
4
/// <param name="i"></param>
5
/// <param name="j"></param>
6
/// <param name="I"></param>
7
/// <param name="J"></param>
8
/// <returns></returns>
9
private double JudgeMij(int i,int j,int I,int J)
10
{
11
double result=0;
12
int num = 10;
13
if(I-i-1<0||J-j-1<0||I-i-1>num-1||J-j-1>num-1)
14
{
15
result = 0;
87 collapsed lines
16
}
17
else
18
{
19
result = M[i,j];
20
}
21
return result;
22
}
23
/// <summary>
24
/// 算法一计算V
25
/// </summary>
26
/// <param name="I"></param>
27
/// <param name="J"></param>
28
/// <returns></returns>
29
public double V1(int I,int J)
30
{
31
int m = 3;
32
int i, j;
33

34
double up = 0, down = 0;;
35
double mij = 0;
36

37
for ( i = 0; i < m; i++)
38
{
39
for ( j = 0;  j < m;  j++)
40
{
41
mij=JudgeMij(i,j,I,J);
42
double eps = 1e-10;
43
if (Math.Abs(mij) > eps)
44
{
45
up += mij * N[I - i - 1, J - j - 1];
46
down += mij;
47
}
48
}
49
}
50
return up / down;
51
}
52

53
public double[,]Algo1()
54
{
55
int n = 10;
56
double[,] V = new double[n, n];
57
for ( int I = 0;I < n;I++)
58
{
59
for(int J = 0;J< n;J++)
60
{
61
V[I, J] = V1(I, J);
62
}
63
}
64
return V;
65
}
66
public double V2(int I, int J)
67
{
68
int m = 3;
69
int i, j;
70

71
double up = 0, down = 0;
72
double mij = 0;
73

74
for (i = 0; i < m; i++)
75
{
76
for (j = 0; j < m; j++)
77
{
78
mij = JudgeMij(i, j, I, J);
79
double eps = 1e-10;
80
if (Math.Abs(mij) > eps)
81
{
82
up += mij * N[9-(I - i - 1),9-( J - j - 1)];
83
down += mij;
84
}
85
}
86
}
87
return up / down;
88
}
89
//算法二
90
public double[,] Algo2()
91
{
92
int n = 10;
93
double[,] V = new double[n, n];
94
for (int I = 0; I < n; I++)
95
{
96
for (int J = 0; J < n; J++)
97
{
98
V[I, J] = V2(I, J);
99
}
100
}
101
return V;
102
}

1
private void 导入M矩阵ToolStripMenuItem_Click(object sender, EventArgs e)
2
{
3
try
4
{
5

6
OpenFileDialog opf1 = new OpenFileDialog();
7
opf1.Filter = "文本文件|*.txt";
8
opf1.Title = "请导入M数据文件";
9
if (opf1.ShowDialog() == DialogResult.OK)
10
{
11
StreamReader sr1 = new StreamReader(opf1.FileName);
12
string line;
13
string[] info;
14
int i = 0;
15
M = new double[3, 3];
27 collapsed lines
16
while ((line = sr1.ReadLine()) != null)
17
{
18

19
info = line.Split('\t');
20
M[i, 0] = double.Parse(info[0]);
21
M[i, 1] = double.Parse(info[1]);
22
M[i, 2] = double.Parse(info[2]);
23
i++;
24
}
25
for (int m = 0; m < 3; m++)
26
{
27
for (int n = 0; n < 3; n++)
28
{
29
Report += M[m, n] + "\t";
30
}
31
Report += "\n";
32
}
33

34
richTextBox1.Text = Report;
35
Report = null;
36
}
37
}
38
catch (Exception ex)
39
{
40
throw;
41
}
42
}

1
private void 导入N矩阵ToolStripMenuItem_Click(object sender, EventArgs e)
2
{
3

4
try
5
{
6
OpenFileDialog opf2 = new OpenFileDialog();
7
opf2.Filter = "文本文件|*.txt";
8
opf2.Title = "请导入N数据文件";
9
if (opf2.ShowDialog() == DialogResult.OK)
10
{
11
StreamReader sr2 = new StreamReader(opf2.FileName);
12
string line;
13
string[] info;
14
int i = 0;
15
N = new double[10, 10];
29 collapsed lines
16
while ((line = sr2.ReadLine()) != null)
17
{
18

19
info = line.Split('\t');
20
for (int j = 0; j < info.Length; j++)
21
{
22
N[i, j] = double.Parse(info[j]);
23
}
24
i++;
25
}
26
for (int m = 0; m < 10; m++)
27
{
28
for (int n = 0; n < 10; n++)
29
{
30
Report += N[m, n] + "\t";
31
}
32
Report += "\n";
33
}
34

35
richTextBox1.Text = Report;
36
Report = null;
37
}
38
}
39

40
catch (Exception ex)
41
{
42
throw;
43
}
44
}

1
private void 保存计算报告ToolStripMenuItem_Click(object sender, EventArgs e)
2
{
3
if(V1 != null&&V2!=null)
4
{
5
SaveFileDialog sav=new SaveFileDialog();
6
sav.Filter = "文本文件|*.txt";
7
if(sav.ShowDialog() == DialogResult.OK)
8
{
9
StreamWriter sw=new StreamWriter(sav.FileName);
10
sw.Write(Report);
11
sw.Flush();
12
}
13
}
14
else MessageBox.Show("请先进行计算");
15
}