Wiki - Вклад участника [ru]

Васильев N2

2019-06-04T15:19:41Z

Васильев Михаил: Новая страница: «Вывод программы: c0 = 11 c1 = 21 c2 = 0 b0 = -499.992 b1 = 6.19998 b2 = -4.3 b3 = -2.29928 Описание: с0 = 11 = х1*х6, с1 = 21 = х4*х…»

Вывод программы:
c0 = 11 c1 = 21 c2 = 0
b0 = -499.992 b1 = 6.19998 b2 = -4.3 b3 = -2.29928

Описание:
с0 = 11 = х1*х6, с1 = 21 = х4*х4, с2 = 0 = х1

Модель:

-500 + 6.2*х1*х6 - 4.3*х4*х4 - 2.3*х1

//============================================================================
// Name : CorrelCoeficent.cpp
// Author : MIHAIL_WAS
// Version :
// Copyright :
// Description : Hello World in C++, Ansi-style
//============================================================================

#include <iostream>
#include <sstream>
#include <fstream>
#include <cstring>
#include <cmath>
#include <vector>

using namespace std;

int const numParametrs = 7;
int const numVar = 3;

double** AllocationMatrix (double **x, int dim1, int dim2) {
x = new double*[dim1];
for (int i = 0; i < dim1; i++) {
x[i] = new double[dim2];
}
return x;
}

class InputData {
public:
int size;
double *array;
double m1;
double m2;
double sigma;
string name;

public:
InputData (const double *_array, int _size) {
size = _size;
array = new double[size];
for (int i = 0; i < size; i++) {
array[i] = _array[i];
}
}

void parametrs () {
m1 = 0;
for (int i = 0; i < size; i++) {
m1 += array[i];
}

m1 /= size;

m2 = 0;
for (int i = 0; i < size; i++) {
m2 += (array[i] - m1)*(array[i] - m1);
}

m2 /= (size - 1);
sigma = pow(m2, 0.5);
}

void print() {
for (int i = 0; i < size; i++) {
cout << array[i] << " ";
}
cout << endl;
}

~InputData() {
delete[] array;
}

};

void correlation_coefficient0 (InputData *x, InputData *y, double *r) {
double m1x = x->m1, m1y = y->m1;

for (int i = 0; i < x->size; i++) {
*r += (x->array[i] - m1x)*(y->array[i] - m1y);
}

*r /= ((x->size - 1)*x->sigma*y->sigma);
}

void correlation_coefficient1(InputData *x1, InputData *x2, double *r, double *arrayR, int i, int imax) {
double rx1x2 = 0;
correlation_coefficient0(x1, x2, &rx1x2);

*r = (arrayR[i] - arrayR[imax]*rx1x2)/(pow( (1 - arrayR[imax]*arrayR[imax])*(1 - rx1x2*rx1x2), 0.5));
}

void correlation_coefficient2(InputData *x1, InputData *x2, InputData *x3, InputData *y, double *r, double *arrayR1, double *arrayR2,
int i, int imax1, int imax2) {

double a = arrayR2[i];
double b = arrayR2[imax2];
double c0 = 0, c1 = 0, c2 = 0;

correlation_coefficient0(x1, x3, &c0);
correlation_coefficient0(x1, x2, &c1);
correlation_coefficient0(x2, x3, &c2);

double c = (c0 - c1*c2)/(pow((1 - c1*c1)*(1 - c2*c2), 0.5));
*r = (a - b*c)/(pow((1 - b*b)*(1 - c*c), 0.5));
}

vector< InputData* > adding_parametrs (vector <InputData*> v, int N) {

int size = v.size();
double *x = new double[N];
for (int i = 0; i < size; i++) {

for (int j = i; j < size; j++) {

for (int e = 0; e < N; e++) {
x[e] = v[i]->array[e] * v[j]->array[e];
}
v.push_back(new InputData(x, N));
}
}

return v;
}

vector< InputData* > import_data(int size) {
vector < InputData* > parametrs;
ifstream file ("data.inp", ios::out);
string str = "";
int index = 0;
double **x = AllocationMatrix(x, size, numParametrs - 1);
double *y = new double[size];
double *current_x = new double[size];

while(getline(file, str)) {

string substr = "";
int count = 0;
for (unsigned int i = 0; i < str.length(); i++) {

if ((int)str[i] != 9) {
substr += str[i];
}
else {
count++;

if (count == 1) {
index = atoi(substr.c_str());
}
else {
x[index - 1][count - 2] = atoi(substr.c_str());
}

substr = "";
}
}

y[index - 1] = atof(substr.c_str());
}

for (int i = 0; i < numParametrs - 1; i++) {
for (int j = 0; j < size; j++) {
current_x[j] = x[j][i];
}

InputData *memberOfClass = new InputData(current_x, size);
parametrs.push_back(memberOfClass);
}
parametrs = adding_parametrs(parametrs, size);
InputData *memberOfClass = new InputData(y, size);
parametrs.push_back(memberOfClass);
file.close();
return parametrs;
}

void TransposeMatrix (double **x, double **xT, int size_1, int size_2) {
for (int i = 0; i < size_1; i++) {
for (int j = 0; j < size_2; j++) {
xT[j][i] = x[i][j];
}
}
}

void MultMatrix(double **x, double **y, double **c, int size_11, int size_22, int size_12) {
for (int i = 0; i < size_11; i++) {
for (int j = 0; j < size_22; j++) {
for (int k = 0; k < size_12; k++) {
c[i][j] += x[i][k] * y[k][j];
}
}
}
}

