AZEN-SGG/2nd_Sem_Bogachev
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Task 3 is done!

Browse source
This commit is contained in:
AZEN-SGG 2025-04-16 15:23:41 +03:00
parent b9e4209b86
commit 4c083aa533
15 changed files with 269 additions and 16 deletions
Download patch file Download diff file Expand all files Collapse all files

20
2025.04.18/02Ex/solve.c
View file

@ -7,16 +7,15 @@
// the Newton interpolation polynomial
double t2_solve (const double x_0, const int n, const double * restrict X, double * restrict Y)
{
double last_x, last_y;
double value = 0;
double start_value = 0;
double value, start_value;
for (int k = 0; k < n-1; ++k)
{
double last_x;
double last_y = Y[n-1];
// printf ("------- K = %d -------\n", k);
last_y = Y[n-1];
for (int i = n-2; i >= k; --i)
{
const double x_i = X[i-k];
@ -33,16 +32,13 @@ double t2_solve (const double x_0, const int n, const double * restrict X, doubl
}
}
last_x = X[0];
start_value = 1;
value = Y[0];
value = 0;
for (int i = 1; i < n; ++i)
for (int i = 0; i < n; ++i)
{
start_value *= (x_0 - last_x);
if (fabs(Y[i]) > DBL_EPSILON)
value += Y[i] * start_value;
last_x = X[i];
value += Y[i] * start_value;
start_value *= (x_0 - X[i]);
}
return value;