enhancing statistical moment calculations for stochastic galerkin solutions with monte carlo techniques abstract in this work we provide a method for enhancing stochastic galerkin moment calculations to the linear elliptic equation with random diffusivity using an ensemble of monte carlo solutions this hybrid approach combines the accuracy of low order stochastic galerkin and the computational efficiency of monte carlo methods to provide statistical moment estimates which are significantly more accurate than performing each method individually the hybrid approach involves computing a low order stochastic galerkin solution after which monte carlo techniques are used to estimate the residual we show that the combined stochastic galerkin solution and residual is superior in both time and accuracy for a one dimensional test problem and a more computational intensive two dimensional linear elliptic problem for both the mean and variance quantities

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

implicit dynamic analysis using an isogeometric reissner mindlin shell formulation summary in isogeometric analysis identical basis functions are used for geometrical representation and analysis in this work non uniform rational basis splines basis functions are applied in an isoparametric approach an isogeometric reissner mindlin shell formulation for implicit dynamic calculations using the galerkin method is presented a consistent as well as a lumped matrix formulation is implemented the suitability of the developed shell formulation for natural frequency analysis is demonstrated by a numerical example in a second set of examples transient problems of plane and curved geometries undergoing large deformations in combination with nonlinear material behavior are investigated via a zero thickness stress algorithm for arbitrary material models a j2 plasticity constitutive law is implemented in the numerical examples the effectiveness robustness and superior accuracy of a continuous interpolation method of the shell director vector is compared with experimental results and alternative numerical approaches copyright 2016 john wiley sons ltd

locking free isogeometric collocation methods for spatial timoshenko rods in this work we present the application of isogeometric collocation techniques to the solution of spatial timoshenko rods the strong form equations of the problem are presented in both displacement based and mixed formulations and are discretized via nurbs based isogeometric collocation several numerical experiments are reported to test the accuracy and efficiency of the considered methods as well as their applicability to problems of practical interest in particular it is shown that mixed collocation schemes are locking free independently of the choice of the polynomial degrees for the unknown fields such an important property is also analytically proven

an isogeometric collocation approach for bernoulli euler beams and kirchhoff plates abstract in this paper iga collocation methods are for the first time introduced for the solution of thin structural problems described by the bernoulli euler beam and kirchhoff plate models in particular a precise description of the proposed methods of the relevant implementation details and of the strategy to efficiently deal with different combinations of boundary conditions is given finally several numerical experiments confirm that the proposed formulations represent an efficient and geometrically flexible tool for the simulation of thin structures

on the use of nurbs based discretizations in the scaled boundary finite element method for wave propagation problems abstract we discuss the application of non uniform rational b splines nurbs in the scaled boundary finite element method sbfem for the solution of wave propagation problems at rather high frequencies we focus on the propagation of guided waves along prismatic structures of constant cross section comparisons are made between nurbs based discretizations and high order spectral elements in terms of the achievable convergence rates we find that for the same order of shape functions nurbs can lead to significantly smaller errors compared with lagrange polynomials the difference becomes particularly important at very high frequencies where spectral elements are prone to instabilities furthermore we analyze the behavior of nurbs for the discretization of curved boundaries where the benefit of exact geometry representation becomes crucial even in the low frequency range

on a splitting type algorithm for the numerical realization of contact problems with coulomb friction this paper presents and analyses an iterative process for the numerical realization of contact problems with coulomb friction which is based on the method of successive approximations combined with a splitting type approach numerical examples illustrate the efficiency of this method

rotation free isogeometric thin shell analysis using pht splines this paper presents a novel approach for isogeometric analysis of thin shells using polynomial splines over hierarchical t meshes pht splines the method exploits the flexibility of t meshes for local refinement the main advantage of the pht splines in the context of thin shell theory is that it achieves c1 continuity so the kirchhoff love theory can be used in pristine form no rotational degrees of freedom are needed numerical results show the excellent performance of the present method

a quadrilateral g1 conforming finite element for the kirchhoff plate model abstract a quadrilateral bi cubic g 1 conforming finite element for the analysis of kirchhoff plates is presented the rational version of the gregory patch proposed by loop et al 2009 is the starting point of our formulation this version of the gregory patch consists in rational enhancement of the bi cubic bezier interpolation representing a suitable tool for designing g 1 conforming quadrilateral element on c 0 conforming un structured meshes the element includes as additional degrees of freedom the edge rotations like in the loof formulations but is only displacement based because of the presence of the rational functions the second derivatives of the interpolation present a finite discontinuity at the corners of the element that prevent the element from passing the bending patch test the element so formulated does not present optimal rate of convergence under h refinement operation the formulation is enhanced enforcing these discontinuities to be zero by means of lagrange multipliers it is shown that with these constraints the element passes the patch test and presents optimal rate of convergence for unstructured mesh in this way the rational conforming approximation collapses into a conforming re arrangement of the complete bi cubic bezier interpolation some examples and benchmarks are presented in order to test the performance of the element for the kirchhoff plate model

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 method of finite element tearing and interconnecting and its parallel solution algorithm a novel domain decomposition approach for the parallel finite element solution of equilibrium equations is presented the spatial domain is partitioned into a set of totally disconnected subdomains each assigned to an individual processor lagrange multipliers are introduced to enforce compatibility at the interface nodes in the static case each floating subdomain induces a local singularity that is resolved in two phases first the rigid body modes are eliminated in parallel from each local problem and a direct scheme is applied concurrently to all subdomains in order to recover each partial local solution next the contributions of these modes are related to the lagrange multipliers through an orthogonality condition a parallel conjugate projected gradient algorithm is developed for the solution of the coupled system of local rigid modes components and lagrange multipliers which completes the solution of the problem when implemented on local memory multiprocessors this proposed method of tearing and interconnecting requires less interprocessor communications than the classical method of substructuring it is also suitable for parallel vector computers with shared memory moreover unlike parallel direct solvers it exhibits a degree of parallelism that is not limited by the bandwidth of the finite element system of equations

