vanishing viscosity solutions of nonlinear hyperbolic systems we consider the cauchy problem for a strictly hyperbolic n n system in one space dimension ut a u ux 0 assuming that the initial data have small total variation we show that the solutions of the viscous approximations ut a u ux euxx are defined globally in time and satisfy uniform bv estimates independent of e moreover they depend continuously on the initial data in the l 1 distance with a lipschitz constant independent of t e letting e 0 these viscous solutions converge to a unique limit depending lipschitz continuously on the initial data in the conservative case where a df is the jacobian

computational complexity of inner and outer j radii of polytopes in finite dimensional normed spaces this paper studies the complexity of computing or approximating or bounding the various inner and outer radii of ann dimensional convex polytope in the space n equipped with an lp norm or a polytopal norm the polytopep is assumed to be presented as the convex hull of finitely many points with rational coordinates v presented or as the intersection of finitely many closed halfspaces defined by linear inequalities with rational coefficients presented the innerj radius ofp is the radius of a largestj ball contained inp it isp s inradius whenj n and half ofp s diameter whenj 1 the outerj radius measures how wellp can be approximated in a minimax sense by an n j flat it isp s circumradius whenj n and half ofp s width whenj 1 the binary turing machine model of computation is employed the primary concern is not with finding optimal algorithms but with establishing polynomial time computability or np hardness special attention is paid to the case in whichp is centrally symmetric when the dimensionn is permitted to vary the situation is roughly as follows a for general presented polytopes in lp spaces with 1

the unique limit of the glimm scheme we introduce the definitions of a standard riemann semigroup and of a viscosity solution for a nonlinear hyperbolic system of conservation laws for a class including general 2 2 systems it is proved that the solutions obtained by a wavefront tracking algorithm or by the glimm scheme are precisely the semigroup trajectories in particular these solutions are unique and depend lipschitz continuously on the initial data in the l1 norm

dissipative boundary conditions for 2 2 hyperbolic systems of conservation laws for entropy solutions in bv in this article we investigate the bv stability of 2 2 hyperbolic systems of conservation laws with strictly positive velocities under dissipative boundary conditions more precisely we derive sufficient conditions guaranteeing the exponential stability of the system under consideration for entropy solutions in bv our proof is based on a front tracking algorithm used to construct approximate piecewise constants solutions whose bv norms are controlled through a lyapunov functional this lyapunov functional is inspired by the one proposed in j glimm s seminal work j glimm comm pure appl math 18 697 715 1965 modified with some suitable weights in the spirit of the previous works j m coron g bastin and b d andrea novel siam j control optim 47 3 1460 1498 2008 and j m coron b d andrea novel and g bastin ieee trans automat control 52 1 2 11 2007

optimal control of cell mass and maturity in a model of follicular ovulation in this paper we study optimal control problems associated with a scalar hyperbolic conservation law modeling the development of ovarian follicles changes in the age and maturity of follicular cells are described by a two dimensional conservation law where the control terms act on the velocities the control problem consists in optimizing the follicular cell resources so that the follicular maturity reaches a maximal value in fixed time formulating the optimal control problem within a hybrid framework we prove necessary optimality conditions in the form of the hybrid maximum principle then we derive the optimal strategy and show that there exists at least one optimal bang bang control with one single switching time

divergence measure fields and hyperbolic conservation laws we analyze a class of l infty vector fields called divergence measure fields we establish the gauss green formula the normal traces over subsets of lipschitz boundaries and the product rule for this class of l infty fields then we apply this theory to analyze l infty entropy solutions of initial boundary value problems for hyperbolic conservation laws and to study the ways in which the solutions assume their initial and boundary data the examples of conservation laws include multidimensional scalar equations the system of nonlinear elasticity and a class of m x m systems with affine characteristic hypersurfaces the analysis in l infty also extends to l p

a semidefinite hierarchy for containment of spectrahedra a spectrahedron is the positivity region of a linear matrix pencil and thus the feasible set of a semidefinite program we propose and study a hierarchy of sufficient semidefinite conditions to certify the containment of a spectrahedron in another one this approach comes from applying a moment relaxation to a suitable polynomial optimization formulation the hierarchical criterion is stronger than a solitary semidefinite criterion discussed earlier by helton klep and mccullough as well as by the authors moreover several exactness results for the solitary criterion can be brought forward to the hierarchical approach the hierarchy also applies to the equivalent question of checking whether a map between matrix sub spaces is positive in this context the solitary criterion checks whether the map is completely positive and thus our results provide a hierarchy between positivity and complete positivity

