![]() |
Reference documentation for deal.II version 8.1.0
|
Classes | |
class | HermiteInterpolation |
class | Hierarchical |
class | LagrangeEquidistant |
class | Legendre |
class | Lobatto |
class | Monomial |
class | PiecewisePolynomial |
class | Polynomial |
Functions | |
std::vector < PiecewisePolynomial< double > > | generate_complete_Lagrange_basis_on_subdivisions (const unsigned int n_subdivisions, const unsigned int base_degree) |
std::vector< Polynomial< double > > | generate_complete_Lagrange_basis (const std::vector< Point< 1 > > &points) |
A namespace in which classes relating to the description of 1d polynomial spaces are declared.
std::vector<PiecewisePolynomial<double> > Polynomials::generate_complete_Lagrange_basis_on_subdivisions | ( | const unsigned int | n_subdivisions, |
const unsigned int | base_degree | ||
) |
Generates a complete Lagrange basis on a subdivision of the unit interval in smaller intervals for a given degree on the subintervals and number of intervals.
std::vector<Polynomial<double> > Polynomials::generate_complete_Lagrange_basis | ( | const std::vector< Point< 1 > > & | points | ) |
Given a set of points along the real axis, this function returns all Lagrange polynomials for interpolation of these points. The number of polynomials is equal to the number of points and the maximum degree is one less.