void reverseMatrix (double **x, int size) {
double **e = AllocationMatrix(e, size, size);
double a = 0;

for (int i = 0; i < size; i++)
for (int j = 0; j < size; j++) i == j ? e[i][j] = 1 : e[i][j] = 0;

for(int i = 0; i < size; i++){

a = x[i][i];
for(int j = 0 ; j < size; j++){
x[i][j] /= a;
e[i][j] /= a;
}

for (int k = i + 1; k < size; k++ ){

a = x[k][i];
for(int j = 0; j < size; j++){
x[k][j] -= x[i][j] * a;
e[k][j] -= e[i][j] * a;
}
}
}

for(int i = size - 1; i >0; i--){
for(int j = i - 1; j >= 0; j--){

a = x[j][i];
for(int k = 0; k < size; k++){
x[j][k] -= x[i][k] * a;
e[j][k] -= e[i][k] * a;
}
}
}

for (int i = 0; i < size; i++)
for (int j = 0; j < size; j++)
x[i][j] = e[i][j];
}

double* MNK_second_method(double *x1, double *x2, double *x3, double *y, int size) {

double **x = AllocationMatrix(x, size, 4);
double **yMatrix = AllocationMatrix(yMatrix, size, 1);
double **xT = AllocationMatrix(xT, numVar + 1, size);
double **x_xT = AllocationMatrix(x_xT, numVar + 1, numVar + 1);
double **x_xT_xT = AllocationMatrix(x_xT_xT, numVar + 1, size);
double **B = AllocationMatrix(B, numVar + 1, 1);

for (int i = 0; i < size; i++) {
x[i][0] = 1;
x[i][1] = x1[i];
x[i][2] = x2[i];
x[i][3] = x3[i];
yMatrix[i][0] = y[i];
}

TransposeMatrix(x, xT, size, numVar + 1);
MultMatrix(xT, x, x_xT, numVar + 1, numVar + 1, size);
reverseMatrix(x_xT, numVar + 1);
MultMatrix(x_xT, xT, x_xT_xT, numVar + 1, size, numVar + 1);
MultMatrix(x_xT_xT, yMatrix, B, numVar + 1, 1, size);

double *B_final = new double[numVar + 1];
for (int i = 0; i < numVar + 1; i++) {
B_final[i] = B[i][0];
}

return B_final;
}

int main() {
int N = 50;

vector < InputData* > parametrs;
parametrs = import_data(N);

for (unsigned int i = 0; i < parametrs.size(); i++) {
parametrs[i]->parametrs();
}

double *r0 = new double[parametrs.size() - 1];
int max_correlationIndex = 0;
double max_correlationCoefficient = -1;

for (int i = 0; i < parametrs.size() - 1; i++) {
double r = 0;
correlation_coefficient0(parametrs[i], parametrs[parametrs.size() - 1], &r);
r0[i] = r;

if (fabs(r0[i]) > max_correlationCoefficient) {
max_correlationIndex = i;
max_correlationCoefficient = fabs(r0[i]);
}
}

int max_correlationIndex1 = 0;
max_correlationCoefficient = -1;
int j = 0;
double *r1 = new double[parametrs.size() - 1];

for (int i = 0; i < parametrs.size() - 1; i++) {
double r = 0;

if (i != max_correlationIndex) {
correlation_coefficient1(parametrs[i], parametrs[max_correlationIndex], &r, r0, i, max_correlationIndex);
r1[j] = r;

if (fabs(r) > max_correlationCoefficient) {
max_correlationCoefficient = fabs(r);
max_correlationIndex1 = j;
}
j++;
} else {
r1[j] = 0;
j++;
}
}

int max_correlationIndex2 = 0;
max_correlationCoefficient = -1;
j = 0;
double *r2 = new double[parametrs.size() - 3];

for (int i = 0; i < parametrs.size() - 1; i++) {
double r = 0;

if ((i != max_correlationIndex) && (i != max_correlationIndex1)) {

correlation_coefficient2(parametrs[i], parametrs[max_correlationIndex], parametrs[max_correlationIndex1],
parametrs[parametrs.size() - 1], &r, r0, r1, i, max_correlationIndex, max_correlationIndex1);
r2[j] = r;

if (fabs(r) > max_correlationCoefficient) {
max_correlationCoefficient = fabs(r);
max_correlationIndex2 = j;
}
j++;
}
}

double *mnk = new double[numVar + 1];
mnk = MNK_second_method(parametrs[max_correlationIndex]->array, parametrs[max_correlationIndex1]->array, parametrs[max_correlationIndex2]->array, parametrs[parametrs.size() - 1]->array, 50);

cout << "c0 = " << max_correlationIndex << " c1 = " << max_correlationIndex1 << " c2 = " << max_correlationIndex2 << endl;
cout << "b0 = " << mnk[0] << " b1 = " << mnk[1] << " b2 = " << mnk[2] << " b3 = " << mnk[3] << endl;

return 0;
}

Достижения студентов группы МК-12

2019-06-04T15:14:27Z

Васильев Михаил:

<table>
<tr>
<td>
Васильев Михаил
</td>
<td>
[[Васильев N1]]
</td>
<td>
[[Васильев N2]]
</td>
</tr>
<tr>
<td>
Гамидов Роман Акимович
</td>
<td>
[[Гамидов Роман Акимович N1]]
</td>
<td>
</td>
</tr>

<tr>
<td>
Генералов Кирилл
</td>
<td>
[[Генералов Кирилл N1]]
</td>
<td>
</td>
</tr>