on the controllability of the non isentropic 1 d euler equation in this paper we examine the question of the boundary controllability of the one dimensional non isentropic euler equation for compressible polytropic gas in the context of weak entropy solutions we consider the system in eulerian coordinates and the one in lagrangian coordinates we obtain for both systems a result of controllability toward constant states with the limitation gamma frac 5 3 on the adiabatic constant for the lagrangian system the solutions that we obtain remain of small total variation in space if the initial condition is itself of sufficiently small total variation

decay estimate for a new measure of rarefaction waves in general systems of conservation laws abstract the sharp decay estimate of rarefaction waves in terms of a partial ordering among positive measures is not only interesting in itself but also crucial in the study of convergence rate of vanishing viscosity approximations cf bressan and yang 2004 10 such an estimate is well established for genuinely nonlinear system of conservation laws cf bressan and yang 2004 9 but similar result is not available for non genuinely nonlinear system in this paper we give a new measure about the rarefaction waves in addition a sharp decay estimate of the new measure is given for the cubic nonlinear system of conservation laws

an asymptotic competitive scheme for online bin packing in the online bin packing problem a list of items with integral sizes between 1 to b arrive one by one each item must be irrevocably assigned into a bin of capacity b upon its arrival without any information on the subsequent items and the goal is to minimize the number of used bins in this paper we deal with online bin packing from a new sight we present an asymptotic competitive scheme i e for any 0 the asymptotic competitive ratio is at most where is the smallest possible asymptotic competitive ratio among all online algorithms apart from the technical results the analysis to bridge the online and the off line approaches might be of particular interests

on the boundary controllability of first order hyperbolic systems abstract we discuss some results concerning the boundary controllability and stabilizability of a hyperbolic system of conservation laws u t f u x 0 t 0 x 0 1 where we regard the boundary data or a partial number of their components as boundary input controls in particular we consider the problem of the global exact boundary controllability of a first order linear hyperbolic system with constant coefficients relative to the linear boundary conditions under generic orthogonality assumptions on the boundary and control matrices and assuming a non resonance condition of the characteristic speeds we show that one can steer in finite time the solution from any initial condition l 1 to any terminal state l 1 even in the case where only a partial control of the boundary values is available

well posedness theory for hyperbolic conservation laws the paper presents a well posedness theory for the initial value problem for a general system of hyperbolic conservation laws we will start with the refinement of glimm s existence theory and discuss the principle of nonlinear through wave tracing our main goal is to introduce a nonlinear functional for two solutions with the property that it is equivalent to the l1 x distance between the two solutions and is time decreasing moreover the functional is constructed explicitly in terms of the wave patterns of the solutions through the nonlinear superposition it consists of a linear term measuring the l1 x distance a quadratic term measuring the coupling of waves and distance and a generalized entropy functional 1999 john wiley sons inc

the boundary riemann solver coming from the real vanishing viscosity approximation we study the limit of the hyperbolic parabolic approximation left begin array l quad l quad l v varepsilon t tilde a left v varepsilon varepsilon v varepsilon x right v varepsilon x varepsilon tilde b v varepsilon v varepsilon xx quad v varepsilon in mathbb r n cr tilde rm ss v varepsilon t 0 equiv bar g cr v varepsilon 0 x equiv bar v 0 end array right the function tilde ss is defined in such a way as to guarantee that the initial boundary value problem is well posed even if tilde b is not invertible the data bar g and bar v 0 are constant when tilde b is invertible the previous problem takes the simpler form left begin array l quad l quad l v varepsilon t tilde a left v varepsilon varepsilon v varepsilon x right v varepsilon x varepsilon tilde b v varepsilon v varepsilon xx quad v varepsilon in mathbb r n cr v varepsilon t 0 equiv bar v b cr v varepsilon 0 x equiv bar v 0 end array right again the data bar v b and bar v 0 are constant the conservative case is included in the previous formulations convergence of the v varepsilon smallness of the total variation and other technical hypotheses are assumed and a complete characterization of the limit is provided the most interesting points are the following first the boundary characteristic case is considered that is one eigenvalue of tilde a can be 0 second as pointed out before we take into account the possibility that tilde b is not invertible to deal with this case we take as hypotheses conditions that were introduced by kawashima and shizuta relying on physically meaningful examples we also introduce a new condition of block linear degeneracy we prove that if this condition is not satisfied then pathological behaviors may occur

the slow erosion limit in a model of granular flow we study a 2 2 system of balance laws that describes the evolution of a granular material avalanche flowing downhill the original model was proposed by hadeler and kuttler granul matter 2 9 18 1999 the cauchy problem for this system has been studied by the authors in recent papers amadori and shen in commun partial differ equ 34 1003 1040 2009 shen in j math anal appl 339 828 838 2008 in this paper we first consider an initial boundary value problem the boundary condition is given by the flow of the incoming material for this problem we prove the global existence of bv solutions for a suitable class of data with bounded but possibly large total variations we then study the slow erosion or deposition limit we show that if the thickness of the moving layer remains small then the profile of the standing layer depends only on the total mass of the avalanche flowing downhill not on the time law describing the rate at which the material slides down more precisely in the limit as the thickness of the moving layer tends to zero the slope of the mountain is provided by an entropy solution to a scalar integro differential conservation law