discontinuous galerkin isogeometric analysis of elliptic problems on segmentations with non matching interfaces abstract in this paper we develop a discontinuous galerkin isogeometric analysis method for solving elliptic problems on decompositions of the computational domain into volumetric patches with non matching parametrized interfaces we specially focus on high order numerical solutions for complex gap regions and extend ideas from our previous work on simple gap regions for the communication of the numerical solution between the subdomains which are separated by the gap region discontinuous galerkin numerical fluxes are constructed taking into account the diametrically opposite points on the boundary of the gap due to lack of information on the behavior of the solution in the gap region the fluxes coming from the interior of the gap are approximated by taylor expansions with respect to the adjacent subdomain solutions we follow the same ideas of our previous work and show a priori error estimates in the dg norm with respect to the mesh size and the gap distance numerical examples performed for two three and even four dimensional computational domains demonstrate the robustness of the proposed numerical method and validate the estimates predicted by the theory

robust multivariate scattering hurwitz interval polynomials abstract the relationship between multivariate scattering hurwitz polynomials and multivariate complex reactance functions is exploited to prove that a specified set of bivariate interval polynomials is characterizable by the scattering hurwitz property from tests on a finite set of extreme bivariate polynomials specifically it is shown that the cardinality of this finite set when the coefficients are restricted to the field of real numbers is 8 this bivariate result is expected to be generalizable to the n variate case for both the real and the complex coefficient cases if one proceeds with adequate caution

a nurbs based hybrid collocation galerkin method for the analysis of boundary represented solids abstract the paper is concerned with a new numerical method nurbs based hybrid collocation galerkin method nurbs hcgm to solve the in plane motion problem of elastic solids it combines the merits of the so called scaled boundary finite element method sb fem and the isogeometric collocation method for the analysis the boundary scaling technique of sb fem is adopted it leads to a formulation where only the boundary of a structure is discretized here the nurbs basis functions are employed for the description of the geometry of the boundary as well as for the approximation of the displacements at the boundary this is in accordance with the boundary representation modeling technique which is commonly employed in computer aided design software the inner domain is described by a radial scaling parameter applying the weak form only in circumferential direction the governing partial differential equations of elasticity are transformed to an ordinary differential equation ode of euler type where the unknown displacements are a function of the radial scaling parameter in the present work a nurbs based collocation scheme is introduced to solve this equation nurbs basis functions are suggested for the approximation of the displacements in scaling direction the higher continuity provided by nurbs allows to use collocation to solve the ode directly instead of using the weak form in scaling direction the proposed approach is validated by comparison with the eigenvalue solution of the ode it is remarked that the eigenvalue solution is restricted to linear problems whereas the proposed method could be extended to nonlinear problems in general the presented formulation will allow to model patches bounded by an arbitrary number of contour boundaries the accuracy of the proposed approach is analyzed and estimated with respect to analytical solutions the computational cost is investigated with the help of numerical examples and is compared to isogeometric galerkin approach

isogeometric kirchhoff love shell formulations for general hyperelastic materials abstract we present formulations for compressible and incompressible hyperelastic thin shells which can use general 3d constitutive models the necessary plane stress condition is enforced analytically for incompressible materials and iteratively for compressible materials the thickness stretch is statically condensed and the shell kinematics are completely described by the first and second fundamental forms of the midsurface we use c 1 continuous isogeometric discretizations to build the numerical models numerical tests including structural dynamics simulations of a bioprosthetic heart valve show the good performance and applicability of the presented methods

isogeometric collocation for elastostatics and explicit dynamics we extend the development of collocation methods within the framework of isogeometric analysis iga to multi patch nurbs configurations various boundary and patch interface conditions and explicit dynamic analysis the methods developed are higher order accurate stable with no hourglass modes and efficient in that they require a minimum number of quadrature evaluations the combination of these attributes has not been obtained previously within standard finite element analysis

isogeometric collocation neumann boundary conditions and contact abstract isogeometric collocation methods have been proposed recently and their accuracy and efficiency demonstrated for elastostatics and explicit dynamics this paper addresses two important aspects in the development of the isogeometric collocation technology namely the imposition of neumann boundary conditions and the enforcement of contact constraints which are both treated within the same framework it is shown that the strong imposition of neumann boundary conditions may lead to a significant loss of accuracy in some situations in particular when non uniform meshes are used two possible remedies are proposed to restore the desired level of accuracy while keeping the computational cost virtually unchanged i e a hybrid collocation galerkin approach and an enhanced collocation ec approach a frictionless contact formulation suitable for the collocation framework is further proposed and shown to pass the contact patch test to machine precision when combined with the ec approach the formulation is shown to deliver accurate results and to perform robustly also for highly non uniform meshes for all the collocation formulations contact pressures are greater than or equal to zero pointwise in contrast with standard lagrange finite elements

edge property from end points for scattering hurwitz polynomials the counterparts of recent results on growth conditions and convex directions for univariate polynomials and quasipolynomials are obtained for multivariate polynomials with respect to the scattering hurwitz property the technical devices employed to develop the machineries leading to the main result are the bijective relationship between multivariate scattering hurwitz polynomials and multivariate reactance functions and a certain representation of such functions

an unfitted finite element method based on nitsche s method for elliptic interface problems in this paper we propose a method for the finite element solution of elliptic interface problem using an approach due to nitsche the method allows for discontinuities internal to the elements in the approximation across the interface we show that optimal order of convergence holds without restrictions on the location of the interface relative to the mesh further we derive a posteriori error estimates for the purpose of controlling functionals of the error and present some numerical examples

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

isogeometric collocation methods for the reissner mindlin plate problem abstract within the general framework of isogeometric methods collocation schemes have been recently proposed as a viable and promising low cost alternative to standard isogeometric galerkin approaches in this paper isogeometric collocation methods for the numerical approximation of reissner mindlin plate problems are proposed for the first time locking free primal and mixed formulations are herein considered and the potential of isogeometric collocation as a geometrically flexible and computationally efficient simulation tool for shear deformable plates is shown through the solution of several numerical tests

