1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
|
// Licensed to the .NET Foundation under one or more agreements.
// The .NET Foundation licenses this file to you under the MIT license.
// See the LICENSE file in the project root for more information.
//
// Solution of linear algebraic equations and matrix inversion.
using Microsoft.Xunit.Performance;
using System;
using System.Runtime.CompilerServices;
using Xunit;
[assembly: OptimizeForBenchmarks]
[assembly: MeasureInstructionsRetired]
public static class InvMt
{
#if DEBUG
public const int Iterations = 1;
#else
public const int Iterations = 80;
#endif
private const int MatSize = Iterations;
private static T[][] AllocArray<T>(int n1, int n2)
{
T[][] a = new T[n1][];
for (int i = 0; i < n1; ++i)
{
a[i] = new T[n2];
}
return a;
}
[MethodImpl(MethodImplOptions.NoInlining)]
private static bool Bench()
{
double[][] t = AllocArray<double>(MatSize + 1, (MatSize + 1) * 2);
double det, detinv, ber, p;
int n, i, j;
n = MatSize;
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
{
if (i == j)
{
t[i][j] = 2.0001;
t[i][n + 1 + j] = 1.0;
}
else
{
t[i][j] = 1.0001;
t[i][n + 1 + j] = 0.0;
}
}
t[i][n + 1] = System.Math.Sqrt((float)i);
}
Inner(t, out det, ref n);
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
{
p = t[i][j];
t[i][j] = t[i][n + 1 + j];
t[i][n + 1 + j] = p;
}
}
Inner(t, out detinv, ref n);
ber = 0.0;
for (i = 1; i <= n; i++)
{
ber = ber + System.Math.Abs(System.Math.Sqrt((double)i) - t[i][n + 1]);
}
return true;
}
private static void Inner(double[][] t, out double det, ref int n)
{
double tik, tkk;
det = 1.0;
for (int k = 1; k <= n; k++)
{
tkk = t[k][k];
det = det * tkk;
for (int j = 1; j <= (2 * n + 1); j++)
{
t[k][j] = t[k][j] / tkk;
}
for (int i = 1; i <= n; i++)
{
if (i != k)
{
tik = t[i][k];
for (int j = 1; j <= (2 * n + 1); j++)
{
t[i][j] = t[i][j] - t[k][j] * tik;
}
}
}
}
}
[Benchmark]
public static void Test()
{
foreach (var iteration in Benchmark.Iterations)
{
using (iteration.StartMeasurement())
{
Bench();
}
}
}
private static bool TestBase()
{
bool result = Bench();
return result;
}
public static int Main()
{
bool result = TestBase();
return (result ? 100 : -1);
}
}
|