continuous dependence for 2 2 conservation laws with boundary on the domain 0 t x r t 0 and x 9 t for some boundary profile 9 r r as usual 1 1 is assumed to be strictly hyperbolic and with each characteristic field either linearly degenerate or genuinely non linear an initial data u 0 x u x having sufficiently small total variation is given we consider two different kinds of boundary conditions along x 9 t and in both cases we construct a lipschitzean flow whose trajectories are solutions of an initial boundary value problem for 1 1 thus we prove the continuous dependence of the solution upon the initial data upon the boundary condition and upon the boundary profile the existence theory for global bv solutions to the cauchy problem for 1 1 goes back to the fundamental paper 15 by glimm more recently in 6 a new approach has been introduced it relies on the construction of a lipschitzean semigroup the standard riemann semigroup srs whose trajectories extend the local standard lax 17 solutions of riemann problems at present such a srs has been constructed in the 2 2 case in 8 9 while for the general n n case see 7 10 and 3 in article no de973274

polyhedral boundary projection we consider the problem of projecting a point in a polyhedral set onto the boundary of the set using an arbitrary norm for the projection two types of polyhedral sets one defined by a convex combination of k points in rn and the second by the intersection of m closed half spaces in rn lead to disparate optimization problems for finding such a projection the first case leads to a mathematical program with a linear objective function and constraints that are linear inequalities except for a single nonconvex cylindrical constraint interestingly for the 1 norm this nonconvex problem can be solved by solving 2n linear programs the second polyhedral set leads to a much simpler problem of determining the minimum of m easily evaluated numbers these disparate mathematical complexities parallel known ones for the related problem of finding the largest ball with radius measured by an arbitrary norm that can be inscribed in the polyhedral set for a polyhedral set of the first type this problem is np hard for the 2 norm and the infty norm r m freund and j b orlin math programming 33 1985 pp 139 145 and solvable by a single linear program for the 1 norm p gritzmann and v klee math programming 59 1993 pp 163 213 while for the second type this problem leads to a single linear program even for a general norm p gritzmann and v klee discrete comput geom 7 1992 pp 255 280

a contractive metric for systems of conservation laws with coinciding shock and rarefaction curves abstract we introduce two algorithms for the construction of weak entropy admissible solutions to a class of systems of conservation laws with coinciding shock and rarefaction curves global existence uniqueness and continuous dependence are proved for all solutions obtained by our constructive procedure the generated semigroup is contractive with respect to a riemann type metric defined in terms of glimm s wave interaction functional equivalent to the usual l 1 distance

decay estimation in nonlinear hyperbolic system of conservation laws abstract in this paper we study some decay estimates in nonlinear hyperbolic system of conservation laws this research is not only interesting in itself but also crucial in studying the large time behavior problem by introducing a proper glimm functional we obtain some useful decay estimates which are proved helpful in obtaining decay rates of the admissible solutions to nonlinear hyperbolic conservation laws as t

deciding uniqueness in norm maximization np hardness is established for the problem whose instance is a system of linear inequalities defining a polytopep and whose question is whether onp the global maximum of the euclidean norm is attained at more than one vertex ofp the np hardness persists even for the restricted problem in whichp is a full dimensional parallelotope with one vertex at the origin this makes it possible to establish np hardness for other uniqueness problems including some from pseudoboolean programming and computational convexity

no contractive metrics for systems of conservation laws soit u t f u x 0 un systeme 2 2 de lois de conservation satisfaisant certaines hypotheses generiques sur f dans un voisinage 7b n de l espace u on montre que pour chaque metrique non degeneree d sur l u espace il existe des etats u 1 et u 2 dans 7b n tels que d u x t u 1 dx est une fonction strictement croissante de t dans un voisinage de t 0 ou u est la solution admissible du systeme avec u x 0 u 1 x 0 u 2 0 x 1 u 1 x 1

calculus of fuzzy vector valued functions and almost periodic fuzzy vector valued functions on time scales abstract in this paper we establish an embedding theorem for the fuzzy multidimensional space and introduce the new types of multiplications of fuzzy vectors determined by the determinant algorithm then some fundamental results of calculus of fuzzy vector valued functions on time scales are established based on these results we introduce the concept of shift almost periodic fuzzy vector valued functions and develop a theory of almost periodic fuzzy functions on time scales this function theory can be used to study almost periodic fuzzy dynamic equations on time scales including a new type of fuzzy dynamic equations called fuzzy q dynamic equation i e quantum fuzzy dynamic equation

