isogeometric analysis using t splines we explore t splines a generalization of nurbs enabling local refinement as a basis for isogeometric analysis we review t splines as a surface design methodology and then develop it for engineering analysis applications we test t splines on some elementary two dimensional and three dimensional fluid and structural analysis problems and attain good results in all cases we summarize the current status of t splines their limitations and future possibilities

immersed b spline i spline finite element method for geometrically complex domains a novel b spline based immersed finite element method is introduced for the computation of geometrically and topologically complex problems the geometry description and the finite element analysis rely on a block structured logically cartesian mesh which encloses the domain of interest a signed distance function is used for representing the domain on the cartesian mesh whereby the domain boundary is the zeroth level set of the signed distance function away from the domain boundaries the standard b spline basis functions are used for the finite element interpolation close to domain boundaries a new approach has been developed for modifying the b spline basis functions so that they locally interpolate the dirichlet boundary conditions the efficiency and robustness of the proposed approach is demonstrated with a number of one two and three dimensional linear boundary value problems

subdivision surfaces a new paradigm for thin shell finite element analysis we develop a new paradigm for thin shell finite element analysis based on the use of subdivision surfaces for i describing the geometry of the shell in its undeformed configuration and ii generating smooth interpolated displacement fields possessing bounded energy within the strict framework of the kirchhoff love theory of thin shells the particular subdivision strategy adopted here is loop s scheme with extensions such as required to account for creases and displacement boundary conditions the displacement fields obtained by subdivision are h2 and consequently have a finite kirchhoff love energy the resulting finite elements contain three nodes and element integrals are computed by a one point quadrature the displacement field of the shell is interpolated from nodal displacements only in particular no nodal rotations are used in the interpolation the interpolation scheme induced by subdivision is non local i e the displacement field over one element depend on the nodal displacements of the element nodes and all nodes of immediately neighbouring elements however the use of subdivision surfaces ensures that all the local displacement fields thus constructed combine conformingly to define one single limit surface numerical tests including the belytschko et al 10 obstacle course of benchmark problems demonstrate the high accuracy and optimal convergence of the method

a hierarchical approach to adaptive local refinement in isogeometric analysis abstract adaptive local refinement is one of the key issues in isogeometric analysis in this article we present an adaptive local refinement technique for isogeometric analysis based on extensions of hierarchical b splines we investigate the theoretical properties of the spline space to ensure fundamental properties like linear independence and partition of unity furthermore we use concepts well established in finite element analysis to fully integrate hierarchical spline spaces into the isogeometric setting this also allows us to access a posteriori error estimation techniques numerical results for several different examples are given and they turn out to be very promising

multigrid methods for isogeometric analysis with thb splines we propose a geometric multigrid algorithm for the solution of the linear systems which arise when using hierarchical spline spaces for isogeometric discretizations of elliptic partial differential equations in particular we focus on the use of hierarchical b spline hb and truncated hierarchical b spline thb bases to implement adaptively refined isogeometric discretizations we describe an approach for constructing the nested sequences of hierarchical spline spaces which are required for our geometric multigrid solver furthermore we give an algorithm for the computation of the so called prolongation matrices which map coarser space functions to their finer space representations for both hb and thb spline bases in several numerical experiments we study two dimensional poisson problems with singularities and employ a posteriori error estimators for the adaptive refinement of the hierarchical spline spaces using standard multigrid smoothers we observe that using thb spline bases consistently confers a dramatic advantage in terms of iteration numbers over the use of hb spline bases in particular for higher spline degrees when used as a preconditioner for conjugate gradient iteration the proposed multigrid method exhibits practical iteration numbers for two dimensional problems up to the tested case of fourth degree splines

optimal and reduced quadrature rules for tensor product and hierarchically refined splines in isogeometric analysis abstract we continue the study initiated in hughes et al 2010 in search of optimal quadrature rules for tensor product and hierarchically refined splines in isogeometric analysis these rules are optimal in the sense that there exists no other quadrature rule that can exactly integrate the elements of the given spline space with fewer quadrature points we extend the algorithm presented in hughes et al 2010 with an improved starting guess which combined with arbitrary precision arithmetic results in the practical computation of quadrature rules for univariate non uniform splines up to any precision explicit constructions are provided in sixteen digits of accuracy for some of the most commonly used uniform spline spaces defined by open knot vectors we study the efficacy of the proposed rules in the context of full and reduced quadrature applied to two and three dimensional diffusion reaction problems using tensor product and hierarchically refined splines and prove a theorem rigorously establishing the stability and accuracy of the reduced rules

