Refine
Year of publication
Language
- English (19)
Keywords
- geodesic finite elements (4)
- Cosserat rod (2)
- Cosserat rods (2)
- Dune (2)
- contact problem (2)
- coupling conditions (2)
- domain decomposition (2)
- energy minimization (2)
- finite elements (2)
- global convergence (2)
- grid-based methods (2)
- hierarchical grids (2)
- nonlinear elasticity (2)
- Allen-Cahn-equation (1)
- Dirichlet-Neumann (1)
- Discontinuous Galerkin methods (1)
- Richards equation (1)
- Riemannian center of mass (1)
- Riemannian manifolds (1)
- Riemannian trust region method (1)
- Riemannian trust-region methods (1)
- Rothe method (1)
- SQP (1)
- abstract interface (1)
- biomechanics (1)
- c++ (1)
- contact-stabilized Newmark method (1)
- coupling (1)
- directors (1)
- dune (1)
- energy-momentum method (1)
- exact residual (1)
- explicit formula (1)
- filter-trust-region method (1)
- frictionless dynamic contact (1)
- generic programming (1)
- hyperelastic material (1)
- inequality constraints (1)
- interpolation error (1)
- knee model (1)
- large deformation contact (1)
- large deformations (1)
- liquid crystals (1)
- manifold (1)
- meta grid (1)
- micro-fe (1)
- monotone multigrid (1)
- monotone multigrid method (1)
- morphing (1)
- mortar discretisation (1)
- mortar method (1)
- multigrid methods (1)
- multigrid sqp methods (1)
- nonlinear configuration space (1)
- parametrizations (1)
- piecewise linear maps (1)
- polyhedral Gauss-Seidel (1)
- simplicial surfaces (1)
- subgrid (1)
- time discretization (1)
- time integration (1)
- trust region (1)
- unit sphere (1)
- variational analysis (1)
- zero curvature (1)
We present an algorithm that constructs parametrizations of boundary
and interface surfaces automatically. Starting with high-resolution triangulated
surfaces describing the computational domains, we iteratively
simplify the surfaces yielding a coarse approximation of the boundaries
with the same topological type. While simplifying we construct a function
that is defined on the coarse surface and whose image is the original
surface. This function allows access to the correct shape and surface normals
of the original surface as well as to any kind of data defined on it.
Such information can be used by geometric multigrid solvers doing adaptive
mesh refinement. Our algorithm runs stable on all types of input
surfaces, including those that describe domains consisting of several materials.
We have used our method with success in different fields and we
discuss examples from structural mechanics and biomechanics.
We present globally convergent multigrid methods for the nonsymmetric
obstacle problems as arising from the discretization of Black–Scholes models of
American options with local volatilities and discrete data. No tuning or regularization
parameters occur. Our approach relies on symmetrization by transformation
and data recovery by superconvergence.
We present a new solver for large-scale two-body contact problems in nonlinear elasticity. It is based on an SQP-trust-region approach.
This guarantees global convergence to a first-order critical point of
the energy functional. The linearized contact conditions are
discretized using mortar elements. A
special basis transformation known from linear contact problems
allows to use a monotone multigrid solver for the inner quadratic programs.
They can thus be solved with multigrid complexity. Our algorithm
does not contain any regularization or penalization parameters,
and can be used for all hyperelastic material models.
The purpose of the paper is to apply monotone multigrid methods
to static and dynamic biomechanical contact problems.
In space, a finite element method involving a mortar
discretization of the contact conditions is used.
In time, a new contact--stabilized Newmark scheme is presented.
Numerical experiments for a two body Hertzian contact problem
and a biomechanical knee problem are reported.
We present a new inexact nonsmooth Newton method for the solution
of convex minimization problems with piecewise smooth, pointwise
nonlinearities. The algorithm consists of a nonlinear smoothing
step on the fine level and a linear coarse correction.
Suitable postprocessing guarantees global convergence
even in the case of a single multigrid step for each linear subproblem.
Numerical examples show that the overall efficiency
is comparable to multigrid for similar linear problems.
The PSurface Library
(2010)
We describe psurface, a C++ library that allows to store and access piecewise linear mappings between simplicial surfaces in $\R^2$ and $\R^3$. These mappings are stored in a graph data structure and can be constructed explicitly, by projection, or by surface simplification. Piecewise linear maps can be used, e.g., to construct boundary
approximations for finite element grids, and grid intersections for domain decomposition methods. In computer graphics the mappings allow to build level-of-detail representations as well as texture- and bump maps. We document the data structures and algorithms used and show how \psurface is used in the numerical analysis framework Dune
and the visualization software Amira.
We prove global convergence of an inexact polyhedral Gau\ss--Seidel method for the minimization of strictly convex functionals that are continuously differentiable on each polyhedron of a polyhedral decomposition of
their domains of definition. While being known to be very slow by themselves, such methods are a cornerstone for fast, globally convergent multigrid methods. Our result generalizes the proof of Kornhuber and Krause [2006] for differentiable functionals on the Gibbs simplex. Example applications are given that require the generality of our approach.
We investigate geodesic finite elements for functions with values in a space of zero curvature, like a torus or the M\"obius strip. Unlike in the general case, a closed-form expression for geodesic finite element functions is then available. This simplifies computations, and allows us to prove optimal estimates for the interpolation error in 1d and 2d. We also show the somewhat surprising result that the discretization by Kirchhoff transformation of the Richards equation proposed by Berninger et al. is a discretization by geodesic finite elements in the manifold $\mathbb{R}$ with a special metric.
We consider the mechanical coupling of a geometrically exact Cosserat rod to a linear elastic continuum. The coupling conditions are formulated in the nonlinear rod configuration space. We describe a Dirichlet--Neumann algorithm for the coupled system, and use it to simulate the static stresses in a human knee joint, where the Cosserat rods are models for the ligaments.
We introduce geodesic finite elements as a conforming way to discretize partial differential equations for functions $v : \Omega \to M$, where $\Omega$ is an open subset of $\R^d$ and $M$ is a Riemannian manifold. These geodesic finite elements naturally generalize standard first-order
finite elements for Euclidean spaces. They also generalize the geodesic finite elements proposed for $d=1$ by the author. Our formulation is equivariant under isometries of $M$, and hence preserves objectivity of continuous problem formulations. We concentrate on partial differential equations that can be formulated as minimization problems. Discretization leads to algebraic minimization problems on product manifolds $M^n$. These can be solved efficiently
using a Riemannian trust-region method. We propose a monotone multigrid method to solve the constrained inner problems with linear multigrid speed. As an example we numerically compute harmonic maps from a domain in $\R^3$
to $S^2$.