on the convergence of finite difference methods for pde under temporal refinement abstract in this note we present an issue in the verification of order of convergence for finite difference approximations to partial differential equations discretized in time and space when one refines both space and time together the convergence rate for a correct implementation will match that expected from an analysis of the asymptotic convergence rate or local truncation error of the method sometimes however only the time step size is reduced while the spatial mesh is held fixed the observed rate of convergence in this case may then differ from the formal order of accuracy of the method in space time in particular one class of methods second order lax wendroff time differencing produces only first order when the time step is refined at fixed spatial mesh resolution because the time and space differencing are intrinsically linked our method to arrive at this result is through analyzing the error at a defined point in time associated with many time steps we demonstrate our results computationally

containment problems for polytopes and spectrahedra we study the computational question of whether a given polytope or spectrahedron s a as given by the positive semidefiniteness region of a linear matrix pencil a x is contained in another s b first we classify the computational complexity extending results on the polytope polytope case by gritzmann and klee to the polytope spectrahedron case for various restricted containment problems np hardness is shown we then study in detail semidefinite conditions to certify containment building upon work by ben tal and nemirovski and helton klep and mccullough in particular we discuss variations of a sufficient semidefinite condition to certify containment of a spectrahedron in a spectrahedron it is shown that these sufficient conditions even provide exact semidefinite characterizations for containment in several important cases including containment of a spectrahedron in a polyhedron moreover in the case of bounded s a the criteria will always succeed in certifying containment of some scale

exact boundary observability for a kind of second order quasilinear hyperbolic system abstract in this paper by means of a constructive method based on the existence and uniqueness of the semi global classical solution we establish the local exact boundary observability for a kind of second order quasilinear hyperbolic system in which the number of positive eigenvalues and the number of negative ones are not equal as an application we obtain the one sided local exact boundary observability and two sided local exact boundary observability with fewer observed values for first order quasilinear hyperbolic systems of diagonal form with boundary conditions in which the diagonal variables corresponding to the positive eigenvalues and those corresponding to the negative ones are decoupled

global well posedness of traffic flow models with phase transitions abstract this note is devoted to the study of traffic flow models that develop phase transitions from the analytical point of view this is a first example of a well posedness result for conservation laws developing phase transitions which is independent from the number of phase boundaries in the initial data or in the solutions we consider below the cauchy problem as well as the problem with boundaries

boundary layers in weak solutions of hyperbolic conservation laws this paper is concerned with the initial boundary value problem for a nonlinear hyperbolic system of conservation laws we study the boundary layers that may arise in approximations of entropy discontinuous solutions we consider both the vanishing viscosity method and finite difference schemes lax friedrichs type schemes and the godunov scheme we demonstrate that different regularization methods generate different boundary layers hence the boundary condition can be formulated only if an approximation scheme is selected first assuming solely uniform l infty bounds on the approximate solutions and so dealing with l infty solutions we derive several entropy inequalities satisfied by the boundary layer in each case under consideration a young measure is introduced to describe the boundary trace when a uniform bound on the total variation is available the boundary young measure reduces to a dirac mass from the above analysis we deduce several formulations for the boundary condition which apply whether the boundary is characteristic or not each formulation is based on a set of admissible boundary values following the terminology of dubois lefloch 15 the local structure of these sets and the well posedness of the corresponding initial boundary value problem are investigated the results are illustrated with convex and nonconvex conservation laws and examples from continuum mechanics

backstepping boundary control for first order hyperbolic pdes and application to systems with actuator and sensor delays abstract we consider a problem of boundary feedback stabilization of first order hyperbolic partial differential equations pdes these equations serve as a model for physical phenomena such as traffic flows chemical reactors and heat exchangers we design controllers using a backstepping method which has been recently developed for parabolic pdes with the integral transformation and boundary feedback the unstable pde is converted into a delay line system which converges to zero in finite time we then apply this procedure to finite dimensional systems with actuator and sensor delays to recover a well known infinite dimensional controller analog of the smith predictor for unstable plants we also show that the proposed method can be used for the boundary control of a korteweg de vries like third order pde the designs are illustrated with simulations

optimal online algorithms for multidimensional packing problems we solve an open problem in the literature by providing an online algorithm for multidimensional bin packing that uses only bounded space to achieve this we introduce a new technique for classifying the items to be packed we show that our algorithm is optimal among bounded space algorithms for any dimension d 1 its asymptotic performance ratio is pi infty d where pi infty approx1 691 is the asymptotic performance ratio of the one dimensional algorithm harm a modified version of this algorithm for the case where all items are hypercubes is also shown to be optimal its asymptotic performance ratio is sublinear in d furthermore we extend the techniques used in these algorithms to give optimal algorithms for online bounded space variable sized packing and resource augmented packing