a subdivision based implementation of the hierarchical b spline finite element method abstract a novel technique is presented to facilitate the implementation of hierarchical b splines and their interfacing with conventional finite element implementations the discrete interpretation of the two scale relation as common in subdivision schemes is used to establish algebraic relations between the basis functions and their coefficients on different levels of the hierarchical b spline basis the subdivision projection technique introduced allows us first to compute all element matrices and vectors using a fixed number of same level basis functions their subsequent multiplication with subdivision matrices projects them during the assembly stage to the correct levels of the hierarchical b spline basis the proposed technique is applied to convergence studies of linear and geometrically nonlinear problems in one two and three space dimensions

an isogeometric design through analysis methodology based on adaptive hierarchical refinement of nurbs immersed boundary methods and t spline cad surfaces we explore hierarchical refinement of nurbs as a basis for adaptive isogeometric and immersed boundary analysis we use the principle of b spline subdivision to derive a local refinement procedure which combines full analysis suitability of the basis with straightforward implementation in tree data structures and simple generalization to higher dimensions we test hierarchical refinement of nurbs for some elementary fluid and structural analysis problems in two and three dimensions and attain good results in all cases using the b spline version of the finite cell method we illustrate the potential of immersed boundary methods as a seamless isogeometric design through analysis procedure for complex engineering parts defined by t spline cad surfaces specifically a ship propeller and an automobile wheel we show that hierarchical refinement considerably increases the flexibility of this approach by adaptively resolving local features

reduced bezier element quadrature rules for quadratic and cubic splines in isogeometric analysis abstract we explore the use of various element based reduced quadrature strategies for bivariate and trivariate quadratic and cubic spline elements used in isogeometric analysis the rules studied encompass tensor product gauss and gauss lobatto rules and certain so called monomial rules that do no possess a tensor product structure the objective of the study is to determine quadrature strategies which enjoy the same accuracy and stability behavior as full gauss quadrature but with significantly fewer quadrature points several cases emerge that satisfy this objective and also demonstrate superior efficiency compared with standard c 0 continuous finite elements of the same order

isogeometric analysis using lr b splines abstract the recently proposed locally refined b splines denoted lr b splines by dokken et al 2013 6 may have the potential to be a framework for isogeometric analysis to enable future interoperable computer aided design and finite element analysis in this paper we propose local refinement strategies for adaptive isogeometric analysis using lr b splines and investigate its performance by doing numerical tests on well known benchmark cases the theory behind lr b spline is not presented in full details but the main conceptual ingredients are explained and illustrated by a number of examples

the role of bezier extraction in adaptive isogeometric analysis local refinement and hierarchical refinement summary we present two adaptive refinement techniques namely adaptive local refinement and adaptive hierarchical refinement for isogeometric analysis an element wise point of view is adopted exploiting bezier extraction which facilitates the implementation of adaptive refinement in isogeometric analysis locally refined t splines lr t splines and hierarchical t splines are employed for the description of the geometry as well as for the approximation of the solution space in the analysis the refinement is carried out with the aid of a subdivision operator which is computed by again exploiting the bezier extraction operator the concept and algorithm of an element based adaptive isogeometric analysis are illustrated numerical examples are given to examine the accuracy the convergence and the condition number this article is protected by copyright all rights reserved

a posteriori error estimation and adaptivity for elastoplasticity using the reciprocal theorem we present a posteriori error estimators and adaptive methods for the finite element approximation of nonlinear problems and especially elastoplasticity the main characteristic of the proposed method is the introduction of duality techniques or in other notions the reciprocal theorem for error estimation at an equilibrium point the nonlinear boundary value problem and an additional linearized dual problem are considered the loading of the dual problem is specifically designed for capturing the influence of the errors of the entire domain to the considered variable our approach leads to easy computable refinement indicators for locally or integrally defined variables for instationary problems as elastoplasticity in a first step we neglect the errors due to time discretization and evaluate the error indicators within each time step for a stationary problem the versatility of the presented framework is demonstrated with numerical examples

