Symmetry breaking in a localized interacting binary Bose-Einstein condensate in a bichromatic optical lattice

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Matter-wave localization in a random potential

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

The tangential variation of a localized flux-type eigenvalue problem

In this work the differentiability of the principal eigenvalue lambda = lambda(1)(Gamma) to the localized Steklov problem -Delta u + qu = 0 in Omega, partial derivative u/partial derivative nu = lambda chi(Gamma)(x)u on partial derivative Omega, where Gamma subset of partial derivative Omega is a smooth subdomain of partial derivative Omega and chi(Gamma) is its characteristic function relative to partial derivative Omega, is shown. As a key point, the flux subdomain Gamma is regarded here as the variable with respect to which such differentiation is performed. An explicit formula for the derivative of lambda(1) (Gamma) with respect to Gamma is obtained. The lack of regularity up to the boundary of the first derivative of the principal eigenfunctions is a further intrinsic feature of the problem. Therefore, the whole analysis must be done in the weak sense of H(1)(Omega). The study is of interest in mathematical models in morphogenesis. (C) 2011 Elsevier Inc. All rights reserved.

Quantitative stability of linear infinite inequality systems under block perturbations with applications to convex systems

The original motivation for this paper was to provide an efficient quantitative analysis of convex infinite (or semi-infinite) inequality systems whose decision variables run over general infinite-dimensional (resp. finite-dimensional) Banach spaces and that are indexed by an arbitrary fixed set J. Parameter perturbations on the right-hand side of the inequalities are required to be merely bounded, and thus the natural parameter space is l ∞(J). Our basic strategy consists of linearizing the parameterized convex system via splitting convex inequalities into linear ones by using the Fenchel–Legendre conjugate. This approach yields that arbitrary bounded right-hand side perturbations of the convex system turn on constant-by-blocks perturbations in the linearized system. Based on advanced variational analysis, we derive a precise formula for computing the exact Lipschitzian bound of the feasible solution map of block-perturbed linear systems, which involves only the system’s data, and then show that this exact bound agrees with the coderivative norm of the aforementioned mapping. In this way we extend to the convex setting the results of Cánovas et al. (SIAM J. Optim. 20, 1504–1526, 2009) developed for arbitrary perturbations with no block structure in the linear framework under the boundedness assumption on the system’s coefficients. The latter boundedness assumption is removed in this paper when the decision space is reflexive. The last section provides the aimed application to the convex case.

Lower semicontinuity of the feasible set mapping of linear systems relative to their domains

This paper deals with stability properties of the feasible set of linear inequality systems having a finite number of variables and an arbitrary number of constraints. Several types of perturbations preserving consistency are considered, affecting respectively, all of the data, the left-hand side data, or the right-hand side coefficients.

On the stability of the Motzkin representation of closed convex sets

A set is called Motzkin decomposable when it can be expressed as the Minkowski sum of a compact convex set with a closed convex cone. This paper analyzes the continuity properties of the set-valued mapping associating to each couple (C,D) formed by a compact convex set C and a closed convex cone D its Minkowski sum C + D. The continuity properties of other related mappings are also analyzed.

Calmness modulus of linear semi-infinite programs

Our main goal is to compute or estimate the calmness modulus of the argmin mapping of linear semi-infinite optimization problems under canonical perturbations, i.e., perturbations of the objective function together with continuous perturbations of the right-hand side of the constraint system (with respect to an index ranging in a compact Hausdorff space). Specifically, we provide a lower bound on the calmness modulus for semi-infinite programs with unique optimal solution which turns out to be the exact modulus when the problem is finitely constrained. The relationship between the calmness of the argmin mapping and the same property for the (sub)level set mapping (with respect to the objective function), for semi-infinite programs and without requiring the uniqueness of the nominal solution, is explored, too, providing an upper bound on the calmness modulus of the argmin mapping. When confined to finitely constrained problems, we also provide a computable upper bound as it only relies on the nominal data and parameters, not involving elements in a neighborhood. Illustrative examples are provided.

The Use of the Relative Interior in Integration with Nonconvex Data

