Related papers: Robust Trimmed Multipatch IGA with Singular Maps
We investigate elliptic irregular obstacle problems with $p$-growth involving measure data. Emphasis is on the strongly singular case $1 < p \le 2-1/n$, and we obtain several new comparison estimates to prove gradient potential estimates in…
It has become obvious that certain singular phenomena cannot be explained by a mere investigation of the configuration space, defined as the solution set of the loop closure equations. For example, it was observed that a particular 6R…
We consider the problem of analyzing and designing gradient-based discrete-time optimization algorithms for a class of unconstrained optimization problems having strongly convex objective functions with Lipschitz continuous gradient. By…
In the context of unfitted finite element discretizations the realization of high order methods is challenging due to the fact that the geometry approximation has to be sufficiently accurate. Recently a new unfitted finite element method…
In this paper, we investigate asymptotics of the continuous graph Laplace operator on a smooth Riemannian manifold $(M,g)$ admitting an isolated singularity $x$. We show that if the curvature function $\kappa$ doesn't grow too fast near…
The objective of this study is to address the difficulty of simplifying the geometric model in which a differential problem is formulated, also called defeaturing, while simultaneously ensuring that the accuracy of the solution is…
We present a systematic study on higher-order penalty techniques for isogeometric mortar methods. In addition to the weak-continuity enforced by a mortar method, normal derivatives across the interface are penalized. The considered…
We study the problem of optimizing the eigenvalues of the Dirichlet Laplace operator under perimeter constraint. We prove that optimal sets are analytic outside a closed singular set of dimension at most $d-8$ by writing a general…
Singular equations with rank-deficient Jacobians arise frequently in algebraic computing applications. As shown in case studies in this paper, direct and intuitive modeling of algebraic problems often results in nonisolated singular…
The common graph Laplacian regularizer is well-established in semi-supervised learning and spectral dimensionality reduction. However, as a first-order regularizer, it can lead to degenerate functions in high-dimensional manifolds. The…
The main difficulty in solving the discrete constrained problem is its poor and even ill condition. In this paper, we transform the discrete constrained problems on de Rham complex to Laplace-like problems. This transformation not only make…
We formulate and analyze an adaptive algorithm for isogeometric analysis with hierarchical B-splines for weakly-singular boundary integral equations. We prove that the employed weighted-residual error estimator is reliable and converges at…
In this work we consider a question in the calculus of variations motivated by riemannian geometry, the isoperimetric problem. We show that solutions to the isoperimetric problem, close in the flat norm to a smooth submanifold, are…
In the context of isogeometric analysis, globally $C^1$ isogeometric spaces over unstructured quadrilateral meshes allow the direct solution of fourth order partial differential equations on complex geometries via their Galerkin…
We introduce a three-dimensional (3D) fully tensor train (TT)-assembled isogeometric analysis (IGA) framework, TT-IGA, for solving partial differential equations (PDEs) on complex geometries. Our method reformulates IGA discrete operators…
We develop a multigrid solver for the second biharmonic problem in the context of Isogeometric Analysis (IgA), where we also allow a zero-order term. In a previous paper, the authors have developed an analysis for the first biharmonic…
We analyze the problem of global reconstruction of functions as accurately as possible, based on partial information in the form of a truncated power series at some point, and additional analyticity properties. This situation occurs…
In this paper, we study linearly constrained optimization problems (LCP). After applying Hadamard parametrization, the feasible set of the parametrized problem (LCPH) becomes an algebraic variety, with conducive geometric properties which…
We study the classical problem of computing geometric thickness, i.e., finding a straight-line drawing of an input graph and a partition of its edges into as few parts as possible so that each part is crossing-free. Since the problem is…
Low-rank optimization problems with sparse simplex constraints involve variables that must satisfy nonnegativity, sparsity, and sum-to-1 conditions, making their optimization particularly challenging due to the interplay between low-rank…