goal adaptive isogeometric analysis with hierarchical splines abstract in this work a method of goal adaptive isogeometric analysis is proposed we combine goal oriented error estimation and adaptivity with hierarchical b splines for local h refinement the goal oriented error estimator is computed with a p refined discrete dual space which is adaptively refined alongside the primal space this discrete dual space is proven to be a strict superset of the primal space hierarchical refinements are introduced in marked regions that are formed as the union of chosen coarse level spline supports from the primal basis we present two ways of extracting localized refinement indicators suitable for the hierarchical refinement procedure one based on a partitioning of the dual weighted residual into contributions of basis function supports and one based on the combination of element indicators within a basis function support the proposed goal oriented adaptive strategy is exemplified for the poisson problem and a free surface flow problem numerical experiments on these problems show convergence of the adaptive method with optimal rates furthermore the corresponding goal oriented error estimators are shown to be accurate with effectivity indices in the range of 0 7 1 1

an unfitted hp adaptive finite element method based on hierarchical b splines for interface problems of complex geometry generating finite element discretizations with direct interface parameterizations constitutes a considerable computational expense in case of complex interface geometries the paper at hand introduces a b spline finite element method which circumvents parameterization of interfaces and offers fast and easy meshing irrespective of the geometric complexity involved its core idea is the adaptive approximation of discontinuities by hierarchical grid refinement which adds several levels of local basis functions in the close vicinity of interfaces but unfitted to their exact location so that a simple regular grid of knot span elements can be maintained numerical experiments show that an hp refinement strategy which simultaneously increases the polynomial degree of the b spline basis and the levels of refinement around interfaces achieves exponential rates of convergence despite the presence of discontinuities it is also demonstrated that the hierarchical b spline fem can be used to transfer the recently introduced finite cell concept to geometrically nonlinear problems its computational performance imposition of unfitted boundary conditions and fast hierarchical grid generation are illustrated for a set of benchmark problems in one two and three dimensions and the advantages of the regular grid approach for complex geometries are demonstrated by the geometrically nonlinear simulation of a voxel based foam composite

imposing essential boundary conditions in mesh free methods imposing essential boundary conditions is a key issue in mesh free methods the mesh free interpolation does not verify the kronecker delta property and therefore the imposition of prescribed values is not as straightforward as for the finite element method the aim of this paper is to present a general overview on the existing techniques to enforce essential boundary conditions in galerkin based mesh free methods special attention is paid to the mesh free coupling with finite elements for the imposition of prescribed values and to methods based on a modification of the galerkin weak form particular examples are used to analyze and compare their performance in different situations

isogeometric finite element data structures based on bezier extraction of t splines we develop finite element data structures for t splines based on bezier extraction generalizing our previous work for nurbs as in traditional finite element analysis the extracted bezier elements are defined in terms of a fixed set of polynomial basis functions the so called bernstein basis the bezier elements may be processed in the same way as in a standard finite element computer program utilizing exactly the same data processing arrays in fact only the shape function subroutine needs to be modified while all other aspects of a finite element program remain the same a byproduct of the extraction process is the element extraction operator this operator localizes the topological and global smoothness information to the element level and represents a canonical treatment of t junctions referred to as hanging nodes in finite element analysis and a fundamental feature of t splines a detailed example is presented to illustrate the ideas copyright 2011 john wiley sons ltd

algebraic and numerical techniques for the computation of matrix determinants we review modify and combine together several numerical and algebraic techniques in order to compute the determinant of a matrix or the sign of such a determinant the resulting algorithms enable us to obtain the solution by using a lower precision of computations and relatively few arithmetic operations the problem has important applications to computational geometry

