275 research outputs found
Construction of analysis-suitable planar multi-patch parameterizations
Isogeometric analysis allows to define shape functions of global
continuity (or of higher continuity) over multi-patch geometries. The
construction of such -smooth isogeometric functions is a non-trivial
task and requires particular multi-patch parameterizations, so-called
analysis-suitable (in short, AS-) parameterizations, to ensure
that the resulting isogeometric spaces possess optimal approximation
properties, cf. [7]. In this work, we show through examples that it is possible
to construct AS- multi-patch parameterizations of planar domains, given
their boundary. More precisely, given a generic multi-patch geometry, we
generate an AS- multi-patch parameterization possessing the same
boundary, the same vertices and the same first derivatives at the vertices, and
which is as close as possible to this initial geometry. Our algorithm is based
on a quadratic optimization problem with linear side constraints. Numerical
tests also confirm that isogeometric spaces over AS- multi-patch
parameterized domains converge optimally under mesh refinement, while for
generic parameterizations the convergence order is severely reduced
Constructing IGA-suitable planar parameterization from complex CAD boundary by domain partition and global/local optimization
In this paper, we propose a general framework for constructing IGA-suitable
planar B-spline parameterizations from given complex CAD boundaries consisting
of a set of B-spline curves. Instead of forming the computational domain by a
simple boundary, planar domains with high genus and more complex boundary
curves are considered. Firstly, some pre-processing operations including
B\'ezier extraction and subdivision are performed on each boundary curve in
order to generate a high-quality planar parameterization; then a robust planar
domain partition framework is proposed to construct high-quality patch-meshing
results with few singularities from the discrete boundary formed by connecting
the end points of the resulting boundary segments. After the topology
information generation of quadrilateral decomposition, the optimal placement of
interior B\'ezier curves corresponding to the interior edges of the
quadrangulation is constructed by a global optimization method to achieve a
patch-partition with high quality. Finally, after the imposition of
C1=G1-continuity constraints on the interface of neighboring B\'ezier patches
with respect to each quad in the quadrangulation, the high-quality B\'ezier
patch parameterization is obtained by a C1-constrained local optimization
method to achieve uniform and orthogonal iso-parametric structures while
keeping the continuity conditions between patches. The efficiency and
robustness of the proposed method are demonstrated by several examples which
are compared to results obtained by the skeleton-based parameterization
approach
A locally based construction of analysis-suitable multi-patch spline surfaces
Analysis-suitable (AS-) multi-patch spline surfaces [4] are
particular -smooth multi-patch spline surfaces, which are needed to ensure
the construction of -smooth multi-patch spline spaces with optimal
polynomial reproduction properties [16]. We present a novel local approach for
the design of AS- multi-patch spline surfaces, which is based on the use
of Lagrange multipliers. The presented method is simple and generates an
AS- multi-patch spline surface by approximating a given -smooth but
non-AS- multi-patch surface. Several numerical examples demonstrate the
potential of the proposed technique for the construction of AS-
multi-patch spline surfaces and show that these surfaces are especially suited
for applications in isogeometric analysis by solving the biharmonic problem, a
particular fourth order partial differential equation, over them
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
Adaptive isogeometric methods with (truncated) hierarchical splines on planar multi-patch domains
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 models is not well suited for the representation of
complex geometries, and to maintain high continuity on general domains special
constructions on multi-patch geometries must be used. In this paper we focus on
adaptive isogeometric methods with hierarchical splines, and extend the
construction of isogeometric spline spaces on multi-patch planar domains
to the hierarchical setting. We introduce a new abstract framework for the
definition of hierarchical splines, which replaces the hypothesis of local
linear independence for the basis of each level by a weaker assumption. We also
develop a refinement algorithm that guarantees that the assumption is fulfilled
by splines on certain suitably graded hierarchical multi-patch mesh
configurations, and prove that it has linear complexity. The performance of the
adaptive method is tested by solving the Poisson and the biharmonic problems
A comparison of smooth basis constructions for isogeometric analysis
In order to perform isogeometric analysis with increased smoothness on
complex domains, trimming, variational coupling or unstructured spline methods
can be used. The latter two classes of methods require a multi-patch
segmentation of the domain, and provide continuous bases along patch
interfaces. In the context of shell modeling, variational methods are widely
used, whereas the application of unstructured spline methods on shell problems
is rather scarce. In this paper, we therefore provide a qualitative and a
quantitative comparison of a selection of unstructured spline constructions, in
particular the D-Patch, Almost-, Analysis-Suitable and the
Approximate constructions. Using this comparison, we aim to provide
insight into the selection of methods for practical problems, as well as
directions for future research. In the qualitative comparison, the properties
of each method are evaluated and compared. In the quantitative comparison, a
selection of numerical examples is used to highlight different advantages and
disadvantages of each method. In the latter, comparison with weak coupling
methods such as Nitsche's method or penalty methods is made as well. In brief,
it is concluded that the Approximate and Analysis-Suitable converge
optimally in the analysis of a bi-harmonic problem, without the need of special
refinement procedures. Furthermore, these methods provide accurate stress
fields. On the other hand, the Almost- and D-Patch provide relatively easy
construction on complex geometries. The Almost- method does not have
limitations on the valence of boundary vertices, unlike the D-Patch, but is
only applicable to biquadratic local bases. Following from these conclusions,
future research directions are proposed, for example towards making the
Approximate and Analysis-Suitable applicable to more complex
geometries
A family of quadrilateral finite elements
We present a novel family of quadrilateral finite elements, which
define global spaces over a general quadrilateral mesh with vertices of
arbitrary valency. The elements extend the construction by (Brenner and Sung,
J. Sci. Comput., 2005), which is based on polynomial elements of tensor-product
degree , to all degrees . Thus, we call the family of
finite elements Brenner-Sung quadrilaterals. The proposed quadrilateral
can be seen as a special case of the Argyris isogeometric element of (Kapl,
Sangalli and Takacs, CAGD, 2019). The quadrilateral elements possess similar
degrees of freedom as the classical Argyris triangles. Just as for the Argyris
triangle, we additionally impose continuity at the vertices. In this
paper we focus on the lower degree cases, that may be desirable for their lower
computational cost and better conditioning of the basis: We consider indeed the
polynomial quadrilateral of (bi-)degree~, and the polynomial degrees
and by employing a splitting into or polynomial
pieces, respectively.
The proposed elements reproduce polynomials of total degree . We show that
the space provides optimal approximation order. Due to the interpolation
properties, the error bounds are local on each element. In addition, we
describe the construction of a simple, local basis and give for
explicit formulas for the B\'{e}zier or B-spline coefficients of the basis
functions. Numerical experiments by solving the biharmonic equation demonstrate
the potential of the proposed quadrilateral finite element for the
numerical analysis of fourth order problems, also indicating that (for )
the proposed element performs comparable or in general even better than the
Argyris triangle with respect to the number of degrees of freedom
- …