[ VIGRA Homepage | Function Index | Class Index | Namespaces | File List | Main Page ]
|   | Polynomial [Polynomials and root determination] |  | 
#include <vigra/polynomial.hxx>

| 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< Complex > | getDeflated (Complex const &r) const | 
| Polynomial< T > | getDeflated (Real r) const | 
| Polynomial< T > | getDerivative (unsigned int n=1) const | 
| Polynomial & | operator= (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) | |
Most interesting functionality is inherited from vigra::PolynomialView.
#include <vigra/polynomial.hxx>
| 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.
| 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. 
| 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
| 
© Ullrich Köthe     (ullrich.koethe@iwr.uni-heidelberg.de)  | 
html generated using doxygen and Python
 |