Reference documentation for deal.II version 9.4.0
\(\newcommand{\dealvcentcolon}{\mathrel{\mathop{:}}}\) \(\newcommand{\dealcoloneq}{\dealvcentcolon\mathrel{\mkern-1.2mu}=}\) \(\newcommand{\jump}[1]{\left[\!\left[ #1 \right]\!\right]}\) \(\newcommand{\average}[1]{\left\{\!\left\{ #1 \right\}\!\right\}}\)
Namespaces | Functions
polynomial.cc File Reference
#include <deal.II/base/exceptions.h>
#include <deal.II/base/memory_consumption.h>
#include <deal.II/base/point.h>
#include <deal.II/base/polynomial.h>
#include <deal.II/base/quadrature_lib.h>
#include <deal.II/base/thread_management.h>
#include <deal.II/base/utilities.h>
#include <algorithm>
#include <cmath>
#include <limits>
#include <memory>

Go to the source code of this file.

Namespaces

namespace  Polynomials
 
namespace  Polynomials::internal
 
namespace  Polynomials::internal::LagrangeEquidistantImplementation
 

Functions

std::vector< Point< 1 > > Polynomials::internal::LagrangeEquidistantImplementation::generate_equidistant_unit_points (const unsigned int n)
 
std::vector< Polynomial< double > > Polynomials::generate_complete_Lagrange_basis (const std::vector< Point< 1 > > &points)