<tr>
<td>
Глаголев Геннадий Александрович
</td>
<td>
[[Глаголев Геннадий Александрович N1]]
</td>
<td>
</td>
</tr>

<tr>
<td>
Калайчев Глеб
</td>
<td>
[[Калайчев N1]]
</td>
<td>
[[Калайчев N2]]
</td>
</tr>

<tr>
<td>
Лебедев Данила
</td>
<td>
[[Лебедев Данила 1]]
</td>
<td>
</td>
</tr>
<tr>
<td>
</td>
<td>
</td>
<td>
</td>
</tr>
<tr>
<td>
Симченко Сергей Александрович
</td>
<td>
[[Симченко Сергей Александрович N1]]
</td>
<td>
</td>
</tr>

<tr>
<td>
</td>
<td>
</td>
<td>
</td>
</tr>
<tr>
<td>
</td>
<td>
</td>
<td>
</td>
</tr>
</table>

Васильев N1

2019-05-24T09:20:09Z

Васильев Михаил:

Print:

sigmaX127.263 sigmaX226.5292 sigmaY205.134

rx1y=0.831126 rx2y=0.566734

MNK_first_method: 15.0154 6.19976 4.30021

MNK_second_method: 15.0154 6.19976 4.30021

Regres: 7.3335 6.25361 4.3822

5.80035e-16 5.80035e-16

1.93219 1.93219 1300.63

//============================================================================
// Name : MNK.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================

#include <iostream>
#include <fstream>
#include <cstdlib>
#include <cmath>
#include <cstring>
using namespace std;

void PrintArr(double *x, int N) {
for (int i = 0; i < N; i++) {
cout << x[i] << " ";
}
cout << endl;
}

void AllocationMatrix(double **x, int size_1, int size_2) {
x = new double*[size_1];
for (int i = 0; i < size_1; i++) {
x[i] = new double[size_2];
}
}

void TransposeMatrix (double **x, double **xT, int size_1, int size_2) {
for (int i = 0; i < size_1; i++) {
for (int j = 0; j < size_2; j++) {
xT[j][i] = x[i][j];
}
}
}

void MultMatrix(double **x, double **y, double **c, int size_11, int size_22, int size_12) {
for (int i = 0; i < size_11; i++) {
for (int j = 0; j < size_22; j++) {
for (int k = 0; k < size_12; k++) {
c[i][j] += x[i][k] * y[k][j];
}
}
}
}

void reverseMatrix (double **x, int size) {
double **e;
AllocationMatrix(e, size, size);
double a = 0;

for (int i = 0; i < size; i++)
for (int j = 0; j < size; j++) i == j ? e[i][j] = 1 : e[i][j] = 0;

for(int i = 0; i < size; i++){

a = x[i][i];
for(int j = 0 ; j < size; j++){
x[i][j] /= a;
e[i][j] /= a;
}

for (int k = i + 1; k < size; k++ ){

a = x[k][i];
for(int j = 0; j < size; j++){
x[k][j] -= x[i][j] * a;
e[k][j] -= e[i][j] * a;
}
}
}

for(int i = size - 1; i >0; i--){
for(int j = i - 1; j >= 0; j--){

a = x[j][i];
for(int k = 0; k < size; k++){
x[j][k] -= x[i][k] * a;
e[j][k] -= e[i][k] * a;
}
}
}

for (int i = 0; i < size; i++)
for (int j = 0; j < size; j++)
x[i][j] = e[i][j];
}

void ReadFile(char *filename, double *x1, double *x2, double *y, int N) {
char buff[10];
ifstream fin(filename);
for (int i = 0; i < N; i++) {
for (int j = 0; j < 4; j++) {
fin >> buff;
if (j == 1) {
x1[i] = atof(buff);
} else if (j == 2) {
x2[i] = atof(buff);
} else if (j == 3) {
y[i] = atof(buff);
}
}
}
}

double* MNK_first_method(double *x1_matrix, double *x2_matrix, double *y_matrix, int N) {
double x1 = 0, x2 = 0, y = 0, yx1 = 0, x12 = 0, x11 = 0, yx2 = 0, x22 = 0;
double *B = new double[3];

for (int i = 0; i < N; i++) {
x1 += x1_matrix[i];
x2 += x2_matrix[i];
y += y_matrix[i];
yx1 += x1_matrix[i]*y_matrix[i];
x12 += x1_matrix[i]*x2_matrix[i];
x11 += x1_matrix[i]*x1_matrix[i];
yx2 += x2_matrix[i]*y_matrix[i];
x22 += x2_matrix[i]*x2_matrix[i];
}
x1 /= N, x2 /= N, y /= N, yx1 /= N, x12 /= N, x11 /= N, yx2 /= N, x22 /= N;

B[2] = ((yx2 - y*x2)*(x1*x1 - x11) + (y*x1 - yx1)*(x1*x2 - x12))/(-2*x2*x1*x12+x12*x12 + x2*x2*x11 + x22*x1*x1 - x22*x11);
B[1] = (y*x1 - yx1 - B[2]*(x2*x1 - x12))/(x1*x1 - x11);
B[0] = y - B[1]*x1 - B[2]*x2;

return B;

}

double* MNK_second_method(double *x1, double *x2, double *y, int size) {

double **x;
AllocationMatrix(x, size, 3);
double **yMatrix;
AllocationMatrix(yMatrix, size, 1);
double **xT;
AllocationMatrix(xT, 3, size);
double **x_xT;
AllocationMatrix(x_xT, 3, 3);
double **x_xT_xT;
AllocationMatrix(x_xT_xT, 3, size);
double **B;
AllocationMatrix(B, 3, 1);

for (int i = 0; i < size; i++) {
x[i][0] = 1;
x[i][1] = x1[i];
x[i][2] = x2[i];
yMatrix[i][0] = y[i];
}

// (xT*x)^-1 * xT * y = B
TransposeMatrix(x, xT, size, 3);
MultMatrix(xT, x, x_xT, 3, 3, size);
reverseMatrix(x_xT, 3);
MultMatrix(x_xT, xT, x_xT_xT, 3, size, 3);
MultMatrix(x_xT_xT, yMatrix, B, 3, 1, size);

double *B_final = new double[3];
for (int i = 0; i < 3; i++) {
B_final[i] = B[i][0];
}

return B_final;
}

double* Regres(double *x1, double *x2, double *y, int N) {
double m1x1 = 0, m2x1 = 0, sigmaX1 = 0;
double m1x2 = 0, m2x2 = 0, sigmaX2 = 0;

double m1y = 0, m2y = 0, sigmaY = 0;
double rx1y = 0, rx2y = 0;

double *b = new double[3];

for (int i = 0; i < N; i++) {
m1x1 += x1[i];
m1x2 += x2[i];
m1y += y[i];
}

m1x1 /= N, m1x2 /= N, m1y /= N;

for (int i = 0; i < N; i++) {
m2x1 += (x1[i] - m1x1)*(x1[i] - m1x1);
m2x2 += (x2[i] - m1x2)*(x2[i] - m1x2);
m2y += (y[i] - m1y)*(y[i] - m1y);
}

m2x1 /= (N - 1), m2x2 /= (N - 1), m2y /= (N - 1);

sigmaX1 = pow(m2x1, 0.5), sigmaX2 = pow(m2x2, 0.5), sigmaY = pow(m2y, 0.5);

for (int i = 0; i < N; i++) {
rx1y += (x1[i] - m1x1)*(y[i] - m1y);
rx2y += (x2[i] - m1x2)*(y[i] - m1y);
}

rx1y /= ((N-1)*sigmaX1*sigmaY);
rx2y /= ((N-1)*sigmaX2*sigmaY);

b[1] = rx1y*sigmaY/sigmaX1;
b[2] = rx2y*sigmaY/sigmaX2;

double b1x1 = 0, b2x2 = 0;
for (int i = 0; i < N; i++) {
b1x1 += b[1]*x1[i];
b2x2 += b[2]*x2[i];
}

b[0] = m1y - (b[1]*m1x1 + b[2]*m1x2);

cout << "Print: " << endl;
cout << "sigmaX1" << sigmaX1 << " sigmaX2" << sigmaX2 << " sigmaY" << sigmaY << endl;
cout << "rx1y=" << rx1y << " rx2y=" << rx2y << endl;

return b;
}

void Fisher(double *B1, double *B2, double *B3, double *x1, double *x2, double *y, double *y_parall, int N, int N_parall) {

double My1 = 0, My2 = 0, My3 = 0, Myp = 0;

for (int i = 0; i < N; i++) {
My1 += (B1[0] + B1[1]*x1[i] + B1[2]*x2[i] - y[i]);
My2 += (B2[0] + B2[1]*x1[i] + B2[2]*x2[i] - y[i]);
My3 += (B3[0] + B3[1]*x1[i] + B3[2]*x2[i] - y[i]);

if (i < N_parall) Myp += y_parall[i];
}

My1 /= N, My2 /= N, My3 /= N, Myp /= N_parall;

cout << My1 << " " << My2 << endl;

double Dy1 = 0, Dy2 = 0, Dy3 = 0, Dyp = 0;

for (int i = 0; i < N; i++) {
Dy1 += pow((B1[0] + B1[1]*x1[i] + B1[2]*x2[i] - y[i] - My1), 2);
Dy2 += pow((B2[0] + B2[1]*x1[i] + B2[2]*x2[i] - y[i] - My2), 2);
Dy3 += pow((B3[0] + B3[1]*x1[i] + B3[2]*x2[i] - y[i] - My3), 2);

if (i < N_parall) Dyp += (y_parall[i] - Myp)*(y_parall[i] - Myp);
}

Dy1 /= (N - 3), Dy2 /= (N - 3), Dy3 /= (N - 3), Dyp /= (N_parall - 1);

cout << Dy1/Dyp << " " << Dy2/Dyp << " " << Dy3/Dyp << endl;
}

int main() {

int N = 49;
int N_parall = 6;

double *x1 = new double[N];
double *x2 = new double[N];
double *y = new double[N];

double *x1_parall = new double[N_parall];
double *x2_parall = new double[N_parall];
double *y_parall = new double[N_parall];

ReadFile("./data.mnk", x1, x2, y, N);

ReadFile("./parall.mnk", x1_parall, x2_parall, y_parall, N_parall);

double * B1 = new double[3];
double * B2 = new double[3];
double * B3 = new double[3];

B1 = MNK_first_method(x1, x2, y, N);
B2 = MNK_first_method(x1, x2, y, N);
B3 = Regres(x1, x2, y, N);

cout << "MNK_first_method: " << B1[0] << " " << B1[1] << " " << B1[2] << endl;
cout << "MNK_second_method: " << B2[0] << " " << B2[1] << " " << B2[2] << endl;
cout << "Regres: " << B3[0] << " " << B3[1] << " " << B3[2] << endl;

Fisher(B1, B2, B3, x1, x2, y, y_parall, N, N_parall);

return 0;
}

Васильев N1

