#include <vector>
#include <cassert>
#include <iomanip>

Include dependency graph for cubic_spline.h:

This graph shows which files directly or indirectly include this file:

Classes
class	Spline

class	BandMatrix

Typedefs
typedef double	Float

Functions
void	thomas_solve (double a, double b, double c, double d, int n)

template<typename T >
int	my_lower_bound (const T &val, const T *arr, const int arrlen)

template<typename T >
int	my_upper_bound (const T &val, T *arr, int arrlen)

Typedef Documentation

◆ Float

typedef double Float

Definition at line 8 of file cubic_spline.h.

Function Documentation

◆ my_lower_bound()

template<typename T >

int my_lower_bound	(	const T &	val,
		const T *	arr,
		const int	arrlen
	)

Definition at line 63 of file cubic_spline.h.

 {
   int it, first=0, last=arrlen;
   int count, step;
   count = arrlen;
   while (count>0)
   {
     it = first; step=count/2; 
     it += step;
     if (arr[it] < val) {              
       first=++it;
       count-=step+1;
     }
     else count=step;
   }
   return first;
 }

Here is the caller graph for this function:

◆ my_upper_bound()

template<typename T >

int my_upper_bound	(	const T &	val,
		T *	arr,
		int	arrlen
	)

Definition at line 88 of file cubic_spline.h.

 {
   int it, first=0, last=arrlen;
   int count, step;
   count = arrlen;
   while (count>0)
   {
     it = first; step=count/2; 
     it += step;
     if (!(val<arr[it])) { 
       first=++it;
       count-=step+1;
     }
     else count=step;
   }
   return first;
 }

◆ thomas_solve()

void thomas_solve	(	double *	a,
		double *	b,
		double *	c,
		double *	d,
		int	n
	)

inline

Definition at line 35 of file cubic_spline.h.

                                                                             {
     n--; // since we start from x0 (not x1) JAI: Therefore last valid index is n for a,b, n-1 for c
     c[0] /= b[0];
     d[0] /= b[0];
 
     for (int i = 1; i < n; i++) {
         c[i] /= b[i] - a[i]*c[i-1];
         d[i] = (d[i] - a[i]*d[i-1]) / (b[i] - a[i]*c[i-1]);
     }
 
     d[n] = (d[n] - a[n]*d[n-1]) / (b[n] - a[n]*c[n-1]);
 
     for (int i = n; i-- > 0;) {
         d[i] -= c[i]*d[i+1];        // JAI: note, i is in [0, n-1]
     }
 }