full analytical sensitivities in nurbs based isogeometric shape optimization abstract non uniform rational b spline nurbs has been widely used as an effective shape parameterization technique for structural optimization due to its compact and powerful shape representation capability and its popularity among cad systems the advent of nurbs based isogeometric analysis has made it even more advantageous to use nurbs in shape optimization since it can potentially avoid the inaccuracy and labor tediousness in geometric model conversion from the design model to the analysis model although both positions and weights of nurbs control points affect the shape until very recently usually only control point positions are used as design variables in shape optimization thus restricting the design space and limiting the shape representation flexibility this paper presents an approach for analytically computing the full sensitivities of both the positions and weights of nurbs control points in structural shape optimization such analytical formulation allows accurate calculation of sensitivity and has been successfully used in gradient based shape optimization the analytical sensitivity for both positions and weights of nurbs control points is especially beneficial for recovering optimal shapes that are conical e g ellipses and circles in 2d cylinders ellipsoids and spheres in 3d that are otherwise not possible without the weights as design variables

isogeometric structural shape optimization an old dilemma in structural shape optimization is the needed tight link between design model or geometric description and analysis model the intention of this paper is to show that isogeometric analysis offers a potential and promising way out of this dilemma to this end we show a structural shape optimization framework based on the isogeometric analysis approach with the discretization based on non uniform rational b splines nurbs the analysis model represents the structural geometry exactly furthermore nurbs enable efficient geometry control together with smooth boundaries they are the de facto standard in cad systems but are also widely used in a shape optimal design context to define the geometry representation and the design variables with the presented isogeometric approach to shape optimization the analysis model is inherently merged with the design model omitting the typically involved interplay between both we derive analytical sensitivities for nurbs discretizations which allow application of efficient gradient based optimization algorithms the present contribution is restricted to two dimensional problems of linear elasticity but the extension to three dimensions and other problem classes is straightforward some representative examples demonstrate and validate the methodology further the potential of boundary continuity control within isogeometric structural shape optimization is explored to trigger smooth or less smooth angular designs

one dimensional transport equations with discontinuous coefficients we consider one dimensional linear transport equations with bounded but possibly discontinuous coefficient a the cauchy problem is studied from two different points of view in the first case we assume that a is piecewise continuous we give an existence result and a precise description of the solutions on the lines of discontinuity in the second case we assume that a satisfies a one sided lipschitz condition we give existence uniqueness and general stability results for backward lipschitz solutions and forward measure solutions by using a duality method we prove that the flux associated to these measure solutions is a product by some canonical representative of a key words linear transport equations discontinuous coefficients weak stability duality product of a measure by a discontinuous function nonnegative solutions 1991 mathematics subject classification primary 35f10 35b35 34a12 to appear in nonlinear analysis tma departement de mathematiques et applications umr cnrs 8553 ecole normale superieure et cnrs 45 rue d ulm 75230 paris cedex 05 france francois bouchut ens fr mathematiques applications et physique mathematique d orleans umr cnrs 6628 universite d orleans 45067 orleans cedex 2 france james math cnrs fr

equations differentielles sur l espace de wiener et formules de cameron martin non lineaires proprietes algebriques des approximations sur r n une formule de perturbation des flots et convergence des approximations formule de changement de variable sur x et equation differentielle

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

the renyi capacity and center renyi s information measures the renyi information mean capacity radius and center are analyzed relying on the elementary properties of the renyi divergence and the power means the van erven harremoes conjecture is proved for any positive order and for any set of probability measures on a given measurable space and a generalization of it is established for the constrained variant of the problem the finiteness of the order alpha renyi capacity is shown to imply the continuity of the renyi capacity on 0 alpha and the uniform equicontinuity of the renyi information both as a family of functions of the order indexed by the priors and as a family of functions of the prior indexed by the orders

on the uniqueness of solutions to continuity equations abstract we obtain sufficient conditions for the uniqueness of solutions to the cauchy problem for the continuity equation in classes of measures that need not be absolutely continuous

