- 01
- 02
- 03
- 04
- 05
- 06
- 07
- 08
- 09
- 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
std::pair<long double, long double> Calculator::leastsquares(const QVector<double> &x, const QVector<double> &yy) const
{
QVector<double> y = yy;
for (int i = 0; i < y.size(); ++i) {
y[i] += 1.0;
}
long double A, B, a = 0, b = 0, at = 0, tt = 0, bt = 0, tmp = 0;
for (int i = 0; i < x.size(); ++i) {
tmp += x[i] * x[i] * y[i];
}
a = tmp;
tmp = 0;
for (int i = 0; i < x.size(); ++i) {
tmp += y[i] * log(y[i]);
}
a *= tmp;
tmp = 0;
for (int i = 0; i < x.size(); ++i) {
tmp += y[i] * x[i];
}
at = tmp;
tmp = 0;
for (int i = 0; i < x.size(); ++i) {
tmp += y[i] * x[i] * log(y[i]);
}
at *= tmp;
tmp = 0;
a -= at;
for (int i = 0; i < x.size(); ++i) {
tmp += y[i];
}
at = tmp;
tmp = 0;
for (int i = 0; i < x.size(); ++i) {
tmp += x[i] * x[i] * y[i];
}
tt = at * tmp;
tmp = 0;
for (int i = 0; i < x.size(); ++i) {
tmp += x[i] * y[i];
}
tt -= tmp * tmp;
tmp = 0;
a /= tt;
A = exp(a);
for (int i = 0; i < x.size(); ++i) {
tmp += y[i];
}
b = tmp;
tmp = 0;
for (int i = 0; i < x.size(); ++i) {
tmp += x[i] * y[i] * log(y[i]);
}
b *= tmp;
tmp = 0;
for (int i = 0; i < x.size(); ++i) {
tmp += y[i] * x[i];
}
bt = tmp;
tmp = 0;
for (int i = 0; i < x.size(); ++i) {
tmp += y[i] * log(y[i]);
}
bt *= tmp;
tmp = 0;
b -= bt;
b /= tt;
B = b;
return std::make_pair(A, B);
}
Комментарии (0) RSS
Добавить комментарий