skew symmetric nitsche s formulation in isogeometric analysis dirichlet and symmetry conditions patch coupling and frictionless contact abstract a simple skew symmetric nitsche s formulation is introduced into the framework of isogeometric analysis iga to deal with various problems in small strain elasticity essential boundary conditions symmetry conditions for kirchhoff plates patch coupling in statics and in modal analysis as well as signorini contact conditions for linear boundary or interface conditions the skew symmetric formulation is parameter free for contact conditions it remains stable and accurate for a wide range of the stabilization parameter several numerical tests are performed to illustrate its accuracy stability and convergence performance we investigate particularly the effects introduced by nitsche s coupling including the convergence performance and condition numbers in statics as well as the extra outlier frequencies and corresponding eigenmodes in structural dynamics we present the hertz test the block test and a 3d self contact example showing that the skew symmetric nitsche s formulation is a suitable approach to simulate contact problems in iga

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

universal knowledge seeking agents reinforcement learning rl agents like email protected s universal pareto optimal incomputable aixi heavily rely on the definition of the rewards which are necessarily given by some teacher to define the tasks to solve therefore as is aixi cannot be said to be a fully autonomous agent from the point of view of artificial general intelligence agi this can be argued to be an incomplete definition of a generally intelligent agent furthermore it has recently been shown that aixi can converge to a suboptimal behavior in certain situations hence showing the intrinsic difficulty of rl with its non obvious pitfalls we propose a new model of intelligence the knowledge seeking agent ksa halfway between solomonoff induction and aixi that defines a completely autonomous agent that does not require a teacher the goal of this agent is not to maximize arbitrary rewards but to entirely explore its world in an optimal way a proof of strong asymptotic optimality for a class of horizon functions shows that this agent behaves according to expectation some implications of such an unusual agent are proposed

hierarchical nurbs in frictionless contact abstract this work investigates mortar based frictionless contact in the context of nurbs discretizations that are subjected to local hierarchical refinement the investigations emphasize three sets of choices which lead to different contact algorithms that have distinct advantages and disadvantages first on the optimization side both exterior and interior point methods are applied thus spanning inexact constraint enforcement algorithms of the penalty or barrier type as well as exact ones of the primal dual type second on the discretization side the hierarchical basis set of the mortar variables is inherited either directly from the discretization of the slave surface or after an intermediate normalization step to satisfy the partition of unity third in interaction with both optimization and discretization the kinematic mortar variable is recovered from the actual normal gap through the full or lumped solution of a linear system of equations the implications of different choices are highlighted through benchmark problems which monitor the solution quality at the global level through the structural force evolution and at the local level through the contact pressure distribution

isogeometric mortar methods the application of mortar methods in the framework of isogeometric analysis is investigated theoretically as well as numerically for the lagrange multiplier two choices of uniformly stable spaces are presented both of them are spline spaces but of a different degree in one case we consider an equal order pairing for which a cross point modification based on a local degree reduction is required in the other case the degree of the dual space is reduced by two compared to the primal this pairing is proven to be inf sup stable without any necessary cross point modification several numerical examples confirm the theoretical results and illustrate additional aspects

isogeometric analysis and domain decomposition methods in the present work we use the mortar finite element method for the coupling of nonconforming discretized sub domains in the framework of nonlinear elasticity the mortar method has been shown to preserve optimal convergence rates see laursen 2002 25 for details and is variationally consistent we show that the method can be applied to isogeometric analysis with little effort once the framework of nurbs based shape functions has been implemented furthermore a specific coordinate augmentation technique allows the design of an energy momentum scheme for the constrained mechanical system under consideration the excellent performance of the redesigned mortar method as well as the energy momentum scheme is illustrated in representative numerical examples

a natural framework for isogeometric fluid structure interaction based on bem shell coupling abstract the interaction between thin structures and incompressible newtonian fluids is ubiquitous both in nature and in industrial applications in this paper we present an isogeometric formulation of such problems which exploits a boundary integral formulation of stokes equations to model the surrounding flow and a non linear kirchhoff love shell theory to model the elastic behavior of the structure we propose three different coupling strategies a monolithic fully implicit coupling a staggered elasticity driven coupling and a novel semi implicit coupling where the effect of the surrounding flow is incorporated in the non linear terms of the solid solver through its damping characteristics the novel semi implicit approach is then used to demonstrate the power and robustness of our method which fits ideally in the isogeometric paradigm by exploiting only the boundary representation b rep of the thin structure middle surface

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

two new triangular g1 conforming finite elements with cubic edge rotation for the analysis of kirchhoff plates abstract two triangular g 1 conforming elements based on the triangular gregory patch suitable for the analysis of the kirchhoff plate model are presented both have cubic normal derivative along the sides so that they can be effectively used in combination with generalized hermitian elements the gregory patch consists in a rational enhancement of the base polynomial spaces useful to design g 1 conforming elements on general c 0 conforming unstructured meshes because of the presence of the rational functions the second derivatives at the corners of the element present finite discontinuities that prevent the elements from passing the bending patch test the discontinuities are removed using a constrained version of the gregory patch with lagrange multipliers in this way the rational conforming space collapses into a conforming rearrangement of the original polynomial interpolant spaces the proposed formulation design elements that pass the bending patch test and present optimal rate of convergence on general unstructured meshes

on methods for stabilizing constraints over enriched interfaces in elasticity summary enriched finite element approaches such as the extended finite element method provide a framework for constructing approximations to solutions of non smooth problems internal features such as boundaries are represented in such methods by using discontinuous enrichment of the standard finite element basis within such frameworks however imposition of interface constraints and or constitutive relations can cause unexpected difficulties depending upon how relevant fields are interpolated on un gridded interfaces this work address the stabilized treatment of constraints in an enriched finite element context both the lagrange multiplier and penalty enforcement of tied constraints for an arbitrary boundary represented in an enriched finite element context can lead to instabilities and artificial oscillations in the traction fields we demonstrate two alternative variational methods that can be used to enforce the constraints in a stable manner in a bubble stabilized approach fine scale degrees of freedom are added over elements supporting the interface the variational form can be shown to have a similar form to a second approach we consider nitsche s method with the exception that the stabilization terms follow directly from the bubble functions in this work we examine alternative variational methods for enforcing a tied constraint on an enriched interface in the context of two dimensional elasticity we examine several benchmark problems in elasticity and show that only nitsche s method and the bubble stabilization approach produce stable traction fields over internal boundaries we also demonstrate a novel difference between the penalty method and nitsche s method in that the latter passes the patch test exactly regardless of the stabilization parameter s magnitude results for more complicated geometries and triple interface junctions are also presented copyright 2008 john wiley sons ltd