2019-05-24T09:19:51Z

Васильев Михаил:

Print:
sigmaX127.263 sigmaX226.5292 sigmaY205.134
rx1y=0.831126 rx2y=0.566734
MNK_first_method: 15.0154 6.19976 4.30021
MNK_second_method: 15.0154 6.19976 4.30021
Regres: 7.3335 6.25361 4.3822
5.80035e-16 5.80035e-16
1.93219 1.93219 1300.63

//============================================================================
// Name : MNK.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================

#include <iostream>
#include <fstream>
#include <cstdlib>
#include <cmath>
#include <cstring>
using namespace std;

void PrintArr(double *x, int N) {
for (int i = 0; i < N; i++) {
cout << x[i] << " ";
}
cout << endl;
}

void AllocationMatrix(double **x, int size_1, int size_2) {
x = new double*[size_1];
for (int i = 0; i < size_1; i++) {
x[i] = new double[size_2];
}
}

void TransposeMatrix (double **x, double **xT, int size_1, int size_2) {
for (int i = 0; i < size_1; i++) {
for (int j = 0; j < size_2; j++) {
xT[j][i] = x[i][j];
}
}
}

void MultMatrix(double **x, double **y, double **c, int size_11, int size_22, int size_12) {
for (int i = 0; i < size_11; i++) {
for (int j = 0; j < size_22; j++) {
for (int k = 0; k < size_12; k++) {
c[i][j] += x[i][k] * y[k][j];
}
}
}
}

void reverseMatrix (double **x, int size) {
double **e;
AllocationMatrix(e, size, size);
double a = 0;

for (int i = 0; i < size; i++)
for (int j = 0; j < size; j++) i == j ? e[i][j] = 1 : e[i][j] = 0;

for(int i = 0; i < size; i++){

a = x[i][i];
for(int j = 0 ; j < size; j++){
x[i][j] /= a;
e[i][j] /= a;
}

for (int k = i + 1; k < size; k++ ){

a = x[k][i];
for(int j = 0; j < size; j++){
x[k][j] -= x[i][j] * a;
e[k][j] -= e[i][j] * a;
}
}
}

for(int i = size - 1; i >0; i--){
for(int j = i - 1; j >= 0; j--){

a = x[j][i];
for(int k = 0; k < size; k++){
x[j][k] -= x[i][k] * a;
e[j][k] -= e[i][k] * a;
}
}
}

for (int i = 0; i < size; i++)
for (int j = 0; j < size; j++)
x[i][j] = e[i][j];
}

void ReadFile(char *filename, double *x1, double *x2, double *y, int N) {
char buff[10];
ifstream fin(filename);
for (int i = 0; i < N; i++) {
for (int j = 0; j < 4; j++) {
fin >> buff;
if (j == 1) {
x1[i] = atof(buff);
} else if (j == 2) {
x2[i] = atof(buff);
} else if (j == 3) {
y[i] = atof(buff);
}
}
}
}

double* MNK_first_method(double *x1_matrix, double *x2_matrix, double *y_matrix, int N) {
double x1 = 0, x2 = 0, y = 0, yx1 = 0, x12 = 0, x11 = 0, yx2 = 0, x22 = 0;
double *B = new double[3];

for (int i = 0; i < N; i++) {
x1 += x1_matrix[i];
x2 += x2_matrix[i];
y += y_matrix[i];
yx1 += x1_matrix[i]*y_matrix[i];
x12 += x1_matrix[i]*x2_matrix[i];
x11 += x1_matrix[i]*x1_matrix[i];
yx2 += x2_matrix[i]*y_matrix[i];
x22 += x2_matrix[i]*x2_matrix[i];
}
x1 /= N, x2 /= N, y /= N, yx1 /= N, x12 /= N, x11 /= N, yx2 /= N, x22 /= N;

B[2] = ((yx2 - y*x2)*(x1*x1 - x11) + (y*x1 - yx1)*(x1*x2 - x12))/(-2*x2*x1*x12+x12*x12 + x2*x2*x11 + x22*x1*x1 - x22*x11);
B[1] = (y*x1 - yx1 - B[2]*(x2*x1 - x12))/(x1*x1 - x11);
B[0] = y - B[1]*x1 - B[2]*x2;

return B;

}

double* MNK_second_method(double *x1, double *x2, double *y, int size) {

double **x;
AllocationMatrix(x, size, 3);
double **yMatrix;
AllocationMatrix(yMatrix, size, 1);
double **xT;
AllocationMatrix(xT, 3, size);
double **x_xT;
AllocationMatrix(x_xT, 3, 3);
double **x_xT_xT;
AllocationMatrix(x_xT_xT, 3, size);
double **B;
AllocationMatrix(B, 3, 1);

for (int i = 0; i < size; i++) {
x[i][0] = 1;
x[i][1] = x1[i];
x[i][2] = x2[i];
yMatrix[i][0] = y[i];
}

// (xT*x)^-1 * xT * y = B
TransposeMatrix(x, xT, size, 3);
MultMatrix(xT, x, x_xT, 3, 3, size);
reverseMatrix(x_xT, 3);
MultMatrix(x_xT, xT, x_xT_xT, 3, size, 3);
MultMatrix(x_xT_xT, yMatrix, B, 3, 1, size);

double *B_final = new double[3];
for (int i = 0; i < 3; i++) {
B_final[i] = B[i][0];
}

return B_final;
}

