KASKADE 7 development version
|
Defines a constraint formulation where samples are weighted by Bezier test functions. More...
#include <contactConstraints.hh>
Defines a constraint formulation where samples are weighted by Bezier test functions.
For a detailed description of the concept, see the base class Mortar. Let \( g(x_i) \) denote the gap evaluated at sample point \( x_i \), \( i=1,\dots,N \). With \( M \) Bezier functions \( B_k \) (depends on the Bezier order given), we obtain \( M \) constraints
\[ \sum_{i=1}^N g(x_i) B_k(x_i) \ge 0. \]
Definition at line 354 of file contactConstraints.hh.
Public Types | |
using | Entry = Dune::FieldMatrix< Scalar, 1, dim > |
The type of matrix entries in the constraint matrix \( B \) in \( Bx \le b \). More... | |
using | Row = std::vector< std::pair< size_t, Entry > > |
Public Member Functions | |
BezierMortar (int m) | |
Creates a Bezier mortar formulation of order m . More... | |
virtual int | size (int n) const |
The number of resulting constraints if m samples are provided. More... | |
virtual void | updateConstraints (int n, Dune::FieldVector< Scalar, dim-1 > const &xi, Row &vic, Scalar g, std::vector< Row > &rows, std::vector< Scalar > &bounds) const |
The. More... | |
|
inherited |
The type of matrix entries in the constraint matrix \( B \) in \( Bx \le b \).
The entries are row vectors with the same length as the primal variable \( x \) entries.
Definition at line 274 of file contactConstraints.hh.
|
inherited |
Definition at line 275 of file contactConstraints.hh.
Kaskade::BezierMortar< Scalar, dim >::BezierMortar | ( | int | m | ) |
Creates a Bezier mortar formulation of order m
.
m | The order of Bezier polynomials to use as constraint test functions (m >= 0). |
|
virtual |
The number of resulting constraints if m
samples are provided.
Implements Kaskade::Mortar< Scalar, dim >.
|
virtual |
The.
Implements Kaskade::Mortar< Scalar, dim >.