coupling adaptively refined multi patch spline discretizations via boundary compatibility abstract the present paper studies adaptive refinement on multi patch domains in isogeometric analysis in particular we investigate the gluing construction for adaptively refined spline spaces to obtain discretizations that are c 0 smooth across interfaces we will see that this is closely related to the concept of boundary compatibility of an adaptive spline construction given a spline basis or more generally a generating system if linear independence is not guaranteed on a d dimensional box domain there are two possibilities for constructing the spline basis on the domain boundary firstly one can simply restrict the basis functions to the boundary secondly one may restrict the underlying mesh to the boundary and construct the spline basis on the resulting mesh the two constructions do not necessarily produce the same set of functions if they do then the spline bases are said to be compatible we study this property for hierarchical hb and truncated hierarchical b splines thb splines and identify sufficient conditions these conditions are weaker for thb than for hb splines finally we demonstrate the importance of boundary compatibility for geometric modeling and for adaptive refinement in isogeometric analysis in particular when considering multi patch domains

local enrichment of nurbs patches using a non intrusive coupling strategy geometric details local refinement inclusion fracture in this work we apply a non intrusive global local coupling strategy for the modelling of local phenomena in a nurbs patch the idea is to consider the nurbs patch to be enriched as the global model this results in a simple flexible strategy first the global nurbs patch remains unchanged which completely eliminates the need for costly re parametrization procedures even if the local domain is expected to evolve then easy merging of a linear nurbs code with any other existing robust codes suitable for the modelling of complex local behaviour is possible the price to pay is the number of iterations of the non intrusive solver but we show that this can be strongly reduced by means of acceleration techniques the main development for nurbs is to be able to handle non conforming geometries only slight changes in the implementation process including the setting up of suitable quadrature rules for the evaluation of the interface reaction forces are made in response to this issue a range of numerical examples in two dimensional linear elasticity are given to demonstrate the performance of the proposed methodology and its significant potential to treat any case of local enrichment in a nurbs patch simply

isogeometric analysis of large deformation thin shells using rht splines for multiple patch coupling we present an isogeometric thin shell formulation for multi patches based on rational splines over hierarchical t meshes rht splines nitsche s method is employed to efficiently couple the patches the rht splines have the advantages of allowing a computationally feasible local refinement are free from linear dependence possess high order continuity and satisfy the partition of unity and non negativity in addition the c1c1 continuity of the rht splines avoids the rotational degrees of freedom the good performance of the present method is demonstrated by a number of numerical examples

isogeometric shape optimization of shells using semi analytical sensitivity analysis and sensitivity weighting abstract we present isogeometric shape optimization for shell structures applying sensitivity weighting and semi analytical analysis we use a rotation free shell formulation and all involved geometry models i e initial design analysis model optimization model and final design use the same geometric basis in particular nurbs a sensitivity weighting scheme is presented which eliminates certain effects of the chosen discretization on the design update a multilevel design approach is applied such that the design space can be chosen independently from the analysis space the use of semi analytical sensitivities allows having different polynomial degrees for design and analysis model different numerical examples are performed which confirm the applicability of the proposed method furthermore a shape optimization example with an exact solution is presented which can serve as general benchmark for shape optimization methods

biorthogonal splines for optimal weak patch coupling in isogeometric analysis with applications to finite deformation elasticity abstract a new construction of biorthogonal splines for isogeometric mortar methods is proposed the biorthogonal basis has a local support and at the same time optimal approximation properties which yield optimal results with mortar methods we first present the univariate construction which has an inherent crosspoint modification the multivariate construction is then based on a tensor product for weighted integrals whereby the important properties are inherited from the univariate case numerical results including large deformations confirm the optimality of the newly constructed biorthogonal basis

a nitsche type formulation and comparison of the most common domain decomposition methods in isogeometric analysis this paper provides a detailed elaboration and assessment of the most common domain decomposition methods for their application in isogeometric analysis the methods comprise a penalty approach lagrange multiplier methods and a nitsche type method for the nitsche method a new stabilized formulation is developed in the context of isogeometric analysis to guarantee coercivity all these methods are investigated on problems of linear elasticity and eigenfrequency analysis in 2d in particular focus is put on non uniform rational b spline patches which join nonconformingly along their common interface thus the application of isogeometric analysis is extended to multi patches which can have an arbitrary parametrization on the adjacent edges moreover it has been shown that the unique properties provided by isogeometric analysis that is high order functions and smoothness across the element boundaries carry over for the analysis of multiple domains copyright 2013 john wiley sons ltd

the scaled boundary finite element method analytical solution in frequency domain the scaled boundary finite element equation a system of ordinary differential equations in the radial coordinate is solved analytically applying a series expansion an eigenvalue problem of a hamiltonian matrix is solved when the difference of two eigenvalues is an even number besides the power series logarithmic functions occur two sets of independent solutions are obtained the scaled boundary finite element method is thus a semi analytical procedure to solve partial differential equations with the polynomial approximation of finite elements in the two circumferential directions and a closed form solution in the radial direction applications to bounded and unbounded domains demonstrate excellent accuracy

bloch theorem for isogeometric analysis of periodic problems governed by high order partial differential equations abstract with the emergence of isogeometric analysis iga numerical rotation free solutions to high order partial differential equations pdes are facilitated indeed iga allows the use of high order continuous basis functions through the domain for periodic systems the bloch theorem is useful for analyzing wave propagation restricting the analysis to a single unit cell and applying periodic boundary conditions however in the literature boundary conditions are only accounting for c 0 continuity and we propose in the present paper to enforce the g 1 continuity as well or to maintain the angle in case of unit cells meeting at kinks while g 1 continuity is enforced by maintaining the collinearity between adjacent control points in the presence of kinks variations of the field derived with respect to opposite in plane edge normals are linked by the rodrigues rotation matrix this method applied at collocation points belonging to the unit cell edges can be viewed as a novel approach of coupling multi patch geometries with kinks avoiding the use of nonlinear multipliers or additional bending strip elements both transfer matrix and indirect methods of the bloch theorem are investigated for respectively quasi one and quasi two dimensional wave propagation in periodic structures discretized by nurbs based iga dispersion curves of a set of numerical problems treating isogeometric rotation free extensible elastica beams and kirchhoff love shells are then analyzed

