相关论文: A projected super-penalty method for the $C^1$-cou…
Penalty methods have proven to be particularly effective for achieving the required $C^1$-continuity in the context of multi-patch isogeometric Kirchhoff-Love shells. Due to their conceptual simplicity, these algorithms are readily…
This work focuses on the coupling of trimmed shell patches using Isogeometric Analysis, based on higher continuity splines that seamlessly meet the $C^1$ requirement of Kirchhoff-Love-based discretizations. Weak enforcement of coupling…
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…
Although isogeometric analysis exploits smooth B-spline and NURBS basis functions for the definition of discrete function spaces as well as for the geometry representation, the global smoothness in so-called multipatch parametrizations is…
We develop an a posteriori analysis of C^0 interior penalty methods for the displacement obstacle problem of clamped Kirchhoff plates. We show that a residual based error estimator originally designed for C^0 interior penalty methods for…
One key feature of isogeometric analysis is that it allows smooth shape functions. Indeed, when isogeometric spaces are constructed from $p$-degree splines (and extensions, such as NURBS), they enjoy up to $C^{p-1}$ continuity within each…
We present a new isogeometric method for the discretization of the Reissner-Mindlin plate bending problem. The proposed scheme follows a recent theoretical framework that makes possible to construct a space of smooth discrete deflections…
While shape optimization using isogeometric shells exhibits appealing features by integrating design geometries and analysis models, challenges arise when addressing computer-aided design (CAD) geometries comprised of multiple non-uniform…
This paper is devoted to proposing and analyzing a robust $C^0$ interior penalty method for a gradient-elastic Kirchhoff plate (GEKP) model over a convex polygon. The numerical method is obtained by combining the triangular Hermite element…
We present a mixed finite element method with triangular and parallelogram meshes for the Kirchhoff-Love plate bending model. Critical ingredient is the construction of low-dimensional local spaces and appropriate degrees of freedom that…
This work focuses on the development of a posteriori error estimates for fourth-order, elliptic, partial differential equations. In particular, we propose a novel algorithm to steer an adaptive simulation in the context of Kirchhoff plates…
In this paper we consider a class of structured nonsmooth difference-of-convex (DC) constrained DC program in which the first convex component of the objective and constraints is the sum of a smooth and nonsmooth functions while their…
Penalty methods are a well known class of algorithms for constrained optimization. They transform a constrained problem into a sequence of unconstrained \emph{penalized} problems in the hope that approximate solutions of the latter converge…
Mesh adaptivity is a technique to provide detail in numerical solutions without the need to refine the mesh over the whole domain. Mesh adaptivity in isogeometric analysis can be driven by Truncated Hierarchical B-splines (THB-splines)…
Shell analysis is a well-established field, but achieving optimal higher-order convergence rates for such simulations is a difficult challenge. We present an isogeometric Kirchhoff-Love shell framework that treats every numerical aspect in…
In this work, a linear Kirchhoff-Love shell formulation in the framework of scaled boundary isogeometric analysis is presented that aims to provide a simple approach to trimming for NURBS-based shell analysis. To obtain a global C1-regular…
Isogeometric analysis is a powerful paradigm which exploits the high smoothness of splines for the numerical solution of high order partial differential equations. However, the tensor-product structure of standard multivariate B-spline…
We consider a class of constrained optimization problems with a possibly nonconvex non-Lipschitz objective and a convex feasible set being the intersection of a polyhedron and a possibly degenerate ellipsoid. Such problems have a wide range…
This paper provides a theoretical and numerical investigation of a penalty decomposition scheme for the solution of optimization problems with geometric constraints. In particular, we consider some situations where parts of the constraints…
For Kichhoff-Love shell problems a new mixed formulation solely based on standard $H^1$ spaces is presented. This allows for flexibility in the construction of discretization spaces, e.g., standard $C^0$-coupling of multi-patch isogeometric…