a collocated c0 finite element method reduced quadrature perspective cost comparison with standard finite elements and explicit structural dynamics summary we demonstrate the potential of collocation methods for efficient higher order analysis on standard nodal finite element meshes we focus on a collocation method that is variationally consistent and geometrically flexible converges optimally embraces concepts of reduced quadrature and leads to symmetric stiffness and diagonal consistent mass matrices at the same time it minimizes the evaluation cost per quadrature point thus reducing formation and assembly effort significantly with respect to standard galerkin finite element methods we provide a detailed review of all components of the technology in the context of elastodynamics that is weighted residual formulation nodal basis functions on gauss lobatto quadrature points and symmetrization by averaging with the ultra weak formulation we quantify potential gains by comparing the computational efficiency of collocated and standard finite elements in terms of basic operation counts and timings our results show that collocation is significantly less expensive for problems dominated by the formation and assembly effort such as higher order elastostatic analysis furthermore we illustrate the potential of collocation for efficient higher order explicit dynamics throughout this work we advocate a straightforward implementation based on simple modifications of standard finite element codes we also point out the close connection to spectral element methods where many of the key ideas are already established copyright 2014 john wiley sons ltd

subdivision stabilised immersed b spline finite elements for moving boundary flows an immersed finite element method is presented to compute flows with complex moving boundaries on a fixed cartesian grid the viscous incompressible fluid flow equations are discretized with b spline basis functions the two scale relation for b splines is used to implement an elegant and efficient technique to satisfy the lbb condition on non grid aligned fluid domains and at moving boundaries the boundary conditions are enforced with a consistent penalty method as originally proposed by nitsche in addition a special extrapolation technique is employed to prevent the loss of numerical stability in presence of arbitrarily small cut cells the versatility and accuracy of the proposed approach is demonstrated by means of convergence studies and comparisons with previous experimental and computational investigations

adaptive fem based nonrigid image registration using truncated hierarchical b splines we present an efficient approach of finite element method fem based nonrigid image registration in which the spatial transformation is constructed using truncated hierarchical b splines thb splines the image registration framework minimizes an energy functional using an fem based method and thus involves solving a large system of linear equations this framework is carried out on a set of successively refined grids however due to the increased number of control points during subdivision large linear systems are generated which are generally demanding to solve instead of using uniform subdivision an adaptive local refinement scheme is carried out only refining the areas of large change in deformation of the image by incorporating the key advantages of thb spline basis functions such as linear independence partition of unity and reduced overlap into the fem based framework we improve the matrix sparsity and computational efficiency the performance of the proposed method is demonstrated on 2d synthetic and medical images

a fictitious domain distributed lagrange multiplier based fluid structure interaction scheme with hierarchical b spline grids abstract we present a numerical scheme for fluid structure interaction based on hierarchical b spline grids and fictitious domain distributed lagrange multipliers the incompressible navier stokes equations are solved over a cartesian grid discretised with b splines the fluid grid near the immersed solids is refined locally using hierarchical b splines the immersed solid is modelled as geometrically exact beam discretised with standard linear lagrange shape functions the kinematic constraint at the fluid solid interface is enforced with distributed lagrange multipliers the unconditionally stable and second order accurate generalised method is used for integration in time for both the fluid and solid domains a fully implicit and fully coupled solution scheme is developed by using the newton raphson method to solve the non linear system of equations obtained with galerkin weak formulation first the spatial and temporal convergence of the proposed scheme is assessed by studying steady and unsteady flow past a fixed cylinder then the scheme is applied to several benchmark problems to demonstrate the efficiency and robustness of the proposed scheme the results obtained with the present scheme are compared with the reference values

on error estimates and adaptivity in elastoplastic solids applications to the numerical simulation of strain localization in classical and cosserat continua the a posteriori error estimates based on the post processing approach are introduced for elastoplastic solids the standard energy norm error estimate established for linear elliptic problems is generalized here to account for the presence of internal variables through the norm associated with the complementary free energy this is known to represent a natural metric for the class of elastoplastic problems of evolution in addition the intrinsic dissipation functional is utilized as a basis for a complementary a posteriori error estimates a posteriori error estimates and adaptive refinement techniques are applied to the finite element analysis of a strain localization problem as a model problem the constitutive equations describing a generalization of standard j2 elastoplasticity within the cosserat continuum are used to overcome serious limitations exhibited by classical continuum models in the post instability region the proposed a posteriori error estimates are appropriately modified to account for the cosserat continuum model and linked with adaptive techniques in order to simulate strain localization problems superior behaviour of the cosserat continuum model in comparison to the classical continuum model is demonstrated through the finite element simulation of the localization in a plane strain tensile test for an elastopiastic softening material resulting in convergent solutions with an h refinement and almost uniform error distribution in all considered error norms