local refinement of analysis suitable t splines we develop a local refinement algorithm for analysis suitable t splines which does not produce excessive propagation of control points we then demonstrate its use as an adaptive framework for isogeometric analysis analysis suitable t splines are a class of t splines which are linearly independent and form a partition of unity these properties coupled with local refinement make this class of t splines appealing as a basis for isogeometric analysis

on continuity equations in infinite dimensions with non gaussian reference measure let be a gaussian measure on a locally convex space and h be the corresponding cameron martin space it has been recently shown by l ambrosio and a figalli that the linear rst order pde

on pairs of f divergences and their joint range we compare two f divergences and prove that their joint range is the convex hull of the joint range for distributions supported on only two points the proofs use various methods from topology and convex analysis

shape optimal design using b splines abstract shape optimal design of an elastic structure is formulated using a design element technique it is shown that bezier and b spline curves typical of the cad philosophy are well suited to the definition of design elements complex geometries can be described in a very compact way by a small set of design variables and a few design elements because of the b splines flexibility it is no longer necessary to piece design elements together in order to agree with the shape complexity nor to restrict the shape variations moreover the additional optimization constraints that are most often needed to avoid unrealistic designs when the shape variables are the nodal coordinates of a finite element mesh are automatically taken into account in the new formulation an analytical derivation of the sensitivity analysis will be established giving rise to numerical efficiency it will be seen that the resulting optimization problem does not involve highly nonlinear functions with respect to the shape variables so that simple mathematical programming algorithms can be applied to solve it some numerical examples are offered to demonstrate the power and generality of the new approach presented in this paper

an isogeometric implicit g1 mixed finite element for kirchhoff space rods abstract in the paper we present a multi patch isogeometric mixed element with implicit geometric continuity at the ends for the analysis of non polar kirchhoff space rods rotations are introduced at the ends of the element analogously to the hermitian interpolation performing a change of basis for the configuration space a mixed method in which the internal forces are interpolated by means of an l 2 projection leading to a b formulation is used to cope with the membrane flexural locking that affects the solution the efficiency of the method in avoiding locking and instabilities is investigated the formulation adopted has the advantage with respect to other formulations that a non full global stiffness matrix is obtained this approach appears very appealing for efficient analyses of general assemblies of 3d non polar elements

some inequalities for information divergence and related measures of discrimination inequalities which connect information divergence with other measures of discrimination or distance between probability distributions are used in information theory and its applications to mathematical statistics ergodic theory and other scientific fields we suggest new inequalities of this type often based on underlying identities as a consequence we obtain certain improvements of the well known pinsker inequality our study depends on two measures of discrimination called capacitory discrimination and triangular discrimination the discussion contains references to related research and comparison with other measures of discrimination e g ali silvey csiszar 1996 1966 divergences and in particular the hellinger distance

a fully locking free isogeometric approach for plane linear elasticity problems a stream function formulation in this paper we study plane incompressible elastic problems by means of a stream function formulation such that a divergence free displacement field can be computed from a scalar potential the numerical scheme is constructed within the framework of nurbs based isogeometric analysis and we take advantage of the high continuity guaranteed by nurbs basis functions in order to obtain the displacement field from the potential differentiation as a consequence the obtained numerical scheme is automatically locking free in the presence of the incompressibility constraint a discontinuous galerkin approach is proposed to deal with multiple mapped possibly multiply connected domains extensive numerical results are provided to show the method capabilities 2007 elsevier b v all rights reserved

transport equation extension of classical results for div b bmo we investigate the transport equation ut b u 0 our result improves the criteria on uniqueness of weak solutions replacing the classical condition divb l by divb bmo