systems of conservation laws with invariant submanifolds systems of conservation laws with coinciding shock and rarefaction curves arise in the study of oil reservoir simulation multicomponent chromatogra phy as well as in the study of nonlinear motion in elastic strings here we characterize this phenomenon by deriving necessary and sufficient conditions on the geometry of a wave curve in order that the shock wave curve coincide with its associated rarefaction wave curve for a system of conservation laws this coinci dence is the one dimensional case of a submanifold of the state variables being invariant for the system of equations and the necessary and sufficient conditions are derived for invariant submanifolds of arbitrary dimension in the case of 2 x 2 systems we derive explicit formulas for the class of flux functions that give rise to the coupled nonlinear conservation laws for which the shock and rarefaction wave curves coincide introduction systems of conservation laws which have coinciding shock and rarefaction curves arise in the study of oil reservoir simulation nonlinear wave motion in elastic strings as well as in multicomponent chromatography 1 4 5 6 9 11 12 these systems have many interesting features the riemann problem for these equations can be explicitly solved in the large and wave interactions have a simplified structure even in the presence of a nonconvex flux function for this reason these systems represent some of the few examples for which the cauchy problem has been solved for arbitrary data of bounded variation also hyperbolic degeneracies appear in each of these systems in the present paper we are concerned with characterizing the phenomenon of coinciding shock and rarefaction curves this phenomenon turns out to be a special case of the general phenomenon of a submanifold of r being invariant for weak solutions of a given system of n conservation laws invariant manifolds of higher dimension also appear in physical conservation equations in which the conserved quantities represent concentrations i e when the concentrations c of any of the species vanish the system must reduce to a lower order system that expresses the conservation of the remaining species thus c 0 defines a manifold which is invariant in the sense that solutions that start on the manifold remain there for all time moreover such an invariant manifold of dimension n 1 is the boundary of an dimensional invariant region in the sense of chueh conley and smoller 14 in the case of

a new glimm functional and convergence rate of glimm scheme for general systems of hyperbolic conservation laws in this paper we introduce a new glimm functional for general systems of hyperbolic conservation laws this new functional is consistent with the classical glimm functional for the case when each characteristic field is either genuinely nonlinear or linearly degenerate so that it can be viewed as optimal in some sense with this new functional the consistency of the glimm scheme is proved clearly for general systems moreover the convergence rate of the glimm scheme is shown to be the same as the one obtained in bressan marson arch ration mech anal 142 2 155 176 1998 for systems with each characteristic field being genuinely nonlinear or linearly degenerate

linear time algorithms for linear programming in r 3 and related problems linear time algorithms for linear programming in r 2 and r 3 are presented the methods used are applicable for other graphic and geometric problems as well as quadratic programming for exam

scalar non linear conservation laws with integrable boundary data where u u t x is the state variable u are integrable possibly unbounded initial and boundary data and f is assumed to be a superlinear strictly convex function for problems of this type since classical solutions develop discontinuities in nite time no matter how smooth their initial and boundary data it is natural to consider weak solutions satisfying the usual entropy conditions 13 15 u t x u t x t x 0 1 4

intrinsic volumes and successive radii motivated by a problem of teissier to bound the intrinsic volumes of a convex body in terms of the inradius and the circumradius of the body we give upper and lower bounds for the intrinsic volumes of a convex body in terms of the elementary symmetric functions of the so called successive inner and outer radii these results improve on former bounds and in particular they also provide bounds for the elementary symmetric functions of the roots of steiner polynomials in terms of the elementary symmetric functions of these radii

