Debian Codegraph @

include/deal.II/base/polynomials_bernstein.h

raw
1 // ------------------------------------------------------------------------
2 //
3 // SPDX-License-Identifier: LGPL-2.1-or-later
4 // Copyright (C) 2015 - 2025 by the deal.II authors
5 //
6 // This file is part of the deal.II library.
7 //
8 // Part of the source code is dual licensed under Apache-2.0 WITH
9 // LLVM-exception OR LGPL-2.1-or-later. Detailed license information
10 // governing the source code and code contributions can be found in
11 // LICENSE.md and CONTRIBUTING.md at the top level directory of deal.II.
12 //
13 // ------------------------------------------------------------------------
14
15 #ifndef dealii_polynomials_bernstein_h
16 #define dealii_polynomials_bernstein_h
17
18
19 #include <deal.II/base/config.h>
20
21 #include <deal.II/base/polynomial.h>
22
23 #include <fstream>
24 #include <iostream>
25
26
27 DEAL_II_NAMESPACE_OPEN
28
29 /**
30 * This class implements Bernstein basis polynomials of desire degree as
31 * described in
32 * http://www.idav.ucdavis.edu/education/CAGDNotes/Bernstein-Polynomials.pdf in
33 * the paragraph "Converting from the Bernstein Basis to the Power Basis".
34 *
35 * They are used to create the Bernstein finite element FE_Bernstein.
36 *
37 * @ingroup Polynomials
38 */
39 template <typename number>
40 class PolynomialsBernstein : public Polynomials::Polynomial<number>
41 {
42 public:
43 /**
44 * Construct the @p index -th Bernstein Polynomial of degree @p degree.
45 *
46 * @f{align*}{
47 * B_{\text{index}, \text{degree}} (t)
48 * &= \text{binom}(\text{degree}, \text{index})
49 * \cdot t^{\text{index}}
50 * \cdot (1 - t)^{\text{degree} - \text{index}} \\
51 * &= \sum_{i = \text{index}}^\text{degree}
52 * \cdot (-1)^{i - \text{index}}
53 * \cdot \text{binom}(\text{degree}, i)
54 * \cdot \text{binom}(i, \text{index})
55 * \cdot t^i
56 * @f}
57 *
58 * @param index
59 * @param degree
60 */
61 PolynomialsBernstein(const unsigned int index, const unsigned int degree);
62 };
63
64
65 template <typename number>
66 std::vector<Polynomials::Polynomial<number>>
67 generate_complete_bernstein_basis(const unsigned int degree)
68 {
69 std::vector<Polynomials::Polynomial<number>> v;
70 v.reserve(degree + 1);
71 for (unsigned int i = 0; i < degree + 1; ++i)
72 v.push_back(PolynomialsBernstein<number>(i, degree));
73 return v;
74 }
75
76 DEAL_II_NAMESPACE_CLOSE
77
78 #endif