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

details Polynomial
[Polynomials and root determination]
VIGRA

#include <vigra/polynomial.hxx>

Inheritance diagram for Polynomial:

PolynomialView

List of all members.

Public Types

typedef BaseType::Complex Complex
typedef T const * const_iterator
typedef T * iterator
typedef BaseType::Real Real
typedef T value_type

Public Member Functions

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


Detailed Description

template<class T>
class vigra::Polynomial< T >

Polynomial with internally managed array.

Most interesting functionality is inherited from vigra::PolynomialView.

See also:
vigra::PolynomialView, vigra::StaticPolynomial, polynomialRoots()
#include <vigra/polynomial.hxx>
Namespace: vigra

Member Typedef Documentation

Complex type associated with RealPromote

Reimplemented from PolynomialView.

typedef T const* const_iterator

Const iterator for the coefficient sequence

Reimplemented from PolynomialView.

typedef T* iterator

Iterator for the coefficient sequence

Reimplemented from PolynomialView.

Scalar type associated with RealPromote

Reimplemented from PolynomialView.

typedef T value_type

Coefficient type of the polynomial

Reimplemented from PolynomialView.


Constructor & Destructor Documentation

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

Construct polynomial with given order 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.

Polynomial ( Polynomial< T > const &  p  ) 

Copy constructor

template<class ITER>
Polynomial ( ITER  i,
unsigned int  order 
)

Construct polynomial by copying the given coefficient sequence.

template<class ITER>
Polynomial ( ITER  i,
unsigned int  order,
double  epsilon 
)

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


Member Function Documentation

Polynomial<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.

Polynomial<T> getDeflated ( Real  r  )  const

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

Polynomial<T> getDerivative ( unsigned int  n = 1  )  const

Construct new polynomial representing the derivative of this polynomial.

Polynomial& operator= ( Polynomial< T > const &  p  ) 

Assigment


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.7.1 (3 Dec 2010)