Related papers: Isogeometric analysis with $C^1$ cubic Powell-Sabi…
We present computational methods for constructing orthogonal/orthonormal polynomials over arbitrary polygonal domains in $\mathbb{R}^2$ using bivariate spline functions. Leveraging a mature MATLAB implementation which generates spline…
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…
Multi-patch spline parametrizations are used in geometric design and isogeometric analysis to represent complex domains. We deal with a particular class of $C^0$ planar multi-patch spline parametrizations called analysis-suitable $G^1$…
This note contains a solution to the following problem: reconstruct the definition field and the equation of a projective cubic surface, using only combinatorial information about the set of its rational points. This information is encoded…
The perfectly matched layer (PML) formulation is a prominent way of handling radiation problems in unbounded domain and has gained interest due to its simple implementation in finite element codes. However, its simplicity can be advanced…
Spline functions have long been used in numerically solving differential equations. Recently it revives as isogeometric analysis, which uses NURBS for both parametrization and element functions. In this paper, we introduce some multivariate…
We construct a family of monotone and convex $C^1$ integro cubic splines under a strictly convex position of the dataset. Then, we find an optimal spline by considering its approximation properties. Finally, we give some examples to…
Analysis-suitable $G^1$ (AS-$G^1$) multi-patch spline surfaces [4] are particular $G^1$-smooth multi-patch spline surfaces, which are needed to ensure the construction of $C^1$-smooth multi-patch spline spaces with optimal polynomial…
The extended definition of the polynomial B-splines may give a chance to improve the results obtained by the classical cubic polynomial B-splines. Determination of the optimum value of the extension parameter can be achieved by scanning…
The Cayley--Salmon theorem implies the existence of a 27-sheeted covering space specifying lines contained in smooth cubic surfaces over $\mathbb{C}$. In this paper we compute the rational cohomology of the total space of this cover, using…
The spline space $C_k^r(\Delta)$ attached to a subdivided domain $\Delta$ of $\R^{d} $ is the vector space of functions of class $C^{r}$ which are polynomials of degree $\le k$ on each piece of this subdivision. Classical splines on planar…
This paper presents a spline-based parameterisation framework for plane graphs. The plane graph is characterised by a collection of curves forming closed loops that fence-off planar faces which have to be parameterised individually. Hereby,…
We present an approximately $C^1$-smooth multi-patch spline construction which can be used in isogeometric analysis (IGA). A key property of IGA is that it is simple to achieve high order smoothness within a single patch. To represent more…
In this paper, we propose a space-time least-squares isogeometric method to solve parabolic evolution problems, well suited for high-degree smooth splines in the space-time domain. We focus on the linear solver and its computational…
We construct over a given bilinear multi-patch domain a novel $C^s$-smooth mixed degree and regularity isogeometric spline space, which possesses the degree $p=2s+1$ and regularity $r=s$ in a small neighborhood around the edges and…
In this paper the numerical solution of potential problems defined on 3D unbounded domains is addressed with Boundary Element Methods (BEMs), since in this way the problem is studied only on the boundary, and thus any finite approximation…
Second-order elliptic boundary-value problems defined on curved domains in 2D and 3D arise frequently in practice. A lot of work has gone into developing numerical methods for solving such problems. One of the newest and most promising…
A projective hypersurface is nodal if it does not have singularities worse than simple nodes. We calculate the rational cohomology of the spaces of equations of nodal cubic and quartic plane curves and also nodal cubic surfaces in the…
We present a framework for solving the triharmonic equation over bilinearly parameterized planar multi-patch domains by means of isogeometric analysis. Our approach is based on the construction of a globally $C^2$-smooth isogeometric spline…
Volumetric spline parameterization and computational efficiency are two main challenges in isogeometric analysis (IGA). To tackle this problem, we propose a framework of computation reuse in IGA on a set of three-dimensional models with…