the tetrahedral finite cell method higher order immersogeometric analysis on adaptive non boundary fitted meshes the finite cell method fcm is an immersed domain finite element method that combines higher order non boundary fitted meshes weak enforcement of dirichlet boundary conditions and adaptive quadrature based on recursive subdivision due to its ability to improve the geometric resolution of intersected elements it can be characterized as an immersogeometric method in this paper we extend the fcm so far only used with cartesian hexahedral elements to higher order non boundary fitted tetrahedral meshes based on a reformulation of the octree based subdivision algorithm for tetrahedral elements we show that the resulting tetfcm scheme is fully accurate in an immersogeometric sense that is the solution fields achieve optimal and exponential rates of convergence for h and p refinement if the immersed geometry is resolved with sufficient accuracy tetfcm can leverage the natural ability of tetrahedral elements for local mesh refinement in three dimensions its suitability for problems with sharp gradients and highly localized features is illustrated by the immersogeometric phase field fracture analysis of a human femur bone

hybrid collocation galerkin approach for the analysis of surface represented 3d solids employing sb fem abstract this paper presents a numerical method to solve the three dimensional elasticity problem of surface represented solids a surface oriented formulation is derived in which the three dimensional solid is described by its boundary surfaces and a radial scaling center scaling the boundary surfaces with respect to the scaling center yields a parameterization of the complete solid the definition of the boundary surfaces is sufficient for the description of the solid thus the formulation conforms ideally to the boundary representation modeling technique used in cad in the present approach no tensor product structure of three dimensional objects is exploited to parameterize the physical domain the weak form of the equation of motion and the weak form of the neumann boundary conditions are enforced only at the boundary surfaces it leads to a transformation of the governing partial differential equations of elasticity to an ordinary differential equation ode of euler type solving the ode leads to the displacement in the radial scaling direction in the present approach the isogeometric galerkin finite element method is employed to describe the geometry of the boundary surfaces and also to approximate the displacement response of the boundary surfaces it exploits two dimensional nurbs objects to parameterize the boundary surfaces the final euler type ode is solved by the nurbs based collocation method the displacement response in the radial scaling direction is approximated by the nurbs basis functions hence the method can be extended to nonlinear problems the accuracy of the method is validated against analytical solutions in general the proposed formulation is able to model solids bounded by an arbitrary number of surfaces

complexity of finite horizon markov decision process problems controlled stochastic systems occur in science engineering manufacturing social sciences and many other cntexts if the systems is modeled as a markov decision process mdp and will run ad infinitum the optimal control policy can be computed in polynomial time using linear programming the problems considered here assume that the time that the process will run is finite and based on the size of the input there are mny factors that compound the complexity of computing the optimal policy for instance there are many factors that compound the complexity of this computation for instance if the controller does not have complete information about the state of the system or if the system is represented in some very succint manner the optimal policy is provably not computable in time polynomial in the size of the input we analyze the computational complexity of evaluating policies and of determining whether a sufficiently good policy exists for a mdp based on a number of confounding factors including the observability of the system state the succinctness of the representation the type of policy even the number of actions relative to the number of states in almost every case we show that the decision problem is complete for some known complexity class some of these results are familiar from work by papadimitriou and tsitsiklis and others but some such as our pl completeness proofs are surprising we include proofs of completeness for natural problems in the as yet little studied classes np pp

necessary and sufficient conditions for root clustering of a polytope of polynomials in a simply connected domain linear time invariant systems with uncertain parameters are considered a test is given which is both necessary and sufficient for root clustering of a family of polytopic polynomials in a simply connected domain the test does not require checking a continuum of polynomials special cases include stability testing of continuous time systems and of discrete time systems with uncertain parameters as well as relative stability tests of such systems interval polynomials can also be handled as a special case

isogeometric analysis enhanced by the scaled boundary finite element method abstract by leveraging the information of a typical cad model in the analysis the intensive process of discretization can be circumvented this unification has led to the isogeometric analysis iga hughes et al 2005 however as the cad model provides information only of the boundary a 2d 3d stress analysis is still one major step away in this work the concepts of isogeometric analysis and the scaled boundary finite element method sbfem are combined the sbfem requires only the boundary information and hence provides a seamless integration with the cad modeling within the proposed framework the nurbs basis functions are used to discretize the unknown fields in the circumferential direction whilst analytical solution is sought in the radial direction we further extend the framework to problems with singularities and to dynamic analysis the accuracy and the convergence properties of the proposed method are demonstrated with benchmark problems in the context of linear elasticity and linear elastic fracture mechanics

an interactive geometry modeling and parametric design platform for isogeometric analysis in this paper an interactive parametric design through analysis platform is proposed to help design engineers and analysts make more effective use of isogeometric analysis iga to improve their product design and performance we develop several rhinoceros rhino plug ins to take input design parameters through a user friendly interface generate appropriate surface and or volumetric models perform mechanical analysis and visualize the solution fields all within the same computer aided design cad program as part of this effort we propose and implement graphical generative algorithms for iga model creation and visualization based on grasshopper a visual programming interface to rhino the developed platform is demonstrated on two structural mechanics examples an actual wind turbine blade and a model of an integrally bladed rotor ibr in the latter example we demonstrate how the rhino functionality may be utilized to create conforming volumetric models for iga

isogeometric analysis with geometrically continuous functions on planar multi patch geometries abstract we generate a basis of the space of bicubic and biquartic c 1 smooth geometrically continuous isogeometric functions on bilinear multi patch domains r 2 the basis functions are obtained by suitably combining c 1 smooth geometrically continuous isogeometric functions on bilinearly parameterized two patch domains cf 18 they are described by simple explicit formulas for their spline coefficients these c 1 smooth isogeometric functions possess potential for applications in isogeometric analysis which is demonstrated by several examples such as the biharmonic equation in particular the numerical results indicate optimal approximation power

