summaryrefslogtreecommitdiffstats
path: root/lib/moving_linear_regression.c
blob: 66b750c2714882b6a5601c3a02837f25048c2eb0 (plain)
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
// Moving Linear Regression
//
// moving_linear_regression
//
// Moving Linear Regression
//
// Rolling least-squares regression line
//
// Inputs:    1
// Outputs:   1
// Constants: 1


#include "ts.h"

typedef struct {
    uint_t k;
} ts_moving_linear_regression_params_t;

ts_parameter_t const ts_moving_linear_regression_p = { .n_inputs = 1, .n_outputs = 1, .n_constants = 1, .params_size = sizeof(ts_moving_linear_regression_params_t) };

uint_t ts_moving_linear_regression_offset( ts_constant_t const *c )
{
	( void )c;
	return ( c ? ((ts_moving_linear_regression_params_t const *)c)->k - 1 : 0 );
}

int ts_moving_linear_regression(
	fp_t * const *y, uint_t y_n,
	fp_t const * const *x, uint_t x_n,
	uint_t n, ts_constant_t const *c
)
{
	TS_PROLOGUE( ts_moving_linear_regression_p );
	if ( !c ) return -1;
    uint_t k = ((ts_moving_linear_regression_params_t const *)c)->k;
    if (k == 0 || n < k) return -1;

    fp_t sum_x = 0, sum_x2 = 0;
    for ( uint_t j = 0; j < k; ++j )
    {
        fp_t xv = (fp_t)j;
        sum_x += xv;
        sum_x2 += xv * xv;
    }
    fp_t denom = (fp_t)k * sum_x2 - sum_x * sum_x;
    fp_t fk = (fp_t)k;

    fp_t sum_y = 0, sum_xy = 0;
    for ( uint_t j = 0; j < k; ++j )
    {
        fp_t yv = x[0][j];
        sum_y += yv;
        sum_xy += (fp_t)j * yv;
    }
    if (denom == 0) {
        y[0][k - 1] = sum_y / fk;
    } else {
        fp_t slope = (fk * sum_xy - sum_x * sum_y) / denom;
        fp_t intercept = (sum_y - slope * sum_x) / fk;
        fp_t x_last = (fp_t)(k - 1);
        y[0][k - 1] = intercept + slope * x_last;
    }

    for ( uint_t i = k; i < n; ++i )
    {
        fp_t y_new = x[0][i];
        fp_t y_old = x[0][i - k];
        fp_t sum_y_old = sum_y;
        sum_y = sum_y - y_old + y_new;
        sum_xy = sum_xy - sum_y_old + y_old + (fk - 1) * y_new;
        if (denom == 0) {
            y[0][i] = sum_y / fk;
        } else {
            fp_t slope = (fk * sum_xy - sum_x * sum_y) / denom;
            fp_t intercept = (sum_y - slope * sum_x) / fk;
            fp_t x_last = (fp_t)(k - 1);
            y[0][i] = intercept + slope * x_last;
        }
    }
	return 0;
}