NAMay 4, 2018
Adaptive isogeometric analysis with hierarchical box splinesTadej Kanduc, Carlotta Giannelli, Francesca Pelosi et al.
Isogeometric analysis is a recently developed framework based on finite element analysis, where the simple building blocks in geometry and solution space are replaced by more complex and geometrically-oriented compounds. Box splines are an established tool to model complex geometry, and form an intermediate approach between classical tensor-product B-splines and splines over triangulations. Local refinement can be achieved by considering hierarchically nested sequences of box spline spaces. Since box splines do not offer special elements to impose boundary conditions for the numerical solution of partial differential equations (PDEs), we discuss a weak treatment of such boundary conditions. Along the domain boundary, an appropriate domain strip is introduced to enforce the boundary conditions in a weak sense. The thickness of the strip is adaptively defined in order to avoid unnecessary computations. Numerical examples show the optimal convergence rate of box splines and their hierarchical variants for the solution of PDEs.
NAJul 12, 2018
An adaptive IGA-BEM with hierarchical B-splines based on quasi-interpolation quadrature schemesAntonella Falini, Carlotta Giannelli, Tadej Kanduc et al.
The isogeometric formulation of Boundary Element Method (BEM) is investigated within the adaptivity framework. Suitable weighted quadrature rules to evaluate integrals appearing in the Galerkin BEM formulation of 2D Laplace model problems are introduced. The new quadrature schemes are based on a spline quasi-interpolant (QI) operator and properly framed in the hierarchical setting. The local nature of the QI perfectly fits with hierarchical spline constructions and leads to an efficient and accurate numerical scheme. An automatic adaptive refinement strategy is driven by a residual based error estimator. Numerical examples show that the optimal convergence rate of the BEM solution is recovered by the proposed adaptive method.
NAMay 4, 2018
Hermite parametric surface interpolation based on Argyris elementGasper Jaklic, Tadej Kanduc
In this paper, Hermite interpolation by parametric spline surfaces on triangulations is considered. The splines interpolate points, the corresponding tangent planes and normal curvature forms at domain vertices and approximate tangent planes at midpoints of domain edges. Two variations of the scheme are studied: C1 quintic and G1 octic. The latter is of higher polynomial degree but can approximate surfaces of arbitrary topology. The construction of the approximant is local and fast. Some numerical examples of surface approximation are presented.
NAAug 14, 2015
On positivity of principal minors of bivariate Bezier collocation matrixGasper Jaklic, Tadej Kanduc
It is well known that the bivariate polynomial interpolation problem at domain points of a triangle is correct. Thus the corresponding interpolation matrix $M$ is nonsingular. L.L. Schumaker stated the conjecture, that the determinant of $M$ is positive. Furthermore, all its principal minors are conjectured to be positive, too. This result would solve the constrained interpolation problem. In this paper, the basic conjecture for the matrix $M$, the conjecture on minors of polynomials for degree <=17 and for some particular configurations of domain points are confirmed.
NAJul 30, 2018
A study on spline quasi-interpolation based quadrature rules for the isogeometric Galerkin BEMAntonella Falini, Tadej Kanduc
Two recently introduced quadrature schemes for weakly singular integrals [Calabrò et al. J. Comput. Appl. Math. 2018] are investigated in the context of boundary integral equations arising in the isogeometric formulation of Galerkin Boundary Element Method (BEM). In the first scheme, the regular part of the integrand is approximated by a suitable quasi--interpolation spline. In the second scheme the regular part is approximated by a product of two spline functions. The two schemes are tested and compared against other standard and novel methods available in literature to evaluate different types of integrals arising in the Galerkin formulation. Numerical tests reveal that under reasonable assumptions the second scheme convergences with the optimal order in the Galerkin method, when performing $h$-refinement, even with a small amount of quadrature nodes. The quadrature schemes are validated also in numerical examples to solve 2D Laplace problems with Dirichlet boundary conditions.