71 research outputs found
The Argyris isogeometric space on unstructured multi-patch planar domains
Multi-patch spline parametrizations are used in geometric design and
isogeometric analysis to represent complex domains. We deal with a particular
class of planar multi-patch spline parametrizations called
analysis-suitable (AS-) multi-patch parametrizations (Collin,
Sangalli, Takacs; CAGD, 2016). This class of parametrizations has to satisfy
specific geometric continuity constraints, and is of importance since it allows
to construct, on the multi-patch domain, isogeometric spaces with optimal
approximation properties. It was demonstrated in (Kapl, Sangalli, Takacs; CAD,
2018) that AS- multi-patch parametrizations are suitable for modeling
complex planar multi-patch domains.
In this work, we construct a basis, and an associated dual basis, for a
specific isogeometric spline space over a given AS-
multi-patch parametrization. We call the space the Argyris
isogeometric space, since it is across interfaces and at all
vertices and generalizes the idea of Argyris finite elements to tensor-product
splines. The considered space is a subspace of the entire
isogeometric space , which maintains the reproduction
properties of traces and normal derivatives along the interfaces. Moreover, it
reproduces all derivatives up to second order at the vertices. In contrast to
, the dimension of does not depend on the domain
parametrization, and admits a basis and dual basis which possess
a simple explicit representation and local support.
We conclude the paper with some numerical experiments, which exhibit the
optimal approximation order of the Argyris isogeometric space and
demonstrate the applicability of our approach for isogeometric analysis
Smooth representation of thin shells and volume structures for isogeometric analysis
The purpose of this study is to develop self-contained methods for obtaining smooth meshes which are compatible with isogeometric analysis (IGA). The study contains three main parts. We start by developing a better understanding of shapes and splines through the study of an image-related problem. Then we proceed towards obtaining smooth volumetric meshes of the given voxel-based images. Finally, we treat the smoothness issue on the multi-patch domains with C1 coupling. Following are the highlights of each part.
First, we present a B-spline convolution method for boundary representation of voxel-based images. We adopt the filtering technique to compute the B-spline coefficients and gradients of the images effectively. We then implement the B-spline convolution for developing a non-rigid images registration method. The proposed method is in some sense of “isoparametric”, for which all the computation is done within the B-splines framework. Particularly, updating the images by using B-spline composition promote smooth transformation map between the images. We show the possible medical applications of our method by applying it for registration of brain images.
Secondly, we develop a self-contained volumetric parametrization method based on the B-splines boundary representation. We aim to convert a given voxel-based data to a matching C1 representation with hierarchical cubic splines. The concept of the osculating circle is employed to enhance the geometric approximation, where it is done by a single template and linear transformations (scaling, translations, and rotations) without the need for solving an optimization problem. Moreover, we use the Laplacian smoothing and refinement techniques to avoid irregular meshes and to improve mesh quality. We show with several examples that the method is capable of handling complex 2D and 3D configurations. In particular, we parametrize the 3D Stanford bunny which contains irregular shapes and voids.
Finally, we propose the B´ezier ordinates approach and splines approach for C1 coupling. In the first approach, the new basis functions are defined in terms of the B´ezier Bernstein polynomials. For the second approach, the new basis is defined as a linear combination of C0 basis functions. The methods are not limited to planar or bilinear mappings. They allow the modeling of solutions to fourth order partial differential equations (PDEs) on complex geometric domains, provided that the given patches are G1
continuous. Both methods have their advantages. In particular, the B´ezier approach offer more degree of freedoms, while the spline approach is more computationally efficient. In addition, we proposed partial degree elevation to overcome the C1-locking issue caused by the over constraining of the solution space. We demonstrate the potential of the resulting C1 basis functions for application in IGA which involve fourth order PDEs such as those appearing in Kirchhoff-Love shell models, Cahn-Hilliard phase field application, and biharmonic problems
Approximation power of C1-smooth isogeometric splines on volumetric two-patch domains
International audienceBases and dimensions of trivariate spline functions possessing first order geometric continuity on two-patch domains were studied in [4]. It was shown that the properties of the spline space depend strongly on the type of the gluing data that is used to specify the relation between the partial derivatives along the interface between the patches. Locally supported bases were shown to exist for trilinear geometric gluing data (that corresponds to piecewise trilinear domain parameteriza-tions) and sufficiently high degree. The present paper is devoted to the approximation properties of these spline functions. We recall the construction of the basis functions and show how to compute them efficiently. In contrast to the results in [4], which relied on exact arithmetic operations in the field of rational numbers, we evaluate the coefficients by computations with standard floating point numbers. We then perform numerical experiments with L 2-projection in order to explore the approximation power of the resulting spline functions. Despite the existence of locally supported bases, we observe a reduction of the approximation order for low degrees, and we provide a theoretical explanation for this locking
Recommended from our members
Mini-Workshop: Mathematical Foundations of Isogeometric Analysis
Isogeometric Analysis (IgA) is a new paradigm which is designed to merge two so far disjoint disciplines, namely, numerical simulations for partial differential equations (PDEs) and applied geometry. Initiated by the pioneering 2005 paper of one of us organizers (Hughes), this new concept bridges the gap between classical finite element methods and computer aided design concepts.
Traditional approaches are based on modeling complex geometries by computer aided design tools which then need to be converted to a computational mesh to allow for simulations of PDEs. This process has for decades presented a severe bottleneck in performing efficient simulations. For example, for complex fluid dynamics applications, the modeling of the surface and the mesh generation may take several weeks while the PDE simulations require only a few hours.
On the other hand, simulation methods which exactly represent geometric shapes in terms of the basis functions employed for the numerical simulations bridge the gap and allow from the beginning to eliminate geometry errors. This is accomplished by leaving traditional finite element approaches behind and employing instead more general basis functions such as B-Splines and Non-Uniform Rational B-Splines (NURBS) for the PDE simulations as well. The combined concept of Isogeometric Analysis (IgA) allows for improved convergence and smoothness properties of the PDE solutions and dramatically faster overall simulations.
In the last few years, this new paradigm has revolutionized the engineering communities and triggered an enormous amount of simulations and publications mainly in this field. However, there are several profound theoretical issues which have not been well understood and which are currently investigated by researchers in Numerical Analysis, Approximation Theory and Applied Geometry
Mathematical foundations of adaptive isogeometric analysis
This paper reviews the state of the art and discusses recent developments in
the field of adaptive isogeometric analysis, with special focus on the
mathematical theory. This includes an overview of available spline technologies
for the local resolution of possible singularities as well as the
state-of-the-art formulation of convergence and quasi-optimality of adaptive
algorithms for both the finite element method (FEM) and the boundary element
method (BEM) in the frame of isogeometric analysis (IGA)
Skeleton-stabilized ImmersoGeometric Analysis for incompressible viscous flow problems
A Skeleton-stabilized ImmersoGeometric Analysis technique is proposed for
incompressible viscous flow problems with moderate Reynolds number. The
proposed formulation fits within the framework of the finite cell method, where
essential boundary conditions are imposed weakly using a Nitsche-type method.
The key idea of the proposed formulation is to stabilize the jumps of
high-order derivatives of variables over the skeleton of the background mesh.
The formulation allows the use of identical finite-dimensional spaces for the
approximation of the pressure and velocity fields in immersed domains. The
stability issues observed for inf-sup stable discretizations of immersed
incompressible flow problems are avoided with this formulation. For B-spline
basis functions of degree with highest regularity, only the derivative of
order has to be controlled, which requires specification of only a single
stabilization parameter for the pressure field. The Stokes and Navier-Stokes
equations are studied numerically in two and three dimensions using various
immersed test cases. Oscillation-free solutions and high-order optimal
convergence rates can be obtained. The formulation is shown to be stable even
in limit cases where almost every elements of the physical domain is cut, and
hence it does not require the existence of interior cells. In terms of the
sparsity pattern, the algebraic system has a considerably smaller stencil than
counterpart approaches based on Lagrange basis functions. This important
property makes the proposed skeleton-stabilized technique computationally
practical. To demonstrate the stability and robustness of the method, we
perform a simulation of fluid flow through a porous medium, of which the
geometry is directly extracted from 3D scan data
Isogeometric analysis based on Geometry Independent Field approximaTion (GIFT) and Polynomial Splines over Hierarchical T-meshes
This thesis addresses an adaptive higher-order method based on a Geometry Independent Field approximatTion(GIFT) of polynomial/rationals plines over hierarchical T-meshes(PHT/RHT-splines).
In isogeometric analysis, basis functions used for constructing geometric models in computer-aided design(CAD) are also employed to discretize the partial differential equations(PDEs) for numerical analysis. Non-uniform rational B-Splines(NURBS) are the most commonly used basis functions in CAD. However, they may not be ideal for numerical analysis where local refinement is required.
The alternative method GIFT deploys different splines for geometry and numerical analysis. NURBS are utilized for the geometry representation, while for the field solution, PHT/RHT-splines are used. PHT-splines not only inherit the useful properties of B-splines and NURBS, but also possess the capabilities of local refinement and hierarchical structure. The smooth basis function properties of PHT-splines make them suitable for analysis purposes. While most problems considered in isogeometric analysis can be solved efficiently when the solution is smooth, many non-trivial problems have rough solutions. For example, this can be caused by the presence of re-entrant corners in the domain. For such problems, a tensor-product basis (as in the case of NURBS) is less suitable for resolving the singularities that appear since refinement propagates throughout the computational domain. Hierarchical bases and local refinement (as in the case of PHT-splines) allow for a more efficient way to resolve these singularities by adding more degrees of freedom where they are necessary. In order to drive the adaptive refinement, an efficient recovery-based error estimator is proposed in this thesis. The estimator produces a recovery solution which is a more accurate approximation than the computed numerical solution. Several two- and three-dimensional numerical investigations with PHT-splines of higher order and continuity prove that the proposed method is capable of obtaining results with higher accuracy, better convergence, fewer degrees of freedom and less computational cost than NURBS for smooth solution problems. The adaptive GIFT method utilizing PHT-splines with the recovery-based error estimator is used for solutions with discontinuities or singularities where adaptive local refinement in particular domains of interest achieves higher accuracy with fewer degrees of freedom. This method also proves that it can handle complicated multi-patch domains for two- and three-dimensional problems outperforming uniform refinement in terms of degrees of freedom and computational cost
- …