TooN Algorithm Library - tag  0.2
Classes | Functions
polynomial.cc File Reference
#include <TooN/TooN.h>
#include <utility>
#include <vector>
#include <tr1/tuple>
#include <tr1/array>
#include "polynomial.h"
Include dependency graph for polynomial.cc:

Classes

struct  SturmChain10
 

Functions

template<int AN, int BN>
Vector< AN+BN-1 > poly_mul (const Vector< AN > &a, const Vector< BN > &b)
 
template<int N>
Vector< N-1 > polydiff (const Vector< N > &v)
 
template<int NumNum, int NumDenom>
pair< Vector< NumNum-NumDenom+1 >
, Vector< NumDenom-1 > > 
poly_div (Vector< NumNum > num, const Vector< NumDenom > &denom)
 
template<int N, int M>
tuple< Vector< N >, Vector< M > > neg_second (const pair< Vector< N >, Vector< M > > &r)
 
template<class F >
double polish_root_bisection (double lower, double upper, double lower_val, double upper_val, const F &f)
 
template<class F >
tuple< double, double > polish_root_newton (double lower, double upper, double lower_val, double upper_val, const F &f)
 
vector< double > find_roots (const Vector< 11 > &v)
 

Function Documentation

vector<double> find_roots ( const Vector< 11 > &  v)
template<int N, int M>
tuple<Vector<N>, Vector<M> > neg_second ( const pair< Vector< N >, Vector< M > > &  r)
template<class F >
double polish_root_bisection ( double  lower,
double  upper,
double  lower_val,
double  upper_val,
const F &  f 
)
template<class F >
tuple<double, double> polish_root_newton ( double  lower,
double  upper,
double  lower_val,
double  upper_val,
const F &  f 
)

Referenced by find_roots().

template<int NumNum, int NumDenom>
pair<Vector<NumNum-NumDenom+1>, Vector<NumDenom-1> > poly_div ( Vector< NumNum >  num,
const Vector< NumDenom > &  denom 
)
template<int AN, int BN>
Vector<AN+BN-1> poly_mul ( const Vector< AN > &  a,
const Vector< BN > &  b 
)

Referenced by tag::five_point().

template<int N>
Vector<N-1> polydiff ( const Vector< N > &  v)