[ VIGRA Homepage | Function Index | Class Index | Namespaces | File List | Main Page ]

details StaticPolynomial< MAXORDER, T > Class Template Reference VIGRA

#include <vigra/polynomial.hxx>

Public Member Functions

StaticPolynomial< MAXORDER, Complex > getDeflated (Complex const &r) const
 
StaticPolynomial getDeflated (Real r) const
 
StaticPolynomial getDerivative (unsigned int n=1) const
 
StaticPolynomialoperator= (StaticPolynomial const &p)
 
template<class ITER >
 StaticPolynomial (ITER i, unsigned int order)
 
template<class ITER >
 StaticPolynomial (ITER i, unsigned int order, double epsilon)
 
 StaticPolynomial (StaticPolynomial const &p)
 
 StaticPolynomial (unsigned int order=0, double epsilon=1.0e-14)
 

Detailed Description

template<unsigned int MAXORDER, class T>
class vigra::StaticPolynomial< MAXORDER, T >

Polynomial with internally managed array of static length.

Most interesting functionality is inherited from vigra::PolynomialView. This class differs from vigra::Polynomial in that it allocates its memory statically which is much faster. Therefore, StaticPolynomial can only represent polynomials up to the given MAXORDER.

See also
vigra::PolynomialView, vigra::Polynomial, polynomialRoots()

#include <vigra/polynomial.hxx>
Namespace: vigra

Constructor & Destructor Documentation

◆ StaticPolynomial() [1/4]

StaticPolynomial ( unsigned int  order = 0,
double  epsilon = 1.0e-14 
)

Construct polynomial with given order <= MAXORDER and all coefficients set to zero (they can be set later using operator[] or the iterators). epsilon (default: 1.0e-14) determines the precision of subsequent algorithms (especially root finding) performed on the polynomial.

◆ StaticPolynomial() [2/4]

StaticPolynomial ( StaticPolynomial< MAXORDER, T > const &  p)

Copy constructor

◆ StaticPolynomial() [3/4]

StaticPolynomial ( ITER  i,
unsigned int  order 
)

Construct polynomial by copying the given coefficient sequence. order <= MAXORDER is required.

◆ StaticPolynomial() [4/4]

StaticPolynomial ( ITER  i,
unsigned int  order,
double  epsilon 
)

Construct polynomial by copying the given coefficient sequence. order <= MAXORDER is required. Set epsilon (default: 1.0e-14) as the precision of subsequent algorithms (especially root finding) performed on the polynomial.

Member Function Documentation

◆ operator=()

StaticPolynomial& operator= ( StaticPolynomial< MAXORDER, T > const &  p)

Assigment.

◆ getDerivative()

StaticPolynomial getDerivative ( unsigned int  n = 1) const

Construct new polynomial representing the derivative of this polynomial.

◆ getDeflated() [1/2]

StaticPolynomial getDeflated ( Real  r) const

Construct new polynomial representing this polynomial after deflation at the real root r.

◆ getDeflated() [2/2]

StaticPolynomial<MAXORDER, Complex> getDeflated ( Complex const &  r) const

Construct new polynomial representing this polynomial after deflation at the complex root r. The resulting polynomial will have complex coefficients, even if this polynomial had real ones.


The documentation for this class was generated from the following file:

© Ullrich Köthe (ullrich.koethe@iwr.uni-heidelberg.de)
Heidelberg Collaboratory for Image Processing, University of Heidelberg, Germany

html generated using doxygen and Python
vigra 1.11.1