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

details Polynomial Class Template Reference VIGRA

#include "vigra/polynomial.hxx"

Inheritance diagram for Polynomial:

PolynomialView List of all members.

Public Types

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

Public Methods

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


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


typedef BaseType::Complex Complex

 

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.


typedef BaseType::Real Real

 

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
[inline]

 

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 [inline]

 

Copy constructor


Polynomial ITER    i,
unsigned int    order
[inline]

 

Construct polynomial by copying the given coefficient sequence.


Polynomial ITER    i,
unsigned int    order,
double    epsilon
[inline]

 

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 [inline]

 

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 [inline]

 

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


Polynomial<T> getDerivative unsigned int    n = 1 const [inline]

 

Construct new polynomial representing the derivative of this polynomial.


Polynomial& operator= Polynomial< T > const &    p [inline]

 

Assigment


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

© Ullrich Köthe (koethe@informatik.uni-hamburg.de)
Cognitive Systems Group, University of Hamburg, Germany

html generated using doxygen and Python
VIGRA 1.3.2 (27 Jan 2005)