approximating the radii of point sets we consider the problem of computing the outer radii of point sets in this problem we are given integers n d and k where k le d and a set p of n points in re d the goal is to compute the outer k radius of p denoted by cal r k p which is the minimum over all d k dimensional flats f of max p in p d p f where d p f is the euclidean distance between the point p and flat f computing the radii of point sets is a fundamental problem in computational convexity with many significant applications the problem admits a polynomial time algorithm when the dimension d is constant u faigle w kern and m streng math program 73 1996 pp 1 5 here we are interested in the general case in which the dimension d is not fixed and can be as large as n where the problem becomes np hard even for k 1 it is known that r k p can be approximated in polynomial time by a factor of 1 varepsilon for any varepsilon 0 when d k is a fixed constant m babdoiu s har peled and p indyk in proceedings of the acm symposium on the theory of computing 2002 s har peled and k varadarajan in proceedings of the acm symposium on computing geometry 2002 a polynomial time algorithm that guarantees a factor of o sqrt log n approximation for r 1 p the width of the point set p is implied by the results of nemirovski roos and terlaky math program 86 1999 pp 463 473 and nesterov handbook of semidefinite programming theory algorithms kluwer academic publishers norwell ma 2000 in this paper we show that r k p can be approximated by a ratio of o sqrt log n for any 1 leq k leq d thus matching the previously best known ratio for approximating the special case r 1 p the width of point set p our algorithm is based on semidefinite programming relaxation with a new mixed deterministic and randomized rounding procedure we also prove an inapproximability result that gives evidence that our approximation algorithm is doing well for a large range of k we show that there exists a constant delta 0 such that the following holds for any 0 eps 1 there is no polynomial time algorithm that approximates r k p within log n delta for all k such that k leq d d varepsilon unless np subseteq dtime 2 log m o 1 our inapproximability result for r k p extends a previously known hardness result of brieden discrete comput geom 28 2002 pp 201 209 and is proved by modifying brieden s construction using basic ideas from probabilistically checkable proofs pcp theory

note on the computational complexity of j radii of polytopes in r n we show that for fixed dimensionn the approximation of inner and outer j radii of polytopes in n endowed with the euclidean norm is in our method is based on the standard polynomial time algorithms for solving a system of polynomial inequalities over the reals in fixed dimension

on computing the diameter of a point set in high dimensional euclidean space we consider the problem of computing the diameter of a set of n points in d dimensional euclidean space under euclidean distance function we describe an algorithm that in time o dnlogn n2 finds with high probability an arbitrarily close approximation of the diameter for large values of d the complexity bound of our algorithm is a substantial improvement over the complexity bounds of previously known exact algorithms computing and approximating the diameter are fundamental primitives in high dimensional computational geometry and find practical application for example in clustering operations for image databases

optimal boundary control of nonlinear hyperbolic conservation laws with switched boundary data we consider the optimal control of initial boundary value problems for entropy solutions of scalar hyperbolic conservation laws in particular we consider initial boundary value problems where the initial and boundary data switch between different c 1 functions at certain switching points and both the functions and the switching points are controlled we show that the control to state mapping is differentiable in a certain generalized sense which implies frechet differentiability with respect to the control functions and the switching points for the composition with a tracking type functional even in the presence of shocks we also present an adjoint based formula for the gradient of the reduced objective functional

a complex analytic approach to the problem of uniform controllability of a transport equation in the vanishing viscosity limit abstract we revisit a result by coron and guerrero stating that the one dimensional transport diffusion equation u t m u x e u x x 0 in 0 t 0 l controlled by the left dirichlet boundary value is zero controllable at a bounded cost as e 0 when t 4 3 l m if m 0 and when t 57 2 l m if m 0 by a completely different method relying on complex analysis we prove that this still holds when t 4 2 l m if m 0 and when t 6 1 l m if m 0

on the attainable set for temple class systems with boundary controls consider the initial boundary value problem for a strictly hyperbolic genuinely nonlinear temple class system of conservation laws begin equation label eq 1 u t f u x 0 qquad u 0 x ov u x qquad left begin array ll u t a widetilde u a t 2pt u t b widetilde u b t end array right end equation on the domain omega t x in r 2 t geq 0 a le x leq b we study the mixed problem ref eq 1 from the point of view of control theory taking the initial data overline u fixed and regarding the boundary data widetilde u a widetilde u b as control functions that vary in prescribed sets u a u b of li boundary controls in particular we consider the family of configurations a t doteq u t cdot u mbox is a sol to ref eq 1 widetilde u a in u a widetilde u b in u b that can be attained by the system at a given time t 0 and we give a description of the attainable set a t in terms of suitable oleinik type conditions we also establish closure and compactness of the set a t in the lu topology

the semigroup generated by 2 2 conservation laws consider the cauchy problem for a strictly hyperbolic 2 2 system of conservation laws in one space dimension ie1 01 assuming that each characteristic field is either linearly degenerate or genuinely nonlinear this paper develops a new algorithm based on wave front tracking which yields a cauchy sequence of approximate solutions converging to a unique limit depending continuously on the initial data the solutions that we obtain constitute a semigroup s defined on a set ie1 02 of integrable functions with small total variation for some lipschitz constant l we have the estimate ie1 03

the complexity of vertex enumeration methods the computational complexity of problems relating to the enumeration of all the vertices of a convex polyhedron defined by linear inequalities is examined several published approaches are evaluated in this light a new algorithm is described and shown to have a better complexity estimate than existing methods empirical evidence supporting the theoretical superiority is presented finally vertex enumeration is discussed when the space containing the polyhedra is of fixed dimension and only the size of the inequality system is permitted to vary

