Related papers: CutIGA with Basis Function Removal
Multi-degree splines are piecewise polynomial functions having sections of different degrees. For these splines, we discuss the construction of a B-spline basis by means of integral recurrence relations, extending the class of multi-degree…
We consider and discretize a mixed formulation for linear elasticity with weakly imposed symmetry in two and three dimensions. Whereas existing methods mainly deal with simplicial or polygonal meshes, we take advantage of isogeometric…
In this work we apply reduced basis methods for parametric PDEs to an isogeometric formulation based on NURBS. The motivation for this work is an integrated and complete work pipeline from CAD to parametrization of domain geometry, then…
We present a mass lumping approach based on an isogeometric Petrov-Galerkin method that preserves higher-order spatial accuracy in explicit dynamics calculations irrespective of the polynomial degree of the spline approximation. To…
In this work, we consider the following elliptic partial differential equations: \begin{equation*} \left\{ \begin{aligned}{} - b_{ij} \; \frac{\partial^{2} w}{\partial x_{i} \partial x_{j}} &= g \;\;\; \text{in} \;\; \Omega, w &= 0…
Cutting plane methods, particularly outer approximation, are a well-established approach for solving nonlinear discrete optimization problems without relaxing the integrality of decision variables. While powerful in theory, their…
Isogeometric analysis (IgA) uses the same class of basis functions for both, representing the geometry of the computational domain and approximating the solution. In practical applications, geometrical patches are used in order to get…
We develop a cut finite element method (CutFEM) for the convection problem in a so called fractured domain which is a union of manifolds of different dimensions such that a $d$ dimensional component always resides on the boundary of a $d+1$…
We introduce and study Minimum Cut Representability, a framework to solve optimization and feasibility problems over stable matchings by representing them as minimum s-t cut problems on digraphs over rotations. We provide necessary and…
For many tracking and surveillance applications, background subtraction provides an effective means of segmenting objects moving in front of a static background. Researchers have traditionally used combinations of morphological operations…
Parametric model order reduction using reduced basis methods can be an effective tool for obtaining quickly solvable reduced order models of parametrized partial differential equation problems. With speedups that can reach several orders of…
We develop a theoretical framework for the analysis of stabilized cut finite element methods for the Laplace-Beltrami operator on a manifold embedded in $\mathbb{R}^d$ of arbitrary codimension. The method is based on using continuous…
We present a new approach to three-dimensional electromagnetic scattering problems via fast isogeometric boundary element methods. Starting with an investigation of the theoretical setting around the electric field integral equation within…
In the framework of generalized finite element methods for elliptic equations with rough coefficients, efficiency and accuracy of the numerical method depend critically on the use of appropriate basis functions. This work explores several…
We obtain a sharp lower bound on the isoperimetric deficit of a general polygon in terms of the variance of its side lengths, the variance of its radii, and its deviation from being convex. Our technique involves a functional minimization…
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and co-induction. These proof principles…
Based on spline manifolds we introduce and study a mathematical framework for analysis-suitable unstructured B-spline spaces. In this setting the parameter domain has a manifold structure, which allows for the definition of function spaces…
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…
An inverse problem of identifying inhomogeneity or crack in the workpiece made of nonlinear magnetic material is investigated. To recover the shape from the local measurements, a piecewise constant level set algorithm is proposed. By means…
Explicit time-marching schemes are popular for solving time-dependent partial differential equations; one of the biggest challenges these methods suffer is increasing the critical time-marching step size that guarantees numerical stability.…