|
| LagrangeEquidistant (const unsigned int n, const unsigned int support_point) |
|
| Polynomial (const std::vector< double > &coefficients) |
|
| Polynomial (const unsigned int n) |
|
| Polynomial (const std::vector< Point< 1 > > &lagrange_support_points, const unsigned int evaluation_point) |
|
| Polynomial () |
|
double | value (const doublex) const |
|
void | value (const doublex, std::vector< double > &values) const |
|
unsigned int | degree () const |
|
void | scale (const doublefactor) |
|
void | shift (const number2 offset) |
|
Polynomial< double > | derivative () const |
|
Polynomial< double > | primitive () const |
|
Polynomial< double > & | operator*= (const double s) |
|
Polynomial< double > & | operator*= (const Polynomial< double > &p) |
|
Polynomial< double > & | operator+= (const Polynomial< double > &p) |
|
Polynomial< double > & | operator-= (const Polynomial< double > &p) |
|
bool | operator== (const Polynomial< double > &p) const |
|
void | print (std::ostream &out) const |
|
void | serialize (Archive &ar, const unsigned int version) |
|
| Subscriptor () |
|
| Subscriptor (const Subscriptor &) |
|
virtual | ~Subscriptor () |
|
Subscriptor & | operator= (const Subscriptor &) |
|
void | subscribe (const char *identifier=0) const |
|
void | unsubscribe (const char *identifier=0) const |
|
unsigned int | n_subscriptions () const |
|
void | list_subscribers () const |
|
| DeclException3 (ExcInUse, int, char *, std::string &,<< "Object of class "<< arg2<< " is still used by "<< arg1<< " other objects.\n"<< "(Additional information: "<< arg3<< ")\n"<< "Note the entry in the Frequently Asked Questions of "<< "deal.II (linked to from http://www.dealii.org/) for "<< "more information on what this error means.") |
|
| DeclException2 (ExcNoSubscriber, char *, char *,<< "No subscriber with identifier \""<< arg2<< "\" did subscribe to this object of class "<< arg1) |
|
template<class Archive > |
void | serialize (Archive &ar, const unsigned int version) |
|
Lagrange polynomials with equidistant interpolation points in [0,1]. The polynomial of degree n
has got n+1
interpolation points. The interpolation points are sorted in ascending order. This order gives an index to each interpolation point. A Lagrangian polynomial equals to 1 at its `support point', and 0 at all other interpolation points. For example, if the degree is 3, and the support point is 1, then the polynomial represented by this object is cubic and its value is 1 at the point x=1/3
, and zero at the point x=0
, x=2/3
, and x=1
. All the polynomials have polynomial degree equal to degree
, but together they span the entire space of polynomials of degree less than or equal degree
.
The Lagrange polynomials are implemented up to degree 10.
- Author
- Ralf Hartmann, 2000
Definition at line 309 of file polynomial.h.