double* Regres(double *x1, double *x2, double *y, int N) {
double m1x1 = 0, m2x1 = 0, sigmaX1 = 0;
double m1x2 = 0, m2x2 = 0, sigmaX2 = 0;

double m1y = 0, m2y = 0, sigmaY = 0;
double rx1y = 0, rx2y = 0;

double *b = new double[3];

for (int i = 0; i < N; i++) {
m1x1 += x1[i];
m1x2 += x2[i];
m1y += y[i];
}

m1x1 /= N, m1x2 /= N, m1y /= N;

for (int i = 0; i < N; i++) {
m2x1 += (x1[i] - m1x1)*(x1[i] - m1x1);
m2x2 += (x2[i] - m1x2)*(x2[i] - m1x2);
m2y += (y[i] - m1y)*(y[i] - m1y);
}

m2x1 /= (N - 1), m2x2 /= (N - 1), m2y /= (N - 1);

sigmaX1 = pow(m2x1, 0.5), sigmaX2 = pow(m2x2, 0.5), sigmaY = pow(m2y, 0.5);

for (int i = 0; i < N; i++) {
rx1y += (x1[i] - m1x1)*(y[i] - m1y);
rx2y += (x2[i] - m1x2)*(y[i] - m1y);
}

rx1y /= ((N-1)*sigmaX1*sigmaY);
rx2y /= ((N-1)*sigmaX2*sigmaY);

b[1] = rx1y*sigmaY/sigmaX1;
b[2] = rx2y*sigmaY/sigmaX2;

double b1x1 = 0, b2x2 = 0;
for (int i = 0; i < N; i++) {
b1x1 += b[1]*x1[i];
b2x2 += b[2]*x2[i];
}

b[0] = m1y - (b[1]*m1x1 + b[2]*m1x2);

cout << "Print: " << endl;
cout << "sigmaX1" << sigmaX1 << " sigmaX2" << sigmaX2 << " sigmaY" << sigmaY << endl;
cout << "rx1y=" << rx1y << " rx2y=" << rx2y << endl;

return b;
}

void Fisher(double *B1, double *B2, double *B3, double *x1, double *x2, double *y, double *y_parall, int N, int N_parall) {

double My1 = 0, My2 = 0, My3 = 0, Myp = 0;

for (int i = 0; i < N; i++) {
My1 += (B1[0] + B1[1]*x1[i] + B1[2]*x2[i] - y[i]);
My2 += (B2[0] + B2[1]*x1[i] + B2[2]*x2[i] - y[i]);
My3 += (B3[0] + B3[1]*x1[i] + B3[2]*x2[i] - y[i]);

if (i < N_parall) Myp += y_parall[i];
}

My1 /= N, My2 /= N, My3 /= N, Myp /= N_parall;

cout << My1 << " " << My2 << endl;

double Dy1 = 0, Dy2 = 0, Dy3 = 0, Dyp = 0;

for (int i = 0; i < N; i++) {
Dy1 += pow((B1[0] + B1[1]*x1[i] + B1[2]*x2[i] - y[i] - My1), 2);
Dy2 += pow((B2[0] + B2[1]*x1[i] + B2[2]*x2[i] - y[i] - My2), 2);
Dy3 += pow((B3[0] + B3[1]*x1[i] + B3[2]*x2[i] - y[i] - My3), 2);

if (i < N_parall) Dyp += (y_parall[i] - Myp)*(y_parall[i] - Myp);
}

Dy1 /= (N - 3), Dy2 /= (N - 3), Dy3 /= (N - 3), Dyp /= (N_parall - 1);

cout << Dy1/Dyp << " " << Dy2/Dyp << " " << Dy3/Dyp << endl;
}

int main() {

int N = 49;
int N_parall = 6;

double *x1 = new double[N];
double *x2 = new double[N];
double *y = new double[N];

double *x1_parall = new double[N_parall];
double *x2_parall = new double[N_parall];
double *y_parall = new double[N_parall];

ReadFile("./data.mnk", x1, x2, y, N);

ReadFile("./parall.mnk", x1_parall, x2_parall, y_parall, N_parall);

double * B1 = new double[3];
double * B2 = new double[3];
double * B3 = new double[3];

B1 = MNK_first_method(x1, x2, y, N);
B2 = MNK_first_method(x1, x2, y, N);
B3 = Regres(x1, x2, y, N);

cout << "MNK_first_method: " << B1[0] << " " << B1[1] << " " << B1[2] << endl;
cout << "MNK_second_method: " << B2[0] << " " << B2[1] << " " << B2[2] << endl;
cout << "Regres: " << B3[0] << " " << B3[1] << " " << B3[2] << endl;

Fisher(B1, B2, B3, x1, x2, y, y_parall, N, N_parall);

return 0;
}

Васильев N1

2019-05-24T09:18:14Z

Васильев Михаил:

//============================================================================
// Name : MNK.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================

#include <iostream>
#include <fstream>
#include <cstdlib>
#include <cmath>
#include <cstring>
using namespace std;

void PrintArr(double *x, int N) {
for (int i = 0; i < N; i++) {
cout << x[i] << " ";
}
cout << endl;
}

void AllocationMatrix(double **x, int size_1, int size_2) {
x = new double*[size_1];
for (int i = 0; i < size_1; i++) {
x[i] = new double[size_2];
}
}

void TransposeMatrix (double **x, double **xT, int size_1, int size_2) {
for (int i = 0; i < size_1; i++) {
for (int j = 0; j < size_2; j++) {
xT[j][i] = x[i][j];
}
}
}

