Related papers: Robust Trimmed Multipatch IGA with Singular Maps
We study approximation error bounds of isogeometric function spaces on a specific type of singularly parameterized domains. In this context an isogeometric function is the composition of a piecewise rational function with the inverse of a…
This work blends the inexact Newton method with iterative combined approximations (ICA) for solving topology optimization problems under the assumption of geometric nonlinearity. The density-based problem formulation is solved using a…
In recent publications, the author and his coworkers have shown robust approximation error estimates for B-splines of maximum smoothness and have proposed multigrid methods based on them. These methods allow to solve the linear system…
We study unique continuation over an interface using a stabilized unfitted finite element method tailored to the conditional stability of the problem. The interface is approximated using an isoparametric transformation of the background…
In this paper, we investigate inexact variants of dual-primal isogeometric tearing and interconnecting methods for solving large-scale systems of linear equations arising from Galerkin isogeometric discretizations of elliptic boundary value…
Recent quasi-optimal error estimates for the finite element approximation of total-variation regularized minimization problems require the existence of a Lipschitz continuous dual solution. We discuss the validity of this condition and…
We consider an area-minimizing integral current $T$ of codimension higher than $1$ in a smooth Riemannian manifold $\Sigma$. In a previous paper we have subdivided the set of interior singular points with at least one flat tangent cone…
In this work, we study the well-posedness of certain sparse regularized linear regression problems, i.e., the existence, uniqueness and continuity of the solution map with respect to the data. We focus on regularization functions that are…
We propose a novel approach to the analysis of programmable geometrically exact shear deformable beam systems made of shape memory polymers. The proposed method combines the viscoelastic Generalized Maxwell model with the Williams, Landel…
We present a robust and efficient multigrid method for single-patch isogeometric discretizations using tensor product B-splines of maximum smoothness. Our method is based on a stable splitting of the spline space into a large subspace of…
We consider singular perturbation elliptic problems depending on a parameter ? such that, for ? = 0 the boundary conditions are not adapted to the equation (they do not satisfy the Shapiro - Lopatinskii condition). The limit only holds in…
We extend the softFEM idea to isogeometric analysis (IGA) to reduce the stiffness (consequently, the condition numbers) of the IGA discretized problem. We refer to the resulting approximation technique as softIGA. We obtain the resulting…
LSQR and its mathematically equivalent CGLS have been popularly used over the decades for large-scale linear discrete ill-posed problems, where the iteration number $k$ plays the role of the regularization parameter. It has been long known…
This paper introduces a set of numerical methods for Riemannian shape analysis of 3D surfaces within the setting of invariant (elastic) second-order Sobolev metrics. More specifically, we address the computation of geodesics and geodesic…
We prove a sharp regularity threshold for uniqueness in two anisotropic Calder\'on-type inverse problems in dimension $n\ge 3$. The main setting is the Riemannian Schr\"odinger problem with fixed scalar potential: for a prescribed…
We consider the problem of non-rigid shape matching using the functional map framework. Specifically, we analyze a commonly used approach for regularizing functional maps, which consists in penalizing the failure of the unknown map to…
We consider a strongly damped wave equation on compact manifolds, both with and without boundaries, and formulate the corresponding inverse problems. For closed manifolds, we prove that the metric can be uniquely determined, up to an…
We consider a linear-quadratic optimization problem with pointwise bounds on the state for which the constraint is given by the Laplace-Beltrami equation (to have uniqueness we add an lower order term) on a two-dimensional surface . By…
Implicit regularization refers to the tendency of local search algorithms to converge to low-dimensional solutions, even when such structures are not explicitly enforced. Despite its ubiquity, the mechanism underlying this behavior remains…
In this paper, we study the numerical method for the bi-Laplace problems with inhomogeneous coefficients; particularly, we propose finite element schemes on rectangular grids respectively for an inhomogeneous fourth-order elliptic singular…