a scaled boundary isogeometric formulation for the elasto plastic analysis of solids in boundary representation abstract this contribution deals with the nonlinear analysis of boundary represented solids with elasto plastic material behavior based on the so called scaled boundary isogeometric formulation sb iga the proposed approach combines the features of the scaled boundary finite element method and isogeometric analysis based on the original boundary representation of the cad model a formulation is provided where the geometrical description of the boundary is sufficient to define the entire surface the domain is parameterized by a radial scaling parameter emanating from a scaling center and a parameter in circumferential direction along the boundary non star shaped domains are tackled by standard sub structuring here conforming discretizations are considered for the two dimensional case according to the isogeometric paradigm nurbs basis functions are employed for the approximation of the solution the displacement response is derived based on a multiplicative decomposition of the approximation in circumferential and radial scaling direction the boundary value problem is solved with the galerkin method the newton raphson iterative scheme is employed to obtain the nonlinear response several benchmark tests demonstrate the accuracy and computational efficiency of the formulation

the complexity of markov decision processes we investigate the complexity of the classical problem of optimal policy computation in markov decision processes all three variants of the problem finite horizon infinite horizon discounted and infinite horizon average cost were known to be solvable in polynomial time by dynamic programming finite horizon problems linear programming or successive approximation techniques infinite horizon we show that they are complete for p and therefore most likely cannot be solved by highly parallel algorithms we also show that in contrast the deterministic cases of all three problems can be solved very fast in parallel the version with partially observed states is shown to be pspace complete and thus even less likely to be solved in polynomial time than the np complete problems in fact we show that most likely it is not possible to have an efficient on line implementation involving polynomial time on line computations and memory of an optimal policy even if an arbitrary amount of precomputation is allowed finally the variant of the problem in which there are no observations is shown to be np complete

asymptotic non learnability of universal agents with computable horizon functions finding the universal artificial intelligent agent is the old dream of ai scientists solomonoff induction was one big step towards this giving a universal solution to the general problem of sequence prediction by defining a universal prior distribution hutter defined the aixi model which extends the latter to the reinforcement learning framework where almost all if not all ai problems can be formulated however new difficulties arise because the agent is now active whereas it is only passive in the sequence prediction case this makes proving aixi s optimality difficult in fact we prove that the current definition of aixi can sometimes be suboptimal in a certain sense but that this behavior is still the most rational one hence emphasizing the difficulty of universal reinforcement learning

space of c 2 smooth geometrically continuous isogeometric functions on two patch geometries abstract the space of c 2 smooth geometrically continuous isogeometric functions on bilinearly parameterized two patch domains is considered the investigation of the dimension of the spaces of biquintic and bisixtic c 2 smooth geometrically continuous isogeometric functions on such domains is presented in addition c 2 smooth isogeometric functions are constructed to be used for performing l 2 approximation and for solving triharmonic equation on different two patch geometries the numerical results indicate optimal approximation order

a survey of extreme point results for robustness of control systems abstract this paper surveys a subset of the body of research which was sparked by kharitonov s theorem the focal point is extreme point results for robust stability and robust performance that is we give conditions under which satisfaction of a performance specification is ascertained for a family of systems by only checking a finite subset of the extreme members of this family the results which are surveyed apply mainly to systems with structured real parametric uncertainty in addition a number of counterexamples are given to illustrate cases for which an extreme point result does not hold for such cases a solution via the so called edge theorem is often possible

reissner mindlin shell implementation and energy conserving isogeometric multi patch coupling summary a shear flexible isogeometric reissner mindlin shell formulation using non uniform rational b splines basis functions is introduced which is used for the demonstration of a coupling approach for multiple non conforming patches the six degrees of freedom formulation uses the exact surface normal vectors and curvature the shell formulation is implemented in an isogeometric analysis framework for computation of structures composed of multiple geometric entities to enable local model refinement as well as non matching domains coupling a conservative multi patch approach using lagrange multipliers for structured non uniform rational b splines patches is presented here an additional border frame mesh is used to couple geometries during structural analyses this frame interface approach avoids the problem of excessive constraints when multiple patches are coupled at one point first the shell formulation is verified with several reference cases then the influence of the frame interface discretization and frame penalty stiffness on the smoothness of the results is investigated the effects of the perturbed lagrangian method in combination with the frame interface approach is shown in addition results of models with t joint interface connections and perpendicular stiffener patches are presented copyright 2016 john wiley sons ltd

on the computability of solomonoff induction and aixi abstract how could we solve the machine learning and the artificial intelligence problem if we had infinite computation solomonoff induction and the reinforcement learning agent aixi are proposed answers to this question both are known to be incomputable we quantify this using the arithmetical hierarchy and prove upper and in most cases corresponding lower bounds for incomputability moreover we show that aixi is not limit computable thus it cannot be approximated using finite computation however there are limit computable e optimal approximations to aixi we also derive computability bounds for knowledge seeking agents and give a limit computable weakly asymptotically optimal reinforcement learning agent

necessary and sufficient conditions on negative imaginariness for interval siso transfer functions and their interconnection this article is concerned with the study of the negative imaginariness of interval transfer functions necessary and sufficient conditions for strictly negative imaginary interval transfer functions subject to parameter uncertainty are first derived based on kharitonov s theorem then certain properties of the interconnection system with negative imaginary interval transfer functions are analyzed finally an example is provided to illustrate the main results of the article

isogeometric fluid structure interaction analysis with emphasis on non matching discretizations and with application to wind turbines abstract in this paper we develop a framework for fluid structure interaction fsi modeling and simulation with emphasis on isogeometric analysis iga and non matching fluid structure interface discretizations we take the augmented lagrangian approach to fsi as a point of departure here the lagrange multiplier field is defined on the fluid structure interface and is responsible for coupling of the two subsystems thus the fsi formulation does not rely on the continuity of the underlying function spaces across the fluid structure interface in order to produce the correct coupling conditions between the fluid and structural subdomains however in deriving the final fsi formulation the interface lagrange multiplier is formally eliminated and the formulation is written purely in terms of primal variables avoiding the use of lagrange multipliers adds efficiency to the proposed formulation as an added benefit the ability to employ non matching grids for multi physics simulations leads to significantly relaxed requirements that are placed on the geometry modeling and meshing tools for iga we show an application of the proposed fsi formulation to the simulation of the nrel 5 mw offshore wind turbine rotor where the aerodynamics domain is modeled using volumetric quadratic nurbs while the rotor structure is modeled using a cubic t spline based discretization of a rotation free kirchhoff love shell we conclude the article by showing fsi coupling of a t spline shell with a low order finite element method fem discretization of the aerodynamics equations this combined use of iga and fem is felt to be a good balance between speed robustness and accuracy of fsi simulations for this class of problems