simultaneous isogeometrical shape and material design of functionally graded structures for optimal eigenfrequencies abstract a new optimization strategy for eigenfrequency optimization of functionally graded fg structures within the framework of isogeometric analysis iga approach is introduced the proposed methodology which utilizes a concurrent procedure by combining the shape and material composition optimization of these structures employs an extended form of the standard iga method by allowing for gradation of material properties through patches the distributions of the graded material properties are considered as imaginary surfaces over the computational domain and captured in a fully isogeometric formulation using the same nurbs based parameterization which is employed for the geometry modeling as well as the solution approximation considering the in plane coordinates of the control points defining the design boundary surfaces as well as the applicates of all the control points describing the variations of material properties as design variables we subsequently adopt a mathematical programming algorithm to simultaneously find the optimum shape and material composition of fg structures a couple of illustrative numerical examples in 2d elasticity with eigenfrequencies as their either constraints or objective functions are presented to demonstrate the high performance of the proposed methodology it will be seen that the obtained results by this concurrent optimization procedure have much better dynamic performance compared to the optimal results of the simple shape or material composition design

on divergences and informations in statistics and information theory the paper deals with the f divergences of csiszar generalizing the discrimination information of kullback the total variation distance the hellinger divergence and the pearson divergence all basic properties of f divergences including relations to the decision errors are proved in a new manner replacing the classical jensen inequality by a new generalized taylor expansion of convex functions some new properties are proved too e g relations to the statistical sufficiency and deficiency the generalized taylor expansion also shows very easily that all f divergences are average statistical informations differences between prior and posterior bayes errors mutually differing only in the weights imposed on various prior distributions the statistical information introduced by de groot and the classical information of shannon are shown to be extremal cases corresponding to alpha 0 and alpha 1 in the class of the so called arimoto alpha informations introduced in this paper for 0 alpha 1 by means of the arimoto alpha entropies some new examples of f divergences are introduced as well namely the shannon divergences and the arimoto alpha divergences leading for alphauarr1 to the shannon divergences square roots of all these divergences are shown to be metrics satisfying the triangle inequality the last section introduces statistical tests and estimators based on the minimal f divergence with the empirical distribution achieved in the families of hypothetic distributions for the kullback divergence this leads to the classical likelihood ratio test and estimator

information divergence and risk for binary experiments we unify f divergences bregman divergences surrogate regret bounds proper scoring rules cost curves roc curves and statistical information we do this by systematically studying integral and variational representations of these objects and in so doing identify their representation primitives which all are related to cost sensitive binary classification as well as developing relationships between generative and discriminative views of learning the new machinery leads to tight and more general surrogate regret bounds and generalised pinsker inequalities relating f divergences to variational divergence the new viewpoint also illuminates existing algorithms it provides a new derivation of support vector machines in terms of divergences and relates maximum mean discrepancy to fisher linear discriminants

unicite de solutions d equations differentielles sur l espace de wiener soit x l espace de wiener et a un champ de vecteurs sur x on definit la notion de solution de l equation differentielle du dt 1 u t u 0 x on demontre un theoreme d unicite

anticipating flows on the wiener space generated by vector fields of low regularity abstract sobolev spaces for banach space valued wiener functionals are constructed using the operator norm for the h derivatives the corresponding sobolev norms are shown to be strictly weaker than the usual malliavin sobolev norms existing results on flows on an abstract wiener space generated by a vector field are generalized to the case where the vector field is a sum of a not necessarily bounded skew adjoint operator and a non linear part whose regularity is measured by the new sobolev norms this is equivalent to a non linear perturbation of a semi group of rotations

absolutely continuous flows generated by sobolev class vector fields in finite and infinite dimensions abstract we prove the existence of the global flow ut generated by a vector field a from a sobolev class w1 1 on a finite or infinite dimensional space x with a measure provided is sufficiently smooth and that a a and a where a is the divergence with respect to are exponentially integrable in addition the measure is shown to be quasi invariant under ut in the case x r n and p dx where p w1 1loc r n is a locally uniformly positive probability density a sufficient condition is exp c a exp c a p p l1 for all c in the infinite dimensional case we get analogous results for measures differentiable along sufficiently many directions examples of measures which fit our framework important for applications are symmetric invariant measures of infinite dimensional diffusions and gibbs measures typically in both cases such measures are essentially non gaussian our result in infinite dimensions significantly extends previously studied cases where was a gaussian measure finally we study flows generated by vector fields whose values are not necessarily in the cameron martin space