Introducing an appropriate inclusion between approximate minima associated with two nonconvex functions, we derive explicit relations between the closed convex hulls of these functions. The formula we obtain goes beyond the so-called epi-pointed property of functions which is usually concerned with such a topic.

Calmness of the Feasible Set Mapping for Linear Inequality Systems

In this paper we deal with parameterized linear inequality systems in the n-dimensional Euclidean space, whose coefficients depend continuosly on an index ranging in a compact Hausdorff space. The paper is developed in two different parametric settings: the one of only right-hand-side perturbations of the linear system, and that in which both sides of the system can be perturbed. Appealing to the backgrounds on the calmness property, and exploiting the specifics of the current linear structure, we derive different characterizations of the calmness of the feasible set mapping, and provide an operative expresion for the calmness modulus when confined to finite systems. In the paper, the role played by the Abadie constraint qualification in relation to calmness is clarified, and illustrated by different examples. We point out that this approach has the virtue of tackling the calmness property exclusively in terms of the system’s data.

Stability in Linear Optimization Under Perturbations of the Left-Hand Side Coefficients

This paper studies stability properties of linear optimization problems with finitely many variables and an arbitrary number of constraints, when only left hand side coefficients can be perturbed. The coefficients of the constraints are assumed to be continuous functions with respect to an index which ranges on certain compact Hausdorff topological space, and these properties are preserved by the admissible perturbations. More in detail, the paper analyzes the continuity properties of the feasible set, the optimal set and the optimal value, as well as the preservation of desirable properties (boundedness, uniqueness) of the feasible and of the optimal sets, under sufficiently small perturbations.

Calculus of Variations with Classical and Fractional Derivatives

MSC 2010: 49K05, 26A33

Dense Subdifferentiability and Trustworthiness for Arbitrary Subdifferentials

2000 Mathematics Subject Classification: 49J52, 49J50, 58C20, 26B09.

Problems in Algebraic Vision

Thesis (Ph.D.)--University of Washington, 2016-08

Variational Asymptotic Analysis of a Self-healing SMA Composite

A Shape Memory Alloy (SMA) wire reinforced composite shell structure is analyzed for self-healing characteristic using Variational Asymptotic Method (VAM). SMA behavior is modeled using a onedimensional constitutive model. A pre-notched specimen is loaded longitudinally to simulate crack propagation. The loading process is accompanied by martensitic phase transformation in pre-strained SMA wires, bridging the crack. To heal the composite, uniform heating is required to initiate reverse transformation in the wires and bringing the crack faces back into contact. The pre-strain in the SMA wires used for reinforcement, causes a closure force across the crack during reverse transformation of the wires under heating. The simulation can be useful in design of self-healing composite structures using SMA. Effect of various parameters, like composite and SMA material properties and the geometry of the specimen, on the cracking and self-healing can also be studied.

CROSS-SECTIONAL ANALYSIS OF PRE-TWISTED THICK BEAMS USING VARIATIONAL ASYMPTOTIC METHOD

An asymptotically-exact methodology is presented for obtaining the cross-sectional stiffness matrix of a pre-twisted moderately-thick beam having rectangular cross sections and made of transversely isotropic materials. The anisotropic beam is modeled from 3-D elasticity, without any further assumptions. The beam is allowed to have large displacements and rotations, but small strain is assumed. The strain energy of the beam is computed making use of the constitutive law and the kinematical relations derived with the inclusion of geometrical nonlinearities and initial twist. Large displacements and rotations are allowed, but small strain is assumed. The Variational Asymptotic Method is used to minimize the energy functional, thereby reducing the cross section to a point on the reference line with appropriate properties, yielding a 1-D constitutive law. In this method as applied herein, the 2-D cross-sectional analysis is performed asymptotically by taking advantage of a material small parameter and two geometric small parameters. 3-D strain components are derived using kinematics and arranged as orders of the small parameters. Warping functions are obtained by the minimization of strain energy subject to certain set of constraints that renders the 1-D strain measures well-defined. Closed-form expressions are derived for the 3-D non-linear warping and stress fields. The model is capable of predicting interlaminar and transverse shear stresses accurately up to first order.