a local solution approach for adaptive hierarchical refinement in isogeometric analysis abstract adaptively refining the state variables and fast solving the equations are two key issues in isogeometric analysis currently existing research more focuses on the first issue while the efficiency issue is not elaborated when the overall equations are solved at each refinement step this article develops an approach to promote the efficiency by locally solving the equations that govern the refined variables at each refinement step here hierarchical refinement of the state variables in nurbs is adopted and transformational matrix that transforms the basis functions from the current level to the refined level is utilized to handle the relations between the equations at different levels by dividing the coefficient matrix into blocks and estimating the error of state variables for different blocks we represent the global solution method in a hierarchical structure and separately construct and solve equations to obtain the solution for each level in the structure we validate the proposed method by some steady heat transfer and structural analysis problems in domains with different dimensionality we have compared the numerical result accuracy as well as the time cost of the proposed method with those of current available refinement approaches and it turns out to be very promising

adaptive finite element methods in computational mechanics we present a general approach to adaptivity for finite element methods and give applications to linear elasticity non linear elasto plasticity and nonlinear conservation laws including numerical results

nonlinear dispersive mechanism of the freak wave formation in shallow water abstract the mechanism of the freak wave formation related to the spatial temporal focusing is studied within the framework of the korteweg de vries equation a method to find the wave trains whose evolution leads to the freak wave formation is proposed it is based on the solution of the korteweg de vries equation with an initial condition corresponding to the expected freak wave all solutions of this cauchy problem by the reversal of abscissa represent the possible forms of wave trains which evolve into the freak wave it is found that freak waves are almost linear waves and their characteristic ursell parameter is small the freak wave formation is possible also from the random wave field and the numerical simulation describes the details of this phenomenon it is shown that freak waves can be generated not only for specific conditions but also for relative wide classes of the wave trains this mechanism explains the rare and short lived character of the freak wave

divergence conforming discretization for stokes problem on locally refined meshes using lr b splines abstract to solve the incompressible flow problems using isogeometric analysis the div compatible spline spaces were originally introduced by buffa et al 2011 and later developed by evans 2011 in this paper we extend the div compatible spline spaces with local refinement capability using locally refined lr b splines over rectangular domains we argue that the spline spaces generated on locally refined meshes will satisfy compatibility provided they span the entire function spaces as governed by mourrain 2014 dimension formula we will in this work use the structured refined lr b splines as introduced by johannessen et al 2014 further we consider these div compatible lr b spline spaces to approximate the velocity and pressure fields in mixed discretization for stokes problem and a set of standard benchmark tests are performed to show the stability efficiency and the conservation properties of the discrete velocity fields in adaptive isogeometric analysis

efficient quadrature for nurbs based isogeometric analysis abstract we initiate the study of efficient quadrature rules for nurbs based isogeometric analysis a rule of thumb emerges the half point rule indicating that optimal rules involve a number of points roughly equal to half the number of degrees of freedom or equivalently half the number of basis functions of the space under consideration the half point rule is independent of the polynomial order of the basis efficient rules require taking into account the precise smoothness of basis functions across element boundaries several rules of practical interest are obtained and a numerical procedure for determining efficient rules is presented we compare the cost of quadrature for typical situations arising in structural mechanics and fluid dynamics the new rules represent improvements over those used previously in isogeometric analysis

subdivision shells with exact boundary control and non manifold geometry we introduce several new extensions to subdivision shells that provide an improved level of shape control over shell boundaries and facilitate the analysis of shells with non smooth and non manifold joints to this end extended subdivision schemes are used that enable to relax the continuity of the limit surface along prescribed crease edges and to create surfaces with prescribed limit positions and normals furthermore shells with boundaries in the form of conic sections such as circles or parabolas are represented with rational subdivision schemes which are defined in analogy to rational b splines in terms of implementation the difference between the introduced and conventional subdivision schemes is restricted to the use of modified subdivision stencils close to the mentioned geometric features hence the resulting subdivision surface is in most parts of the domain identical to standard smooth subdivision surfaces the particular subdivision scheme used in this paper constitutes an improved version of the original loop s scheme and is as such based on triangular meshes as in the original subdivision shells surfaces created with the modified scheme are used for interpolating the reference and deformed shell configurations at the integration points the subdivision surface is evaluated using a newly developed discrete parameterization approach in the resulting finite elements the only degrees of freedom are the mid surface displacements of the nodes and additional lagrange parameters for enforcing normal constraints the versatility of the newly developed elements is demonstrated with a number of geometrically nonlinear shell examples copyright 2011 john wiley sons ltd