a perturbed lagrangian formulation for the finite element solution of contact problems making use of a perturbed lagrangian formulation a finite element procedure for contact problems is developed for the general case in which node to node contact no longer holds the proposed procedure leads naturally to a discretization of the contact interface into contact segments within the context of a bilinear interpolation for the displacement field a mixed finite element approximation is introduced by assuming discont naous contact pressure constant on the contact segment because of this piece wise constant approximation the gap function enters into the formulation in an average sense instead of through a point wise definition numerical examples are presented that illustrate the performance of the proposed procedure current finite element formulations for contact problems based on either the classical lagrange parameter procedure l 3 12 203 or the penalty function method 4 6 11 are characterized by a point wise enforcement of the contact constraint condition in the sense that penetration of the bodies is established on a nodal basis moreover in this methods the recovery of the contact pressure over the element from the contact nodal forces generally requires an additional procedure within the framework of classical lagrange multiplier methods the contact condition is exactly satisfied by transforming the constrained problem into an unconstrained one with the introduction of additional variables lagrange multipliers these extra variables add computational effort to the solution process which often requires special procedures to handle the presence of zero diagonal terms penalty methods on the other hand enable one to transform the constrained problem into an unconstrained one without introducing additional variables the constraint condition is now satisfied only approximately for finite values of the penalty parameter the main difhculty associated with these methods however lies in the poor conditioning of the problem as the penalty is increased to more accurately enforce the constraint condition this is a well understood phenomenon particularly in the context of the incompressible and nearly incompressible problem in solid and fluid mechanics e g see l 22 25 for a review recently augmented lagrangian procedures have been proposed as a promising way to partially overcome these difficulties and regularize the penalty formulation e g see the survey in 7 8 within the framework of zinearited e u c it is possible to restrict the finite element formulation of contact problems by assuming that node to node contact occurs this is in fact the case often considered in the literature l 2 4 6 12 20 211 in the general context of fully

a scaled boundary polygon formulation for elasto plastic analyses this study presents a novel scaled boundary polygon formulation to model elasto plastic material responses in structures the polygons have flexible mesh generation capabilities and are more accurate than standard finite elements especially for problems with cracks and notches shape functions of arbitrary n sided polygons are constructed using the scaled boundary finite element method these shape functions are conforming and linearly complete when modeling a crack strain singularities are analytically modeled without enrichment standard finite element procedures are used to formulate the stiffness matrix and residual load vector the nonlinear material constitutive matrix and the internal stresses are approximated locally in each polygon by a polynomial function the stiffness matrix and the residual load vector are matrix power integrals that can be evaluated analytically even when a strain singularity is present standard nonlinear equation solvers e g the modified newton raphson algorithm are used to obtain the nonlinear response of the structure the proposed formulation is validated using several numerical benchmarks

on the undecidability of probabilistic planning and related stochastic optimization problems automated planning the problem of how an agent achieves a goal given a repertoire of actions is one of the foundational and most widely studied problems in the ai literature the original formulation of the problem makes strong assumptions regarding the agent s knowledge and control over the world namely that its information is complete and correct and that the results of its actions are deterministic and known recent research in planning under uncertainty has endeavored te relax these assumptions providing formal and computation models wherein the agent has incomplete or noisy information about the world and has noisy sensors and effectors this research has mainly taken one of two approaches extend the classical planning paradigm to a semantics that admits uncertainty or adopt another framework for approaching the problem most commonly the markov decision process mdp model this paper presents a complexity analysis of planning under uncertainty it begins with the probabilistic classical planning problem showing that problem to be formally undecidable this fundamental result is then applied to a broad class of stochastic optimization problems in brief any problem statement where the agent a operates over an infinite or indefinite time horizon and b has available only probabilistic information about the system s state undecidability is established for policy existence problems for partially observable infinite horizon markov decision processes under discounted and undiscounted total reward models average reward models and state avoidance models the results also apply to corresponding approximation problems with undiscounted objective functions the paper answers a significant open question raised by papadimitriou and tsitsiklis math oper res 12 3 1987 441 450 about the complexity of infinite horizon pomdps

scaled boundary parametrizations in isogeometric analysis abstract 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 a generalization to domains that are not star shaped second using the poisson equation as an example we explain the relation between standard galerkin based iga and the scaled boundary iga by means of the laplace beltrami operator and derive an equivalence theorem 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 rotor geometry that stems from a screw compressor machine and compare different parametrization strategies

weak impositions of dirichlet boundary conditions in solid mechanics a critique of current approaches and extension to partially prescribed boundaries abstract in this article we first review various approaches developed to date for the weak imposition of dirichlet boundary conditions in fictitious domain analysis for elasticity problems the hellinger reissner h r principle the linked lagrange multiplier llm method the implicit boundary method and the fat boundary method are discussed along with the well known lagrange multiplier penalty and nitsche s methods we state these approaches in a common form starting with energy functionals and weak forms and discretise using the fictitious domain finite element method previous formulations of these methods were in general developed for full prescription along the dirichlet boundary which generally implies no local effect of boundary inclination however partially prescribed conditions such as the structural roller boundary condition with inclination have wide practical applications in engineering here we provide techniques of imposing such boundary conditions in these methods in detail for those methods that contain algorithmic parameters such as the penalty and nitsche s methods extra computation or empirical estimation is necessary to decide values of the parameters and hence we discuss parametric and convergence behaviours through numerical examples to provide guidance on the choice of parameters

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

