Related papers: Isogeometric analysis with $C^1$ functions on unst…
We perform numerical experiments on one-dimensional singularly perturbed problems of reaction-convection-diffusion type, using isogeometric analysis. In particular, we use a Galerkin formulation with B-splines as basis functions. The…
With the renewed and growing interest in geometric continuity in mind, this article gives a general definition of geometrically continuous polygonal surfaces and geometrically continuous spline functions on them. Polynomial splines defined…
Implicitly described domains are a well established tool in the simulation of time dependent problems, e.g. using level-set methods. In order to solve partial differential equations on such domains, a range of numerical methods was…
In this paper, we report the use of rational Triangular Bezier Splines (rTBS) to numerically solve the von Karman equations, a system of fourth order PDEs. $C^{1}$ smoothness of the mesh, generated by triangular Bezier elements, enables us…
This paper introduces a novel framework for constructing $C^r$ basis functions for polynomial spline spaces of degree $d$ over arbitrary planar polygonal partitions, overturning the belief that basis functions cannot be constructed on…
This work introduces a scaffolding framework to compactly parametrise solid structures with conforming NURBS elements for isogeometric analysis. A novel formulation introduces a topological, geometrical and parametric subdivision of the…
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…
This paper studies elasto-plastic large deformation behavior of thin shell structures using the isogeometric computational approach with the main focus on the efficiency in modelling the multi-patches and arbitrary material formulations. In…
Isogeometric analysis (IgA) offers enhanced approximation capabilities for the discretization of elliptic boundary-value problems, yet it results in large, sparse, and increasingly ill-conditioned linear systems due to higher…
In this paper, we describe a general class of $C^1$ smooth rational splines that enables, in particular, exact descriptions of ellipses and ellipsoids - some of the most important primitives for CAD and CAE. The univariate rational splines…
The space of $C^1$ cubic Clough-Tocher splines is a classical finite element approximation space over triangulations for solving partial differential equations. However, for such a space there is no B-spline basis available, which is a…
We present a geometric multigrid solver based on adaptive smoothed aggregation suitable for Discontinuous Galerkin (DG) discretisations. Mesh hierarchies are formed via domain decomposition techniques, and the method is applicable to fully…
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 paper presents an immersed, isogeometric finite element framework to predict the response of multi-material, multi-physics problems with complex geometries using locally refined discretizations. To circumvent the need to generate…
In this paper we provide a priori error estimates with explicit constants for both the $L^2$-projection and the Ritz projection onto spline spaces of arbitrary smoothness defined on arbitrary grids. This extends the results recently…
We present in detail three different quasi-Newton isogeometric algorithms for the treatment of free boundary problems. Two algorithms are based on standard Galerkin formulations, while the third is a fully-collocated scheme. With respect to…
This paper is concerned with using discontinuous Galerkin isogeometric analysis (dGIGA) as a numerical treatment of Diffusion problems on orientable surfaces $\Omega \subset \mathbb{R}^3$. The computational domain or surface considered…
This work is motivated by the difficulty in assembling the Galerkin matrix when solving Partial Differential Equations (PDEs) with Isogeometric Analysis (IGA) using B-splines of moderate-to-high polynomial degree. To mitigate this problem,…
To produce cartographic maps, simplification is typically used to reduce complexity of the map to a legible level. With schematic maps, however, this simplification is pushed far beyond the legibility threshold and is instead constrained by…
The fast assembling of stiffness and mass matrices is a key issue in isogeometric analysis, particularly if the spline degree is increased. We present two algorithms based on the idea of sum factorization, one for matrix assembling and one…