duality and unified analysis of discrete approximations in structural dynamics and wave propagation comparison of p method finite elements with k method nurbs we study the discretization behavior of classical finite element and nurbs approximations on problems of structural vibrations and wave propagation we find that on the basis of equal numbers of degrees of freedom and bandwidth nurbs have superior approximation properties in fact we observe that the high mode behavior of classical finite elements is divergent with the order of approximation a surprisingly negative result on the other hand nurbs offer almost spectral approximation properties and all modes converge with increasing order of approximation

bounding bar d distance by informational divergence a method to prove measure concentration there is a simple inequality by pinsker between variational distance and informational divergence of probability measures defined on arbitrary probability spaces we shall consider probability measures on sequences taken from countable alphabets and derive from pinsker s inequality bounds on the bar d distance by informational divergence such bounds can be used to prove the concentration of measure phenomenon for some nonproduct distributions

on the renyi divergence joint range of relative entropies and a channel coding theorem this paper starts by considering the minimization of the renyi divergence subject to a constraint on the total variation distance based on the solution of this optimization problem the exact locus of the points bigl d q p 1 d q p 2 bigr is determined when p 1 p 2 and q are arbitrary probability measures which are mutually absolutely continuous and the total variation distance between p 1 and p 2 is not below a given value it is further shown that all the points of this convex region are attained by probability measures which are defined on a binary alphabet this characterization yields a geometric interpretation of the minimal chernoff information subject to a constraint on the variational distance this paper also derives an exponential upper bound on the performance of binary linear block codes or code ensembles under maximum likelihood decoding its derivation relies on the gallager bounding technique and it reproduces the shulman feder bound as a special case the bound is expressed in terms of the renyi divergence from the normalized distance spectrum of the code or the average distance spectrum of the ensemble to the binomially distributed distance spectrum of the capacity achieving ensemble of random block codes this exponential bound provides a quantitative measure of the degradation in performance of binary linear block codes or code ensembles as a function of the deviation of their distance spectra from the binomial distribution an efficient use of this bound is considered

lower bounds for the minimax risk using f divergences and applications lower bounds involving f divergences between the underlying probability measures are proved for the minimax risk in estimation problems our proofs just use simple convexity facts special cases and straightforward corollaries of our bounds include well known inequalities for establishing minimax lower bounds such as fano s inequality pinsker s inequality and inequalities based on global entropy conditions two applications are provided a new minimax lower bound for the reconstruction of convex bodies from noisy support function measurements and a different proof of a recent minimax lower bound for the estimation of a covariance matrix

lagrangian flows and the one dimensional peano phenomenon for odes we consider the one dimensional ordinary differential equation with a vector field which is merely continuous and nonnegative and satisfies a condition on the amount of zeros although it is classically known that this problem lacks uniqueness of classical trajectories we show that there is uniqueness for the so called regular lagrangian flow by now usual notion of flow in nonsmooth situations as well as uniqueness of distributional solutions for the associated continuity equation the proof relies on a space reparametrization argument around the zeros of the vector field

flows associated with irregular r d vector fields abstract this work consists on the study of flows associated with non smooth r d vector fields namely concerning existence and uniqueness for almost every initial condition it is also proved that the flows avoid some special compact sets

shape design for thin walled beam cross sections using rational b splines shape optimization of thin walled beams is discussed the cross sectional shape of the beam is described by nonuniform rational b spline curves the optimization problem is defined in terms of cross sectional properties and stresses design variables are the control parameters of the rational b spline curves and the wall thickness of the beam cross sectional properties and stresses are obtained from the elasticity solution for the beam consideration of torsion and pure shear requires the solution of laplace equations which is accomplished using finite elements a design sensitivity analysis is given for the cross sectional properties and stresses a sample problem is presented to illustrate the formulations

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

studies of refinement and continuity in isogeometric structural analysis we investigate the effects of smoothness of basis functions on solution accuracy within the isogeometric analysis framework we consider two simple one dimensional structural eigenvalue problems and two static shell boundary value problems modeled with trivariate nurbs solids we also develop a local refinement strategy that we utilize in one of the shell analyses we find that increased smoothness that is the k method leads to a significant increase in accuracy for the problems of structural vibrations over the classical c0c0 continuous p method whereas a judicious insertion of c0c0 continuous surfaces about singularities in a mesh otherwise generated by the k method usually outperforms a mesh in which all basis functions attain their maximum level of smoothness we conclude that the potential for the k method is high but smoothness is an issue that is not well understood due to the historical dominance of c0c0 continuous finite elements and therefore further studies are warranted

