Search

In this paper we propose a modification to the invariant polytope algorithm (ipa) using ideas of the finite expressible tree algorithm (feta) by M\"oller and Reif. We show that our new feta-flavoured-ipa applies to a wider range of matrix families.

We investigate Sobolev regularity of bivariate functions obtained in Isogeometric Analysis when using geometry maps that are degenerate in the sense that the first partial derivatives vanish at isolated points. In particular, we show how the known C1-conditions for D-patches have to be tightened to guarantee square integrability of second partial derivatives, as required when computing finite element approximations of elliptic fourth order PDEs like the biharmonic equation.

We analyze surface patches with a corner that is rounded in the sense that the partial derivatives at that point are antiparallel. Sufficient conditions for $G^1$ smoothness are given, which, up to a certain degenerate case, are also necessary. Further, we investigate curvature integrability and present examples

Estimation of a regression function from independent and identically distributed data is considered. The $L_2$ error with integration with respect to the distribution of the predictor variable is used as the error criterion. The rate of convergence of least squares estimates based on fully connected spaces of deep neural networks with ReLU activation function is analyzed for smooth regression functions. It is shown that in case that the distribution of the predictor variable is concentrated on a manifold, these estimates achieve a rate of convergence which depends on the dimension of the manifold and not on the number of components of the predictor variable.

We introduce trimmed NURBS surfaces with accurate boundary control, briefly called ABC-surfaces, as a solution to the notorious problem of constructing watertight or smooth ($G^1$ and $G^2)$ multi-patch surfaces within the function range of standard CAD/CAM systems and the associated file exchange formats. Our construction is based on the appropriate blend of a base surface, which traces out the intended global shape, and a series of reparametrized ribbons, which dominate the shape near the boundary.

We consider geometric Hermite subdivision for planar curves, i.e., iteratively refining an input polygon with additional tangent or normal vector information sitting in the vertices. The building block for the (nonlinear) subdivision schemes we propose is based on clothoidal averaging, i.e., averaging w.r.t. locally interpolating clothoids, which are curves of linear curvature. To define clothoidal averaging, we derive a new strategy to approximate Hermite interpolating clothoids. We employ the proposed approach to define the geometric Hermite analogues of the well-known Lane-Riesenfeld and four-point schemes. We present results produced by the proposed schemes and discuss their features. In particular, we demonstrate that the proposed schemes yield visually convincing curves.