-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlagrange.c
72 lines (51 loc) · 1.29 KB
/
lagrange.c
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
#include <stdio.h>
double lagrange(int n, double ux, double kx[], double ky[]);
int main()
{
int number_of_data;
printf("number of data: ");
scanf("%d", &number_of_data);
printf("\n");
double unkown_x;
printf("want to find this x's value: ");
scanf("%lf", &unkown_x);
printf("\n");
double known_xs[number_of_data];
double known_ys[number_of_data];
for (int i = 0; i < number_of_data; i++)
{
printf("%d. x: ", i);
scanf("%lf", &known_xs[i]);
printf("\n");
printf("%d. y: ", i);
scanf("%lf", &known_ys[i]);
printf("\n");
}
double result;
result = lagrange(number_of_data, unkown_x, known_xs, known_ys);
printf("Result is -> %lf \n", result);
return 1;
}
double kroneckerDelta(int j, int n, double kx[], double ux);
double lagrange(int n, double ux, double kx[], double ky[])
{
double sum = 0.0;
for (int i = 0; i < n; i++)
{
sum += ky[i] * kroneckerDelta(i, n, kx, ux);
}
return sum;
}
double kroneckerDelta(int j, int n, double kx[], double ux)
{
double product = 1.0;
for (int i = 0; i < n; i++)
{
if (i == j)
{
continue;
}
product *= (ux - kx[i]) / (kx[j] - kx[i]);
}
return product;
}