void MultMatrix(double **x, double **y, double **c, int size_11, int size_22, int size_12) {
for (int i = 0; i < size_11; i++) {
for (int j = 0; j < size_22; j++) {
for (int k = 0; k < size_12; k++) {
c[i][j] += x[i][k] * y[k][j];
}
}
}
}

void reverseMatrix (double **x, int size) {
double **e;
AllocationMatrix(e, size, size);
double a = 0;

for (int i = 0; i < size; i++)
for (int j = 0; j < size; j++) i == j ? e[i][j] = 1 : e[i][j] = 0;

for(int i = 0; i < size; i++){

a = x[i][i];
for(int j = 0 ; j < size; j++){
x[i][j] /= a;
e[i][j] /= a;
}

for (int k = i + 1; k < size; k++ ){

a = x[k][i];
for(int j = 0; j < size; j++){
x[k][j] -= x[i][j] * a;
e[k][j] -= e[i][j] * a;
}
}
}

for(int i = size - 1; i >0; i--){
for(int j = i - 1; j >= 0; j--){

a = x[j][i];
for(int k = 0; k < size; k++){
x[j][k] -= x[i][k] * a;
e[j][k] -= e[i][k] * a;
}
}
}

for (int i = 0; i < size; i++)
for (int j = 0; j < size; j++)
x[i][j] = e[i][j];
}

void ReadFile(char *filename, double *x1, double *x2, double *y, int N) {
char buff[10];
ifstream fin(filename);
for (int i = 0; i < N; i++) {
for (int j = 0; j < 4; j++) {
fin >> buff;
if (j == 1) {
x1[i] = atof(buff);
} else if (j == 2) {
x2[i] = atof(buff);
} else if (j == 3) {
y[i] = atof(buff);
}
}
}
}

double* MNK_first_method(double *x1_matrix, double *x2_matrix, double *y_matrix, int N) {
double x1 = 0, x2 = 0, y = 0, yx1 = 0, x12 = 0, x11 = 0, yx2 = 0, x22 = 0;
double *B = new double[3];

for (int i = 0; i < N; i++) {
x1 += x1_matrix[i];
x2 += x2_matrix[i];
y += y_matrix[i];
yx1 += x1_matrix[i]*y_matrix[i];
x12 += x1_matrix[i]*x2_matrix[i];
x11 += x1_matrix[i]*x1_matrix[i];
yx2 += x2_matrix[i]*y_matrix[i];
x22 += x2_matrix[i]*x2_matrix[i];
}
x1 /= N, x2 /= N, y /= N, yx1 /= N, x12 /= N, x11 /= N, yx2 /= N, x22 /= N;

B[2] = ((yx2 - y*x2)*(x1*x1 - x11) + (y*x1 - yx1)*(x1*x2 - x12))/(-2*x2*x1*x12+x12*x12 + x2*x2*x11 + x22*x1*x1 - x22*x11);
B[1] = (y*x1 - yx1 - B[2]*(x2*x1 - x12))/(x1*x1 - x11);
B[0] = y - B[1]*x1 - B[2]*x2;

return B;

}

double* MNK_second_method(double *x1, double *x2, double *y, int size) {

double **x;
AllocationMatrix(x, size, 3);
double **yMatrix;
AllocationMatrix(yMatrix, size, 1);
double **xT;
AllocationMatrix(xT, 3, size);
double **x_xT;
AllocationMatrix(x_xT, 3, 3);
double **x_xT_xT;
AllocationMatrix(x_xT_xT, 3, size);
double **B;
AllocationMatrix(B, 3, 1);

for (int i = 0; i < size; i++) {
x[i][0] = 1;
x[i][1] = x1[i];
x[i][2] = x2[i];
yMatrix[i][0] = y[i];
}

// (xT*x)^-1 * xT * y = B
TransposeMatrix(x, xT, size, 3);
MultMatrix(xT, x, x_xT, 3, 3, size);
reverseMatrix(x_xT, 3);
MultMatrix(x_xT, xT, x_xT_xT, 3, size, 3);
MultMatrix(x_xT_xT, yMatrix, B, 3, 1, size);

double *B_final = new double[3];
for (int i = 0; i < 3; i++) {
B_final[i] = B[i][0];
}

return B_final;
}

double* Regres(double *x1, double *x2, double *y, int N) {
double m1x1 = 0, m2x1 = 0, sigmaX1 = 0;
double m1x2 = 0, m2x2 = 0, sigmaX2 = 0;

double m1y = 0, m2y = 0, sigmaY = 0;
double rx1y = 0, rx2y = 0;

double *b = new double[3];

for (int i = 0; i < N; i++) {
m1x1 += x1[i];
m1x2 += x2[i];
m1y += y[i];
}

m1x1 /= N, m1x2 /= N, m1y /= N;

for (int i = 0; i < N; i++) {
m2x1 += (x1[i] - m1x1)*(x1[i] - m1x1);
m2x2 += (x2[i] - m1x2)*(x2[i] - m1x2);
m2y += (y[i] - m1y)*(y[i] - m1y);
}

m2x1 /= (N - 1), m2x2 /= (N - 1), m2y /= (N - 1);

sigmaX1 = pow(m2x1, 0.5), sigmaX2 = pow(m2x2, 0.5), sigmaY = pow(m2y, 0.5);

for (int i = 0; i < N; i++) {
rx1y += (x1[i] - m1x1)*(y[i] - m1y);
rx2y += (x2[i] - m1x2)*(y[i] - m1y);
}

rx1y /= ((N-1)*sigmaX1*sigmaY);
rx2y /= ((N-1)*sigmaX2*sigmaY);

b[1] = rx1y*sigmaY/sigmaX1;
b[2] = rx2y*sigmaY/sigmaX2;

double b1x1 = 0, b2x2 = 0;
for (int i = 0; i < N; i++) {
b1x1 += b[1]*x1[i];
b2x2 += b[2]*x2[i];
}

b[0] = m1y - (b[1]*m1x1 + b[2]*m1x2);

cout << "Print: " << endl;
cout << "sigmaX1" << sigmaX1 << " sigmaX2" << sigmaX2 << " sigmaY" << sigmaY << endl;
cout << "rx1y=" << rx1y << " rx2y=" << rx2y << endl;

return b;
}