a nurbs based galerkin approach for the analysis of solids in boundary representation abstract the paper is concerned with a new numerical method to solve the elasticity problem of solids in boundary representation a formulation is derived where the geometrical description of the boundary is sufficient for defining the equations of elasticity of the complete solid while the interior of the domain is described by a radial scaling parameter the scaling of the boundary with respect to the specified scaling center leads to the complete solid this idea fits perfectly to the boundary representation modeling technique commonly employed in cad in the present approach the tensor product structure of the solid will be reduced by one dimension to parametrize the physical domain i e the three dimensional solid exploits only two dimensional nurbs objects which parametrize the boundary surfaces for the analysis the weak form of the equilibrium equations is enforced for the entire solid in particular the weak form is employed in the scaling direction and the circumferential direction applying the isogeometric paradigm the nurbs functions that describe the boundary of the geometry form also the basis for the approximation of the displacement at the boundary the displacement response in the radial scaling direction on the other hand is approximated by a one dimensional nurbs overall the galerkin projection of the weak form yields a linear system of equilibrium equations whose solution gives rise to the displacement response the accuracy of the method is validated by means of analytical reference data in conclusion the proposed method allows the analysis of solids which are bounded by an arbitrary number of contour boundaries

fourth order phase field model for local max ent approximants applied to crack propagation we apply a fourth order phase field model for fracture based on local maximum entropy lme approximants the higher order continuity of the meshfree lme approximants allows to directly solve the fourth order phase field equations without splitting the fourth order differential equation into two second order differential equations we will first show that the crack surface can be captured more accurately in the fourth order model furthermore less nodes are needed for the fourth order model to resolve the crack path finally we demonstrate the performance of the proposed meshfree fourth order phase field formulation for 5 representative numerical examples computational results will be compared to analytical solutions within linear elastic fracture mechanics and experimental data for three dimensional crack propagation

dual and approximate dual basis functions for b splines and nurbs comparison and application for an efficient coupling of patches with the isogeometric mortar method abstract this contribution defines and compares different methods for the computation of dual basis functions for b splines and non uniform rational b splines nurbs they are intended to be used as test functions for the isogeometric mortar method but other fields of application are possible too three different concepts are presented and compared the first concept is the explicit formula for the computation of dual basis functions for nurbs proposed in the work of carl de boor these dual basis functions entail minimal support i e the support of the dual basis functions is equal to the support of the corresponding b spline basis functions in the second concept dual basis functions are derived from the inversion of the gram matrix these dual basis functions have global support along the interface the third concept is the use of approximate dual basis functions which were initially proposed for the use in harmonic analysis the support of these functions is local but larger than the support of the associated b spline basis functions we propose an extension of the approximate dual basis functions for nurbs basis functions after providing the general formulas we elaborate explicit expressions for several degrees of spline basis functions all three approaches are applied in the frame of the mortar method for the coupling of non conforming nurbs patches a method which allows complex discretizations with multiple intersecting interfaces is presented numerical examples show that the explicitly defined dual basis functions with minimal support severely deteriorate the global stress convergence behavior of the mechanical analysis this fact is in accordance with mathematical findings in literature which state that the optimal reproduction degree of arbitrary functions is not possible without extending the support of the dual basis functions the dual basis functions computed from the inverse of the gram matrix yield accurate numerical results but the global support yields significantly higher computational costs in comparison to computations of conforming meshes only the approximate dual basis functions yield accurate and efficient computations where neither accuracy nor efficiency is significantly deteriorated in comparison to computations of conforming meshes all basic cases of t intersections and star intersections are studied furthermore an example which combines all basic cases in a complex discretization is given the applicability of the presented method for the nonlinear case and for shell formulations is shown with the help of one numerical example

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

the scaled boundary finite element method alias consistent infinitesimal finite element cell method for elastodynamics the scaled boundary finite element method alias the consistent infinitesimal finite element cell method is developed starting from the governing equations of linear elastodynamics only the boundary of the medium is discretized with surface finite elements yielding a reduction of the spatial dimension by one no fundamental solution is necessary and thus no singular integrals must be evaluated general anisotropic material is analysed without any increase in computational effort boundary conditions on free and fixed surfaces and on interfaces between different materials are enforced exactly without any discretization this method is exact in the radial direction and converges to the exact solution in the finite element sense in the circumferential directions for a bounded medium symmetric static stiffness and mass matrices with respect to the degrees of freedom on the boundary result without any additional assumption a stress singularity is represented very accurately as the condition on the boundary in the vicinity of the point of singularity is satisfied without spatial discretization

the weak substitution method an application of the mortar method for patch coupling in nurbs based isogeometric analysis in this contribution a mortar type method for the coupling of non conforming nurbs surface patches is proposed the connection of non conforming patches with shared degrees of freedom requires mutual refinement which propagates throughout the whole patch due to the tensor product structure of nurbs surfaces thus methods to handle non conforming meshes are essential in nurbs based isogeometric analysis the main objective of this work is to provide a simple and efficient way to couple the individual patches of complex geometrical models without altering the variational formulation the deformations of the interface control points of adjacent patches are interrelated with a master slave relation this relation is established numerically using the weak form of the equality of mutual deformations along the interface with the help of this relation the interface degrees of freedom of the slave patch can be condensated out of the system a natural connection of the patches is attained without additional terms in the weak form the proposed method is also applicable for nonlinear computations without further measures linear and geometrical nonlinear examples show the high accuracy and robustness of the new method a comparison to reference results and to computations with the lagrange multiplier method is given

strong multipatch c1 coupling for isogeometric analysis on 2d and 3d domains abstract the solution spaces of isogoemetric analysis iga constructed from p degree basis functions allow up to c p 1 continuity within one patch however for a multi patch domain the continuity is only c 0 at the boundaries between the patches in this study we present the construction of basis functions of degree p 2 which are c 1 continuous across the common boundaries shared by the patches the new basis functions are computed as a linear combination of the c 0 basis functions on the multi patch domains an advantage of the proposed method is that for the new basis functions the continuity within a patch is preserved without additional treatment of the functions in the interior of the patch we apply continuity constraints to the new basis functions to enforce c 1 continuity where the constraints are developed according to the concept of matched g k constructions always yield c k continuous isogeometric elements discussed in groisser and peters 2015 however for certain geometries the over constrained solution space will lead to c 1 locking collin and sangalli 2016 we discuss and show the usage of partial degree elevation to overcome this problem we demonstrate the potential of the c 1 basis functions for iga applications through several examples involving biharmonic equations