on the online bin packing problem a new framework for analyzing online bin packing algorithms is presented this framework presents a unified way of explaining the performance of algorithms based on the harmonic approach within this framework it is shown that a new algorithm harmonic has asymptotic performance ratio at most 1 58889 it is also shown that the analysis of harmonic 1 presented in richey 1991 is incorrect this is a fundamental logical flaw not an error in calculation or an omitted case the asymptotic performance ratio of harmonic 1 is at least 1 59217 thus harmonic provides the best upper bound for the online bin packing problem to date

penalty techniques for state constrained optimal control problems with the wave equation we consider a system that is governed by a pde of hyperbolic type namely the wave equation and is controlled by a dirichlet boundary control for the penalization of terminal constraints we compare the convergence of three penalization techniques a differentiable penalty method an exact penalization and a smoothed exact penalization the error of the solution of the differentiably penalized problem is at most of the order 1 sqrt gamma where gamma is the penalty parameter the exact penalization yields the exact solution if gamma is sufficiently large if gamma is sufficiently large for the smoothed exact penalization we obtain an error bound of the order 1 sqrt beta where beta is the additional smoothing parameter this method yields differentiable objective functions that remain uniformly strongly convex since gamma need not tend to infinity to obtain convergence we also consider the penalization of distributed inequality state constraints that prescribe an upper bound for the l infty norm of the state we prove the convergence with respect to the l 2 norm for a penalization of the constraint violation measured in the l 1 norm we use this penalization technique to prove the existence of optimal controls for the inequality state constrained problem

exact controllability of scalar conservation laws with an additional control in the context of entropy solutions in this paper we study the exact controllability problem for nonlinear scalar conservation laws on a compact interval with a regular convex flux and in the framework of entropy solutions with the boundary data and a source term depending only on the time as controls we provide sufficient conditions for a state to be reachable in arbitrary small time to do so we introduce a slightly modified wave front tracking algorithm

largest j simplices in d cubes some relatives of the hadamard maximum determinant problem abstract this paper studies the computationally difficult problem of finding a largest j dimensional simplex in a given d dimensional cube the case in which j d is of special interest for it is equivalent to the hadamard maximum determinant problem it has been solved for infinitely many values of d but not for d 14 the subcase in which j d 3 mod 4 subsumes the famous problem on the existence of hadamard matrices the known results for the case j d are here summarized and used but the main focus is on fixed small values of j when j 1 the problem is trivial and when j 2 or j 3 it is here solved completely i e for all d beyond that the results are fragmentary but numerous and they lead to several attractive conjectures some other problems involving simplices in cubes are mentioned and the relationship of largest simplices to d optimal weighing designs is discussed

oleinik type estimates and uniqueness for n n conservation laws abstract let ut f u x 0 be a strictly hyperbolic n n system of conservation laws in one space dimension relying on the existence of a semigroup of solutions we first establish the uniqueness of entropy admissible weak solutions to the cauchy problem under a mild assumption on the local oscillation of u in a forward neighborhood of each point in the t x plane in turn this yields the uniqueness of weak solutions which satisfy a decay estimate on positive waves of genuinely nonlinear families thus extending a classical result proved by oleinik in the scalar case

optimal scaling of balls and polyhedra the concern is with solving as linear or convex quadratic programs special cases of the optimal containment and meet problems the optimal containment or meet problem is that of finding the smallest scale of a set for which some translation contains a set or meets each element in a collection of sets respectively these sets are unions or intersections of cells where a cell is either a closed polyhedral convex set or a closed solid ball

online algorithms for 1 space bounded 2 dimensional bin packing and square packing in this paper we study 1 space bounded 2 dimensional bin packing and square packing a sequence of rectangular items square items arrive one by one each item must be packed into a square bin of unit size on its arrival without any information about future items when packing items 90 rotation is allowed 1 space bounded means there is only one active bin if the active bin cannot accommodate the coming item it will be closed and a new bin will be opened the objective is to minimize the total number of bins used for packing all items in the sequence our contributions are as follows for 1 space bounded 2 dimensional bin packing we propose an online packing algorithm with a tight competitive ratio of 5 06 a lower bound of 3 17 on the competitive ratio is proven moreover we study 1 space bounded square packing where each item is a square with side length no more than 1 a 4 3 competitive algorithm is achieved and a lower bound of 2 94 on the competitive ratio is given all these bounds surpass the previously best known results

exact boundary controllability for quasi linear hyperbolic systems using a result on the existence and uniqueness of the semiglobal c1 solution to the mixed initial boundary value problem for first order quasi linear hyperbolic systems with general nonlinear boundary conditions we establish the exact boundary controllability for quasi linear hyperbolic systems if the c1 norm of initial and final states is small enough