isogeometric configuration design sensitivity analysis of finite deformation curved beam structures using jaumann strain formulation abstract using an isogeometric approach a continuum based configuration design sensitivity analysis dsa method is developed for curved kirchhoff beams with multi patch junctions under the total lagrangian formulation large deformations considering the initial curvature of curved beams are described by geometrically exact beam theory gebt and jaumann strain formulation in the isogeometric approach the higher order continuity and the exact description of initial geometry are naturally embedded using nurbs basis functions in multi patch models c 0 continuity of physical displacement or c 1 continuity of displacement component at junction is weakly imposed using the lagrange multiplier method the superior accuracy of isogeometric analysis iga is verified through the comparison with the results of finite element analysis fea using cubic hermite interpolation in the dsa a material derivative is utilized and the kinematical description of gebt is consistently employed to express orientation design variations contrary to the iga based dsa the hermite basis function explicitly depends on design in the fea based dsa due to its element length parameter moreover since the design velocity field is approximated using the nodal velocity imposed at nodal tangential vector the amount of design perturbations should be very small to obtain precise design sensitivity

isogeometric shape optimization of smoothed petal auxetic structures via computational periodic homogenization an important feature that drives the auxetic behaviour of the star shaped auxetic structures is the hinge functional connection at the vertex connections this feature poses a great challenge for manufacturing and may lead to significant stress concentrations to overcome these problems we introduced smoothed petal shaped auxetic structures where the hinges are replaced by smoothed connections to accommodate the curved features of the petal shaped auxetics a parametrisation modelling scheme using multiple nurbs patches is proposed next an integrated shape design frame work using isogeometric analysis is adopted to improve the structural performance to ensure a minimum thickness for each member a geometry sizing constraint is imposed via piece wise bounding polynomials this geometry sizing constraint in the context of isogeometric shape optimization is particularly interesting due to the non interpolatory nature of nurbs basis the effective poisson ratio is used directly as the objective function and an adjoint sensitivity analysis is carried out the optimized designs smoothed petal auxetic structures are shown to achieve low negative poisson s ratios while the difficulties of manufacturing the hinges are avoided for the case with six petals an in plane isotropy is achieved

ordinary differential equations transport theory and sobolev spaces we obtain some new existence uniqueness and stability results for ordinary differential equations with coefficients in sobolev spaces these results are deduced from corresponding results on linear transport equations which are analyzed by the method of renormalized solutions

numerical efficiency locking and unlocking of nurbs finite elements abstract the strategy of using finite elements with nurbs shape functions for approximation of both geometry and displacements isogeometric approach is investigated from the point of view of finite element technology convergence rates are compared to those of classical finite element approaches utilizing standard lagrange shape functions moreover typical locking phenomena are examined it is found that higher order inter element continuity within the nurbs approach results in identical convergence rates but smaller absolute errors compared to c 0 continuous approaches however nurbs finite elements suffer from the same locking problems as finite elements using lagrange shape functions the discrete shear gap dsg method a general framework for formulation of locking free elements is applied to develop a new class of nurbs finite elements the resulting nurbs dsg elements are absolutely free from locking and preserve the property of improved accuracy compared with standard locking free finite elements the method is exemplified for the timoshenko beam model but may be applied to more general cases

sharp inequalities for f divergences f divergences are a general class of divergences between probability measures which include as special cases many commonly used divergences in probability mathematical statistics and information theory such as kullback leibler divergence chi squared divergence squared hellinger distance total variation distance and so on in this paper we study the problem of maximizing or minimizing an f divergence between two probability measures subject to a finite number of constraints on other f divergences we show that these infinite dimensional optimization problems can all be reduced to optimization problems over small finite dimensional spaces which are tractable our results lead to a comprehensive and unified treatment of the problem of obtaining sharp inequalities between f divergences we demonstrate that many of the existing results on inequalities between f divergences can be obtained as special cases of our results we also improve on some existing non sharp inequalities

