Related papers: Algebraic Methods for Supersmooth Spline Spaces
Given a piecewise linear (PL) function $p$ defined on an open subset of $\R^n$, one may construct by elementary means a unique polyhedron with multiplicities $\D(p)$ in the cotangent bundle $\R^n\times \R^{n*}$ representing the graph of the…
In this paper, a method is proposed to solve the problem of monotone smoothing splines using general linear systems. This problem, also called monotone control theoretic splines, has been solved only when the curve generator is modeled by…
In this paper, we introduce a method known as polynomial frame approximation for approximating smooth, multivariate functions defined on irregular domains in $d$ dimensions, where $d$ can be arbitrary. This method is simple, and relies only…
Many statistical models are algebraic in that they are defined by polynomial constraints or by parameterizations that are polynomial or rational maps. This opens the door for tools from computational algebraic geometry. These tools can be…
We define a chain complex for generalized splines on graphs, analogous to that introduced by Billera and refined by Schenck-Stillman for splines on polyhedral complexes. The hyperhomology of this chain complex yields bounds on the…
The problem of monotone smoothing splines with bounds is formulated as a constrained minimization problem of the calculus of variations. Existence and uniqueness of solutions of this problem is proved, as well as the equivalence of it to a…
The design of globally $C^s$-smooth ($s \geq 1$) isogeometric spline spaces over multi-patch geometries is a current and challenging topic of research in the framework of isogeometric analysis. In this work, we extend the recent methods…
We devise a lucid and straightforward way for explicitly constructing quasi-periodic wave solutions (also called multi-periodic wave solutions) of supersymmetric equations in superspace $\mathbb{R}_\Lambda^{2,1}$ over two-dimensional…
The local refinement of PHT-splines (polynomial splines over hierarchical T-meshes) is achieved by a simple cross insertion, which may introduce superfluous control points or coefficients. By allowing split-in-half in mesh refinement,…
In this work, a polygonal Reissner-Mindlin plate element is presented. The formulation is based on a scaled boundary finite element method, where in contrast to the original semi-analytical approach, linear shape functions are introduced…
Many problems of systems control theory boil down to solving polynomial equations, polynomial inequalities or polyomial differential equations. Recent advances in convex optimization and real algebraic geometry can be combined to generate…
We propose a multiscale method for elliptic problems on complex domains, e.g. domains with cracks or complicated boundary. For local singularities this paper also offers a discrete alternative to enrichment techniques such as XFEM. We…
We introduce two classes of right quaternionic Hilbert spaces in the context of slice polyregular functions, generalizing the so-called slice and full hyperholomorphic Bargmann spaces. Their basic properties are discussed, the explicit…
This article mainly aims to overview the recent efforts on developing algebraic geometry for an arbitrary compact almost complex manifold. We review the results obtained by the guiding philosophy that a statement for smooth maps between…
The scalar fields of supersymmetric models are coordinates of a geometric space. We propose a formulation of supersymmetry that is covariant with respect to reparametrizations of this target space. Employing chiral multiplets as an example,…
This work explores the potential of spatial model checking of polyhedral models on a number of selected examples. In computer graphics polyhedral models can be found in the form of triangular surface meshes of tetrahedral volume meshes…
Polyhedral surfaces are fundamental objects in architectural geometry and industrial design. Whereas closeness of a given mesh to a smooth reference surface and its suitability for numerical simulations were already studied extensively, the…
In the paper, we propose a collocation method based on multivariate polynomial splines over triangulation or tetrahedralization for solving Stokes and Navier-Stokes equations. We start with a detailed explanation of the method for the…
We consider a method of pairwise variations for smooth optimization problems, which involve polyhedral constraints. It consists in making steps with respect to the difference of two selected extreme points of the feasible set together with…
In this paper, we develop approximation error estimates as well as corresponding inverse inequalities for B-splines of maximum smoothness, where both the function to be approximated and the approximation error are measured in standard…