time varying riemann solvers for conservation laws on networks abstract we consider a conservation law on a network and generic riemann solvers at nodes depending on parameters which can be seen as control functions assuming that the parameters have bounded variation as functions of time we prove existence of solutions to cauchy problems on the whole network

multivalued equations for granular avalanches we study existence and uniqueness for the scalar equation of first order hyperbolic type the rhs is in the form of a multifunction which is physically motivated by an avalanche flow model therefore some kind of monotonicity to the rhs has to be assumed

on the convergence rate of vanishing viscosity approximations given a strictly hyperbolic genuinely nonlinear system of conservation laws we prove the a priori boundu t u e t l1 o 1 1 t e ln e on the distance between an exact bv solution u and a viscous approximation u e letting the viscosity coefficient e 0 in the proof starting from u we construct an approximation of the viscous solution u e by taking a mollification u e and inserting viscous shock profiles at the locations of finitely many large shocks for each fixed e error estimates are then obtained by introducing new lyapunov functionals that control interactions of shock waves in the same family and also interactions of waves in different families c 2004 wiley periodicals inc

well posedness of balance laws with boundary consider the initial boundary value problem for a temple system of balance laws aim of this paper is to prove the well posedness of this problem for large times and without requiring the total variation of the initial data be small

on the boundary control of systems of conservation laws this paper is concerned with the boundary controllability of entropy weak solutions to hyperbolic systems of conservation laws we prove a general result on the asymptotic stabilization of a system near a constant state on the other hand we give an example showing that exact controllability in finite time cannot be achieved in general

on the attainable set for scalar nonlinear conservation laws with boundary control we consider the initial value problem with boundary control for a scalar nonlinear conservation law begin equation u t f u x 0 qquad qquad u 0 x 0 qquad u cdot 0 tilde u in cal u tag ast end equation on the domain omega t x in real 2 t geq 0 x geq 0 here u u t x is the state variable cal u is a set of bounded boundary data regarded as controls and f is assumed to be strictly convex we give a characterization of the set of attainable profiles at a fixed time t 0 and at a fixed point bar x 0 begin equation begin aligned rag u t cdot u hbox is a solution of ast ragx u cdot bar x u hbox is a solution of ast end aligned qquad quad cal u ellein bbb r end equation moreover we prove that rag and ragx are compact subsets of elleuno and elleuno loc respectively whenever cal u is a set of controls which pointwise satisfy closed convex constraints together with some additional integral inequalities

a simple on line bin packing algorithm the one dimensional on line bin packing problem is considered a simple o 1 space and o n time algorithm called harmonic m is presented it is shown that this algorithm can achieve a worst case performance ratio of less than 1 692 which is better than that of the o n space and o n log n time algorithm first fit also shown is that 1 691 is a lower bound for all 0 1 space on line bin packing algorithms finally a revised version of harmonic m an o n space and o n time algorithm is presented and is shown to have a worst case performance ratio of less than 1 636 d

l1 stability of spatially periodic solutions in relativistic gas dynamics this paper proves the well posedness of spatially periodic solutions of the relativistic isentropic gas dynamics equations the pressure is given by a law with initial data of large amplitude provided 1 is sufficiently small as a byproduct of our techniques we obtain the same results for the classical case at the limit c the solutions of the relativistic system converge to the solutions of the classical one the convergence rate being 1 c2 we also construct the semigroup of solutions of the cauchy problem for initial data with bounded total variation which can be large as long as 1 is small

boundary conditions for nonlinear hyperbolic systems of conservation laws we propose two formulations of the boundary conditions for nonlinear hyperbolic systems of conservation laws a first approach is based on the vanishing viscosity method and a second one is related to the riemann problem the equivalence between these two conditions is studied the latter formulation is extended to treat numerically physically relevant boundary conditions monodimensional experiments are presented

regularity and lyapunov stabilization of weak entropy solutions to scalar conservation laws we consider the problem of lyapunov boundary stabilization of the weak entropy solution to a scalar conservation law with strictly convex flux in one dimension of space around a uniform equilibrium we show that for a specific class of boundary conditions the solution to the initial boundary value problem for an initial condition with bounded variations can be approximated arbitrarily closely in the l 1 norm by a piecewise smooth solution with finitely many discontinuities the constructive method we present designs explicit boundary conditions in this class which guarantee lyapunov stability of the weak entropy solution to the initial boundary value problem we show how the greedy control obtained by maximizing the decrease of the natural lyapunov function may fail to asymptotically stabilize and a brute force control generates unbounded variation of traces we then design a stabilizing control which avoid oscillations and propose a nonlocal technique depending on time and the whole initial datum which optimizes the convergence time controllers performance is illustrated on numerical benchmarks using the godunov scheme