void Fisher(double *B1, double *B2, double *B3, double *x1, double *x2, double *y, double *y_parall, int N, int N_parall) {

double My1 = 0, My2 = 0, My3 = 0, Myp = 0;

for (int i = 0; i < N; i++) {
My1 += (B1[0] + B1[1]*x1[i] + B1[2]*x2[i] - y[i]);
My2 += (B2[0] + B2[1]*x1[i] + B2[2]*x2[i] - y[i]);
My3 += (B3[0] + B3[1]*x1[i] + B3[2]*x2[i] - y[i]);

if (i < N_parall) Myp += y_parall[i];
}

My1 /= N, My2 /= N, My3 /= N, Myp /= N_parall;

cout << My1 << " " << My2 << endl;

double Dy1 = 0, Dy2 = 0, Dy3 = 0, Dyp = 0;

for (int i = 0; i < N; i++) {
Dy1 += pow((B1[0] + B1[1]*x1[i] + B1[2]*x2[i] - y[i] - My1), 2);
Dy2 += pow((B2[0] + B2[1]*x1[i] + B2[2]*x2[i] - y[i] - My2), 2);
Dy3 += pow((B3[0] + B3[1]*x1[i] + B3[2]*x2[i] - y[i] - My3), 2);

if (i < N_parall) Dyp += (y_parall[i] - Myp)*(y_parall[i] - Myp);
}

Dy1 /= (N - 3), Dy2 /= (N - 3), Dy3 /= (N - 3), Dyp /= (N_parall - 1);

cout << Dy1/Dyp << " " << Dy2/Dyp << " " << Dy3/Dyp << endl;
}

int main() {

int N = 49;
int N_parall = 6;

double *x1 = new double[N];
double *x2 = new double[N];
double *y = new double[N];

double *x1_parall = new double[N_parall];
double *x2_parall = new double[N_parall];
double *y_parall = new double[N_parall];

ReadFile("./data.mnk", x1, x2, y, N);

ReadFile("./parall.mnk", x1_parall, x2_parall, y_parall, N_parall);

double * B1 = new double[3];
double * B2 = new double[3];
double * B3 = new double[3];

B1 = MNK_first_method(x1, x2, y, N);
B2 = MNK_first_method(x1, x2, y, N);
B3 = Regres(x1, x2, y, N);

cout << "MNK_first_method: " << B1[0] << " " << B1[1] << " " << B1[2] << endl;
cout << "MNK_second_method: " << B2[0] << " " << B2[1] << " " << B2[2] << endl;
cout << "Regres: " << B3[0] << " " << B3[1] << " " << B3[2] << endl;

Fisher(B1, B2, B3, x1, x2, y, y_parall, N, N_parall);

return 0;
}

Васильев N1

2019-04-12T09:22:30Z

Васильев Михаил:

[[hjvbhbhbh]]

<math>M_x=\frac{x^2+\sqrt{r}}{\int^4_{inf}}</math>

Васильев N1

2019-04-12T09:22:04Z

Васильев Михаил:

[[hjvbhbhbh]]

<math>M_x=\frac{x^2+\sqrt{r}}{\int^4_<inf>}</math>

Васильев N1

2019-04-12T09:18:58Z

Васильев Михаил: Новая страница: « hjvbhbhbh»

[[hjvbhbhbh]]

Достижения студентов группы МК-12

2019-04-12T09:17:02Z

Васильев Михаил:

<table>
<tr>
<td>
Генералов Кирилл
</td>
<td>
</td>
<td>
</td>
</tr>
<tr>
<td>
Калайчев Глеб
</td>
<td>
</td>
<td>
</td>
</tr>
<tr>
<td>
Васильев Михаил
</td>
<td>
[[Васильев N1]]
</td>
<td>
</td>
</tr>
<tr>
<td>
Лебедев Данила
</td>
<td>
</td>
<td>
</td>
</tr>
<tr>
<td>
</td>
<td>
</td>
<td>
</td>
</tr>
<tr>
<td>
</td>
<td>
</td>
<td>
</td>
</tr>
<tr>
<td>
</td>
<td>
</td>
<td>
</td>
</tr>
</table>

Достижения студентов группы МК-12

2019-04-12T09:16:41Z

Васильев Михаил:

<table>
<tr>
<td>
Генералов Кирилл
</td>
<td>
</td>
<td>
</td>
</tr>
<tr>
<td>
Калайчев Глеб
</td>
<td>
</td>
<td>
</td>
</tr>
<tr>
<td>
Васильев Михаил
</td>
<td>
Васильев N1
</td>
<td>
</td>
</tr>
<tr>
<td>
Лебедев Данила
</td>
<td>
</td>
<td>
</td>
</tr>
<tr>
<td>
</td>
<td>
</td>
<td>
</td>
</tr>
<tr>
<td>
</td>
<td>
</td>
<td>
</td>
</tr>
<tr>
<td>
</td>
<td>
</td>
<td>
</td>
</tr>
</table>