a simple proof of the blowing up lemma corresp the blowing up lemma says that if the probability with respect to a product measure of a set a subseteq cal x n cal x finite n large is not exponentially small then its l n neighborhood has probability almost one for some l n o n here an information theoretic proof of the blowing up lemma generalizing it to continuous alphabets is given

f divergence inequalities this paper develops systematic approaches to obtain f divergence inequalities dealing with pairs of probability measures defined on arbitrary alphabets functional domination is one such approach where special emphasis is placed on finding the best possible constant upper bounding a ratio of f divergences another approach used for the derivation of bounds among f divergences relies on moment inequalities and the logarithmic convexity property which results in tight bounds on the relative entropy and bhattacharyya distance in terms of chi 2 divergences a rich variety of bounds are shown to hold under boundedness assumptions on the relative information special attention is devoted to the total variation distance and its relation to the relative information and relative entropy including reverse pinsker inequalities as well as on the e gamma divergence which generalizes the total variation distance pinsker s inequality is extended for this type of f divergence a result which leads to an inequality linking the relative entropy and relative information spectrum integral expressions of the renyi divergence in terms of the relative information spectrum are derived leading to bounds on the renyi divergence in terms of either the variational distance or relative entropy

statistical information and discrimination in analogy with the definition of shannon information m h de groot 1962 defined statistical information as the difference between prior and posterior risk of a statistical decision problem relations are studied between the statistical information and the discrimination functions of information theory known as f divergences using previous results it is shown that every f divergence i sub f p q is an average statistical information or decision problem with dichotomic parameter 0 1 loss function and corresponding observation distributions p and q the average is taken over a distribution on the parameter s prior probability this distribution is uniquely determined by the function f the main result is that every f divergence is statistical information in some properly chosen statistical decision problem and conversely that every piece of statistical information is an f divergence this provides a new representation of discrimination functions figuring in signal detection data compression coding pattern classification cluster analysis etc

rotation free isogeometric analysis of an arbitrarily curved plane bernoulli euler beam abstract the present study elucidates linear static analysis for plane beam structures using the isogeometric approach a novel methodology for rotation free analysis of an arbitrarily curved bernoulli euler beam in the convective frame of reference is derived in detail the full degeneration of a 3d continuum beam to a 1d line has been presented and a fully applicable isogeometric finite element has been obtained the driving force behind developing the present research has been the derivation of the nurbs based isogeometric analysis which will enable an elegant formulation of the plane bernoulli euler beams being a function only of the global rectangular cartesian coordinates the verification and accuracy of the research are obtained via a thorough comparison between theory finite element analyses and relevant examples from literature an excellent agreement of results is achieved and usefulness for academic and practical purposes alike are proved the effects of the hpk refinements are illuminated and it is observed that the convergences for the most variables and refinement techniques are not monotonic a special attention is paid to the influence of the product of maximum curvature and thickness of beam on the accuracy of the solution the limits of applicability of the present approach are defined for a few specific types of analyses the derived formulation is geometrically exact and appropriate for the analysis of strongly curved bernoulli euler beams

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

isogeometric sizing and shape optimisation of beam structures based on the recently proposed framework of isogeometric analysis a study of structural sizing and shape optimisation of curved beam structures is presented the idea of the isogeometric approach is to analyse the structure using its intrinsic and hence exact geometric definition the structural response is approximated using the same basis functions describing the geometry the presented isogeometric framework employs non uniform rational b splines shape changes can be represented by altering both spatial location of control points and the corresponding weights towards the optimal design adaptation of identical geometric representations for both design and analysis resolves the problem of repetitive conversion between the computer aided and facet based geometries used in conventional finite element analysis sizing variables defined at the control points are interpolated using the same basis functions due to the fact that both analysis sizing and shape design share the same underlying description direct sensitivities can be easily evaluated analytically which improves the performance of the optimisation process while sizing should reflect local stress states shape design is preferably performed on a global level thus a multilevel design approach is proposed where shape design is carried on a coarser level projecting the shape design sensitivities bridges the gap between the different levels the proposed design formulation is applied to compliance minimisation problems numerical results indicate the applicability of the method