fundamental aspects of shape optimization in the context of isogeometric analysis we develop a mathematical foundation for shape optimization problems under state equation constraints where both state and control are discretized by b splines or nurbs in other words we use isogeometric analysis iga for solving the partial differential equation and a nodal approach to change domains where control points take the place of nodes and where thus a quite general class of functions for representing optimal shapes and their boundaries becomes available the minimization problem is solved by a gradient descent method where the shape gradient will be defined in isogeometric terms this gradient is obtained following two schemes optimize first discretize then and reversely discretize first optimize then we show that for isogeometric analysis the two schemes yield the same discrete system moreover we also formulate shape optimization with respect to nurbs in the optimize first ansatz which amounts to finding optimal control points and weights simultaneously numerical tests illustrate the theory

isogeometric collocation cost comparison with galerkin methods and extension to adaptive hierarchical nurbs discretizations abstract we compare isogeometric collocation with isogeometric galerkin and standard c 0 finite element methods with respect to the cost of forming the matrix and residual vector the cost of direct and iterative solvers the accuracy versus degrees of freedom and the accuracy versus computing time on this basis we show that isogeometric collocation has the potential to increase the computational efficiency of isogeometric analysis and to outperform both isogeometric galerkin and standard c 0 finite element methods when a specified level of accuracy is to be achieved with minimum computational cost we then explore an adaptive isogeometric collocation method that is based on local hierarchical refinement of nurbs basis functions and collocation points derived from the corresponding multi level greville abscissae we introduce the concept of weighted collocation that can be consistently developed from the weighted residual form and the two scale relation of b splines using weighted collocation in the transition regions between hierarchical levels we are able to reliably handle coincident collocation points that naturally occur for multi level greville abscissae the resulting method combines the favorable properties of isogeometric collocation and hierarchical refinement in terms of computational efficiency local adaptivity robustness and straightforward implementation which we illustrate by numerical examples in one two and three dimensions

imposing dirichlet boundary conditions with nitsche s method and spline based finite elements a key challenge while employing non interpolatory basis functions in finite element methods is the robust imposition of dirichlet boundary conditions the current work studies the weak enforcement of such conditions for b spline basis functions with application to both second and fourth order problems this is achieved using concepts borrowed from nitsche s method which is a stabilized method for imposing constraints on surfaces conditions for the stability of the system of equations are derived for each class of problem stability parameters in the nitsche weak form are then evaluated by solving a local generalized eigenvalue problem at the dirichlet boundary the approach is designed to work equally well when the grid used to build the splines conforms to the physical boundary of interest as well as to the more general case when it does not through several numerical examples the approach is shown to yield optimal rates of convergence copyright 2010 john wiley sons ltd

bezier extraction and adaptive refinement of truncated hierarchical nurbs abstract this contribution presents bezier extraction of truncated hierarchical b splines and the application of the approach to adaptive isogeometric analysis the developed procedures allow for the implementation of hierarchical b splines and nurbs without the need for an explicit truncation of the basis moreover standard procedures of adaptive finite element analysis for error estimation and marking of elements are directly applicable due to the strict use of an element viewpoint starting from a multi level nested mesh that results from uniform h refinement standard bezier extraction is applied to active elements that contribute to the hierarchical approximation this results in a multi level system of equations without communication between individual hierarchy levels a hierarchical subdivision operator is developed to recover this communication by transforming the multi level system of equations into a hierarchical system of equations it is demonstrated that this approach implicitly defines the truncated hierarchical basis in terms of a simple matrix multiplication in this way the implementation effort is reduced to a minimum as shape function routines and bezier extraction procedures remain unchanged compared to standard isogeometric analysis the convergence and the computational efficiency of the approach are examined in three different demonstration problems of heat conduction linear elasticity and the phase field modelling of brittle fracture