0、引言
C#提供了矩阵函数库MathNet,可以方便进行矩阵的相关运算,包括:矩阵加、减、乘、除等,以及矩阵的转置。使用时,只需通过NuGet加载该函数库到项目中即可。
一、具体实现
1、获取T矩阵
private static List<double[]> GetT(Form1 form1)
{
List<double[]> list = new List<double[]>();
int l1 = 0, l2 = 0, l3 = 0, m1 = 1, m2 = 1, m3 = 1, n1 = 0, n2 = 0, n3 = 0;
l1 = int.Parse(form1.textBox_l1.Text);
l2 = int.Parse(form1.textBox_l2.Text);
l3 = int.Parse(form1.textBox_l3.Text);
m1 = int.Parse(form1.textBox_m1.Text);
m2 = int.Parse(form1.textBox_m2.Text);
m3 = int.Parse(form1.textBox_m3.Text);
n1 = int.Parse(form1.textBox_n1.Text);
n2 = int.Parse(form1.textBox_n2.Text);
n3 = int.Parse(form1.textBox_n3.Text);
double[] t1 = {
l1 * l1, m1 * m1, n1 * n1, m1 * n1, l1 * n1, l1 * m1,
l2 * l2, m2 * m2, n1 * n2, m2 * n2, l2 * n2, l2 * m2,
l3 * l3, m3 * m3, n3 * n3, m3 * n3, l3 * n3, l3 * m3,
2 * l2 * l3, 2 * m2 * m3, 2 * n2 * n3,m2 * n3 + m3 * n2, l2 * n3 + l3 * n2, l2 * m3 + l3 * m2,
2 * l1 * l3, 2 * m1 * m3, 2 * n2 * n3,m1 * n3 + m3 * n1, l1 * n3 + l3 * n1, l1 * m3 + l3 * m1,
2 * l1 * l2, 2 * m1 * m2, 2 * n1 * n2,m1 * n2 + m2 * n1, l1 * n2 + l2 * n1, l1 * m2 + l2 * m1,
};
l1 = int.Parse(form1.textBox_l4.Text);
l2 = int.Parse(form1.textBox_l5.Text);
l3 = int.Parse(form1.textBox_l6.Text);
m1 = int.Parse(form1.textBox_m4.Text);
m2 = int.Parse(form1.textBox_m5.Text);
m3 = int.Parse(form1.textBox_m6.Text);
n1 = int.Parse(form1.textBox_n4.Text);
n2 = int.Parse(form1.textBox_n5.Text);
n3 = int.Parse(form1.textBox_n6.Text);
double[] t2 = {
l1 * l1, m1 * m1, n1 * n1, m1 * n1, l1 * n1, l1 * m1,
l2 * l2, m2 * m2, n1 * n2, m2 * n2, l2 * n2, l2 * m2,
l3 * l3, m3 * m3, n3 * n3, m3 * n3, l3 * n3, l3 * m3,
2 * l2 * l3, 2 * m2 * m3, 2 * n2 * n3,m2 * n3 + m3 * n2, l2 * n3 + l3 * n2, l2 * m3 + l3 * m2,
2 * l1 * l3, 2 * m1 * m3, 2 * n2 * n3,m1 * n3 + m3 * n1, l1 * n3 + l3 * n1, l1 * m3 + l3 * m1,
2 * l1 * l2, 2 * m1 * m2, 2 * n1 * n2,m1 * n2 + m2 * n1, l1 * n2 + l2 * n1, l1 * m2 + l2 * m1,
};
l1 = 1;
l2 = 0;
l3 = 0;
m1 = 0;
m2 = 1;
m3 = 0;
n1 = 0;
n2 = 0;
n3 = 1;
double[] t3 = {
l1 * l1, m1 * m1, n1 * n1, m1 * n1, l1 * n1, l1 * m1,
l2 * l2, m2 * m2, n1 * n2, m2 * n2, l2 * n2, l2 * m2,
l3 * l3, m3 * m3, n3 * n3, m3 * n3, l3 * n3, l3 * m3,
2 * l2 * l3, 2 * m2 * m3, 2 * n2 * n3,m2 * n3 + m3 * n2, l2 * n3 + l3 * n2, l2 * m3 + l3 * m2,
2 * l1 * l3, 2 * m1 * m3, 2 * n2 * n3,m1 * n3 + m3 * n1, l1 * n3 + l3 * n1, l1 * m3 + l3 * m1,
2 * l1 * l2, 2 * m1 * m2, 2 * n1 * n2,m1 * n2 + m2 * n1, l1 * n2 + l2 * n1, l1 * m2 + l2 * m1,
};
for (int i = 1; i < 18; i++)
{
if (i % 2 != 0)
{
list.Add(t1);
}
else
{
list.Add(t2);
}
}
list.Add(t3);
return list;
}
2、获取S矩阵
private static List<double[]> GetS(Form1 form1)
{
double E11fbt, E22fbt, E33fbt, V23fbt, V12fbt, V13fbt, G12fbt, G13fbt, G23fbt;
double E11f = double.Parse(form1.textBox_E11f.Text.Split(',')[0]);
double Vf = double.Parse(form1.textBox_vf.Text.Split(',')[0]);
double Em = double.Parse(form1.textBox_em.Text.Split(',')[0]);
double Vm = double.Parse(form1.textBox_vm.Text.Split(',')[0]);
double vm = double.Parse(form1.textBox_smalvm.Text.Split(',')[0]);
double E22f = double.Parse(form1.textBox_e22f.Text.Split(',')[0]);
double V12f = double.Parse(form1.textBox_v12f.Text.Split(',')[0]);
double V13f = double.Parse(form1.textBox_v13f.Text.Split(',')[0]);
double G12f = double.Parse(form1.textBox_g12f.Text.Split(',')[0]);
double G23f = double.Parse(form1.textBox_g23f.Text.Split(',')[0]);
double Gm = double.Parse(form1.textBox_gm.Text.Split(',')[0]);
E11fbt = E11f * Vf + Em * Vm;
E22fbt = E33fbt = (E22f * Em) / (E22f - Math.Sqrt(Vf) * E22f + Math.Sqrt(Vf) * Em);
V23fbt = Vf * V13f + Vm * vm;
V12fbt = V13fbt = Vf * V12f + Vm * vm;
G12fbt = G13fbt = (Gm * G12f) / (G12f - Math.Sqrt(Vf) * G12f + Math.Sqrt(Vf) * Gm);
G23fbt = (Gm * G23f) / (G23f - Math.Sqrt(Vf) * G12f + Math.Sqrt(Vf) * Gm);
List<double[]> list = new List<double[]>();
//玻璃纤维
double[] s1 = {
1/E11fbt, -(V12fbt/E22fbt), -(V13fbt/E33fbt), 0, 0, 0,
-(V12fbt/E22fbt), 1/E22fbt, -(V23fbt/E33fbt), 0, 0, 0,
-(V13fbt/E33fbt), -(V23fbt/E33fbt), 1/E33fbt, 0, 0, 0,
0, 0, 0, 2*(1 + V12fbt)/E22fbt, 0 ,0,
0, 0, 0, 0, 1/G13fbt, 0,
0, 0, 0, 0, 0, 1/G12fbt
};
E11f = double.Parse(form1.textBox_E11f.Text.Split(',')[1]);
Vf = double.Parse(form1.textBox_vf.Text.Split(',')[1]);
Em = double.Parse(form1.textBox_em.Text.Split(',')[1]);
Vm = double.Parse(form1.textBox_vm.Text.Split(',')[1]);
vm = double.Parse(form1.textBox_smalvm.Text.Split(',')[1]);
E22f = double.Parse(form1.textBox_e22f.Text.Split(',')[1]);
V12f = double.Parse(form1.textBox_v12f.Text.Split(',')[1]);
V13f = double.Parse(form1.textBox_v13f.Text.Split(',')[1]);
G12f = double.Parse(form1.textBox_g12f.Text.Split(',')[1]);
G23f = double.Parse(form1.textBox_g23f.Text.Split(',')[1]);
Gm = double.Parse(form1.textBox_gm.Text.Split(',')[1]);
E11fbt = E11f * Vf + Em * Vm;
E22fbt = E33fbt = (E22f * Em) / (E22f - Math.Sqrt(Vf) * E22f + Math.Sqrt(Vf) * Em);
V23fbt = Vf * V13f + Vm * vm;
V12fbt = V13fbt = Vf * V12f + Vm * vm;
G12fbt = G13fbt = (Gm * G12f) / (G12f - Math.Sqrt(Vf) * G12f + Math.Sqrt(Vf) * Gm);
G23fbt = (Gm * G23f) / (G23f - Math.Sqrt(Vf) * G12f + Math.Sqrt(Vf) * Gm);
//碳纤维
double[] s2 = {
1/E11fbt, -(V12fbt/E22fbt), -(V13fbt/E33fbt), 0, 0, 0,
-(V12fbt/E22fbt), 1/E22fbt, -(V23fbt/E33fbt), 0, 0, 0,
-(V13fbt/E33fbt), -(V23fbt/E33fbt), 1/E33fbt, 0, 0, 0,
0, 0, 0, 2*(1 + V12fbt)/E22fbt, 0 ,0,
0, 0, 0, 0, 1/G13fbt, 0,
0, 0, 0, 0, 0, 1/G12fbt
};
for (int i = 1; i < 19; i++)
{
if (i >= 4 && i <= 14)
{
list.Add(s2);
}
else
{
list.Add(s1);
}
}
return list;
}
3、矩阵求逆
public static double[,] Athwart(double[,] iMatrix)
{
int i = 0;
int row = iMatrix.GetLength(0);
double[,] MatrixZwei = new double[row, row * 2];
double[,] iMatrixInv = new double[row, row];
for (i = 0; i < row; i++)
{
for (int j = 0; j < row; j++)
{
MatrixZwei[i, j] = iMatrix[i, j];
}
}
for (i = 0; i < row; i++)
{
for (int j = row; j < row * 2; j++)
{
MatrixZwei[i, j] = 0;
if (i + row == j)
MatrixZwei[i, j] = 1;
}
}
for (i = 0; i < row; i++)
{
if (MatrixZwei[i, i] != 0)
{
double intTemp = MatrixZwei[i, i];
for (int j = 0; j < row * 2; j++)
{
MatrixZwei[i, j] = MatrixZwei[i, j] / intTemp;
}
}
for (int j = 0; j < row; j++)
{
if (j == i)
continue;
double intTemp = MatrixZwei[j, i];
for (int k = 0; k < row * 2; k++)
{
MatrixZwei[j, k] = MatrixZwei[j, k] - MatrixZwei[i, k] * intTemp;
}
}
}
for (i = 0; i < row; i++)
{
for (int j = 0; j < row; j++)
{
iMatrixInv[i, j] = MatrixZwei[i, j + row];
}
}
return iMatrixInv;
}
4、计算
public void calc(Form1 form1)
{
List<double[]> Tlist = GetT(form1);
List<double[]> Slist = GetS(form1);
List<double> Vlist = new List<double>();
Vlist.Add(double.Parse(form1.textBox_v1.Text));
Vlist.Add(double.Parse(form1.textBox_v2.Text));
Vlist.Add(double.Parse(form1.textBox_v3.Text));
Vlist.Add(double.Parse(form1.textBox_v4.Text));
Vlist.Add(double.Parse(form1.textBox_v5.Text));
Vlist.Add(double.Parse(form1.textBox_v6.Text));
Vlist.Add(double.Parse(form1.textBox_v7.Text));
Vlist.Add(double.Parse(form1.textBox_v8.Text));
Vlist.Add(double.Parse(form1.textBox_v9.Text));
Vlist.Add(double.Parse(form1.textBox_v10.Text));
Vlist.Add(double.Parse(form1.textBox_v11.Text));
Vlist.Add(double.Parse(form1.textBox_v12.Text));
Vlist.Add(double.Parse(form1.textBox_v13.Text));
Vlist.Add(double.Parse(form1.textBox_v14.Text));
Vlist.Add(double.Parse(form1.textBox_v15.Text));
Vlist.Add(double.Parse(form1.textBox_v16.Text));
Vlist.Add(double.Parse(form1.textBox_v17.Text));
Vlist.Add(double.Parse(form1.textBox_v18.Text));
double Vm = double.Parse(form1.textBox_svm.Text);
double Em15 = double.Parse(form1.textBox_em15.Text);
double Vm15 = double.Parse(form1.textBox_vm15.Text);
double Gm15 = double.Parse(form1.textBox_gm15.Text);
//公式15矩阵
double[] s15 = {
1/Em15, -Vm15/Em15, -Vm15/Em15, 0, 0, 0,
-Vm15/Em15, 1/Em15, -Vm15/Em15, 0, 0, 0,
-Vm15/Em15, -Vm15/Em15, 1/Em15, 0, 0, 0,
0, 0, 0, 1/Gm15, 0, 0,
0, 0, 0, 0, 1/Gm15, 0,
0, 0, 0, 0, 0, 1/Gm15
};
DenseMatrix matrixResult = new DenseMatrix(6, 6);
for (int i = 0; i < 18; i++)
{
DenseMatrix matrixT = new DenseMatrix(6, 6, Tlist[i]);
DenseMatrix matrixS = new DenseMatrix(6, 6, Slist[i]);
DenseMatrix matrixTR = (DenseMatrix)matrixT.Transpose();
matrixResult += matrixT * matrixS * matrixTR * Vlist[i];
}
matrixResult += new DenseMatrix(6, 6, s15) * Vm;
double[] tt = matrixResult.Values;
double[,] matrixReverse = Athwart(matrixResult.ToArray());
Console.WriteLine("结果:");
string reslut = "";
for (int i = 0; i < 36; i++)
{
if ((i + 1) == 7 || (i + 1) == 13 || (i + 1) == 19 ||
(i + 1) == 25 || (i + 1) == 31)
{
Console.WriteLine();
reslut += "\r\n";
}
Console.Write(tt[i] + ",");
reslut += tt[i].ToString() + ",";
}
Console.WriteLine();
Console.WriteLine("逆矩阵:");
string reslutReverse = "";
for (int i = 0; i < 6; i++)
{
for (int j = 0; j < 6; j++)
{
//Console.Write(matrixReverse[i, j] + ",");
reslutReverse += matrixReverse[i, j].ToString("0.00") + ",";
}
reslutReverse += "\r\n";
}
form1.textBox_result.Text = reslutReverse;
}
二、测试