estimates and regularity results for the diperna lions flow in this paper we derive new simple estimates for ordinary differential equations with sobolev coefficients these estimates not only allow to recover some old and recent results in a simple direct way but they also have some new interesting corollaries

old bands new tracks revisiting the band model for robust hypothesis testing the density band model proposed by kassam 1 for robust hypothesis testing is revisited first a novel criterion for the general characterization of least favorable distributions is proposed that unifies existing results this criterion is then used to derive an implicit definition of the least favorable distributions under band uncertainties in contrast to the existing solution it only requires two scalar values to be determined and eliminates the need for case by case statements based on this definition a generic fixed point algorithm is proposed that iteratively calculates the least favorable distributions for arbitrary band specifications finally three different types of robust tests that emerge from band models are discussed and a numerical example is presented to illustrate their potential use in practice

variational multiscale residual based turbulence modeling for large eddy simulation of incompressible flows we present an les type variational multiscale theory of turbulence our approach derives completely from the incompressible navier stokes equations and does not employ any ad hoc devices such as eddy viscosities we tested the formulation on forced homogeneous isotropic turbulence and turbulent channel flows in the calculations we employed linear quadratic and cubic nurbs a dispersion analysis of simple model problems revealed nurbs elements to be superior to classical finite elements in approximating advective and diffusive processes which play a significant role in turbulence computations the numerical results are very good and confirm the viability of the theoretical framework

adjoint based airfoil optimization with adaptive isogeometric discontinuous galerkin method abstract in this work an adjoint based airfoil shape optimization algorithm is developed based on the adaptive isogeometric discontinuous galerkin method for compressible euler equations to investigate the significance of each design variable of airfoil b spline parameterization we first parameterize the airfoil by b spline curve approximation with some control points viewed as design variables and build the b spline representation of the flow field with the curve to apply the goal oriented h adaptive isogeometric dg method for flow solution then we compute and employ the discrete adjoint solutions for both multi target error estimation in adaptive mesh refinement with the isogeometric nature not only all the geometrical cells but also the numerical basis functions can be analytically expressed by the design variables indicating that the numerical solutions and objective could be differentiable with respect to those variables consequently the gradient is totally computed in an accurate approach and the sensitivity analysis is thus improved by reducing the spatial discretization error and introducing the analytical expression of derivative to reveal the key parameters for optimization in an intuitive and efficient manner although the sqp optimization algorithm is adopted in the paper the given accurate gradient can be applied to any gradient based optimization algorithm the proposed algorithm is demonstrated on rae2822 airfoil with inviscid transonic flow where the shape is optimized to minimize the drag coefficient at a constrained lift and airfoil area the numerical results show that the drag is much more sensitive to the design variables near the tailing edge at the beginning but sensitivity is reduced when optimal

the method of moving asymptotes a new method for structural optimization a new method for non linear programming in general and structural optimization in particular is presented in each step of the iterative process a strictly convex approximating subproblem is generated and solved the generation of these subproblems is controlled by so called moving asymptotes which may both stabilize and speed up the convergence of the general process

tight bounds for symmetric divergence measures and a refined bound for lossless source coding tight bounds for several symmetric divergence measures are derived in terms of the total variation distance it is shown that each of these bounds is attained by a pair of two or three element probability distributions an application of these bounds for lossless source coding is provided refining and improving a certain bound by csiszar another application of these bounds has been recently introduced by yardi et al for channel code detection

refinements of pinsker s inequality let v and d denote respectively total variation and divergence we study lower bounds of d with v fixed the theoretically best i e largest lower bound determines a function l l v vajda s 1970 tight lower bound the main result is an exact parametrization of l this leads to taylor polynomials which are lower bounds for l and thereby to extensions of the classical pinsker 1960 inequality which has numerous applications cf pinsker and followers