NANANov 21, 2017

Scaled Boundary Parametrizations in Isogeometric Analysis

arXiv:1711.0576029 citationsh-index: 26
Originality Synthesis-oriented
AI Analysis

For researchers in isogeometric analysis, this work provides a systematic treatment of scaled boundary parametrizations, but it is an incremental extension of existing methods.

This paper develops a general framework for scaled boundary parametrizations in Isogeometric Analysis (IGA), enabling direct use in standard Galerkin-based IGA. It demonstrates the approach on a planar rotor geometry from a screw compressor, showing improved parametrization strategies.

This paper deals with a special class of parametrizations for Isogeometric Analysis (IGA). The so-called scaled boundary parametrizations are easy to construct and particularly attractive if only a boundary description of the computational domain is available. The idea goes back to the Scaled Boundary Finite Element Method (SB-FEM), which has recently been extended to IGA. We take here a different viewpoint and study these parametrizations as bivariate or trivariate B-spline functions that are directly suitable for standard Galerkin-based IGA. Our main results are first a general framework for this class of parametrizations, including aspects such as smoothness and regularity as well as generalizations to domains that are not star-shaped. Second, using the Poisson equation as example, we explain the relation between standard Galerkin-based IGA and the Scaled Boundary IGA by means of the Laplace-Beltrami operator. Further results concern the separation of integrals in both approaches and an analysis of the singularity in the scaling center. Among the computational examples we present a planar rotor geometry that stems from a screw compressor machine and compare different parametrization strategies.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes