lib/laguerre.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

// Laguerre
//
// laguerre
//
// Laguerre polynomial
//
// L_n(x) via recurrence relation
//
// Inputs:    2
// Outputs:   1
// Constants: 0


#include <math.h>
#include "ts.h"


ts_parameter_t const ts_laguerre_p = { .n_inputs = 2, .n_outputs = 1, .n_constants = 0, .params_size = 0 };

uint_t ts_laguerre_offset( ts_constant_t const *c )
{
	( void )c;
	return ( 0 );
}

int ts_laguerre(
	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_laguerre_p );
	(void)c;
    for( uint_t i = 0; i < n; ++i )
    {
        fp_t xv = x[0][i];
        if (x[1][i] < 0) { y[0][i] = 0; continue; }
        uint_t n_val = (uint_t)x[1][i];
        if( n_val == 0 )
        {
            y[0][i] = 1.0;
        }
        else if( n_val == 1 )
        {
            y[0][i] = 1.0 - xv;
        }
        else
        {
            fp_t l0 = 1.0;
            fp_t l1 = 1.0 - xv;
            for( uint_t k = 2; k <= n_val; ++k )
            {
                fp_t l2 = ((2.0 * (fp_t)k - 1.0 - xv) * l1 - (fp_t)(k - 1) * l0) / (fp_t)k;
                l0 = l1;
                l1 = l2;
            }
            y[0][i] = l1;
        }
    }
	return 0;
}