Note
The documentation on this page was automatically extracted from the DOLFIN C++ code and may need to be edited or expanded.
Parent class(es)
Lagrange polynomial (basis) with given degree q determined by n = q + 1 nodal points.
Example: q = 1 (n = 2)
Lagrange p(1); p.set(0, 0.0); p.set(1, 1.0);
It is the callers responsibility that the points are distinct.
This creates a Lagrange polynomial (actually two Lagrange polynomials):
p(0,x) = 1 - x (one at x = 0, zero at x = 1) p(1,x) = x (zero at x = 0, one at x = 1)
Constructor
Copy constructor
Specify point
Return number of points
Return degree
Return point
Return value of polynomial i at given point x
Return value of polynomial i at given point x
Return derivate of polynomial i at given point x
Return derivative q (a constant) of polynomial
Return informal string representation (pretty-print)