This file contains helper routines to polynomial roots-solving.
Definition in file polyzero.h.
#include "polynomial.h"
Go to the source code of this file.
Functions | |
| template<class T, class U, class V> | |
| bool | newtonZero (const Polynomial< T > &p, U &z, U &pz, V &mpz, bool adaptive=false) |
| template<class T> | |
| int | removeNullZeros (Polynomial< T > &p) |
| template<class T> | |
| T | cauchyLowerBound (const Polynomial< T > &p, const T &upperBound=T(0)) |
| template<class T> | |
| T | cauchyUpperBound (const Polynomial< T > &p) |
| template<class T> | |
| T | zerosGeometricMean (const Polynomial< T > &p) |
| template<class T> | |
| T | zerosGeometricMean (const Polynomial< std::complex< T > > &p) |
| template<class T> | |
| void | sortZeros (std::vector< std::complex< T > > &zeros) |
| template<class T> | |
| T | solveDegree1 (const T &a, const T &b) |
| template<class T, class U> | |
| void | solveDegree2 (const T &a, const T &b, const T &c, U &z1, U &z2) |
1.4.5