Blister Patterns and Energy Minimization in Compressed Thin Films on Compliant Substrates

This paper is motivated by the complex blister patterns sometimes seen in thin elastic films on thick, compliant substrates. These patterns are often induced by an elastic misfit that compresses the film. Blistering permits the film to expand locally, reducing the elastic energy of the system. It is therefore natural to ask: what is the minimum elastic energy achievable by blistering on a fixed area fraction of the substrate? This is a variational problem involving both the elastic deformation of the film and substrate and the geometry of the blistered region. It involves three small parameters: the nondimensionalized thickness of the film, the compliance ratio of the film/substrate pair, and the mismatch strain. In formulating the problem, we use a small‐slope (Föppl–von Kármán) approximation for the elastic energy of the film, and a local approximation for the elastic energy of the substrate. For a one‐dimensional version of the problem, we obtain “matching” upper and lower bounds on the minimum energy, in the sense that both bounds have the same scaling behavior with respect to the small parameters. The upper bound is straightforward and familiar: it is achieved by periodic blistering on a specific length scale. The lower bound is more subtle, since it must be proved without any assumption on the geometry of the blistered region. For a two‐dimensional version of the problem, our results are less complete. Our upper and lower bounds only “match” in their scaling with respect to the nondimensionalized thickness, not in the dependence on the compliance ratio and the mismatch strain. The lower bound is an easy consequence of our one‐dimensional analysis. The upper bound considers a two‐dimensional lattice of blisters and uses ideas from the literature on the folding or “crumpling” of a confined elastic sheet. Our main two‐dimensional result is that in a certain parameter regime, the elastic energy of this lattice is significantly lower than that of a few large blisters. © 2015 Wiley Periodicals, Inc.     

Wrinkles as the Result of Compressive Stresses in an Annular Thin Film

It is well‐known that an elastic sheet loaded in tension will wrinkle and that the length scale of the wrinkles tends to 0 with vanishing thickness of the sheet [Cerda and Mahadevan, Phys. Rev. Lett. 90, 074302 (2003)]. We give the first mathematically rigorous analysis of such a problem. Since our methods require an explicit understanding of the underlying (convex) relaxed problem, we focus on the wrinkling of an annular sheet loaded in the radial direction [Davidovitch et al., Proc. Natl. Acad. Sci. 108 (2011), 18227]. Our main achievement is identification of the scaling law of the minimum energy as the thickness of the sheet tends to 0. This requires proving an upper bound and a lower bound that scale the same way. We prove both bounds first in a simplified Kirchhoff‐Love setting and then in the nonlinear three‐dimensional setting. To obtain the optimal upper bound, we need to adjust a naive construction (one family of wrinkles superimposed on a planar deformation) by introducing a cascade of wrinkles. The lower bound is more subtle, since it must be ansatz‐free. © 2014 Wiley Periodicals, Inc.     

Energy Bounds for a Compressed Elastic Film on a Substrate

We study pattern formation in a compressed elastic film which delaminates from a substrate. Our key tool is the determination of rigorous upper and lower bounds on the minimum value of a suitable energy functional. The energy consists of two parts, describing the two main physical effects. The first part represents the elastic energy of the film, which is approximated using the von Kármán plate theory. The second part represents the fracture or delamination energy, which is approximated using the Griffith model of fracture. A simpler model containing the first term alone was previously studied with similar methods by several authors, assuming that the delaminated region is fixed. We include the fracture term, transforming the elastic minimisation into a free boundary problem, and opening the way for patterns which result from the interplay of elasticity and delamination. After rescaling, the energy depends on only two parameters: the rescaled film thickness, \({\sigma }\), and a measure of the bonding strength between the film and substrate, \({\gamma }\). We prove upper bounds on the minimum energy of the form \({\sigma }^a {\gamma }^b\) and find that there are four different parameter regimes corresponding to different values of a and b and to different folding patterns of the film. In some cases, the upper bounds are attained by self-similar folding patterns as observed in experiments. Moreover, for two of the four parameter regimes we prove matching, optimal lower bounds.     

Rigorous Bounds for the Föppl—von Kármán Theory of Isotropically Compressed Plates

Summary. We study the F?ppl—von Kármán theory for isotropically compressed thin plates in a geometrically linear setting, which is commonly used to model weak buckling of thin films. We consider generic smooth domains with clamped boundary conditions, and obtain rigorous upper and lower bounds on the minimum energy linear in the plate thickness σ . This energy is much lower than previous estimates based on certain dimensional reductions of the problem, which had lead to energies of order 1+σ (scalar approximation) or σ ^2/3 (two-component approximation). Received August 7, 2000; accepted September 8, 2000 %%%Online publication November 15, 2000 Communicated by Robert V. Kohn     

Coarsening of Folds in Hanging Drapes

We consider the elastic energy of a hanging drape—a thin elastic sheet, pulled down by the force of gravity, with fine‐scale folding at the top that achieves approximately uniform confinement. This example of energy‐driven pattern formation in a thin elastic sheet is of particular interest because the length scale of folding varies with height. We focus on how the minimum elastic energy depends on the physical parameters. As the sheet thickness vanishes, the limiting energy is due to the gravitational force and is relatively easy to understand. Our main accomplishment is to identify the “scaling law” of the correction due to positive thickness. We do this by (i) proving an upper bound, by considering the energies of several constructions and taking the best; and (ii) proving an ansatz‐free lower bound, which agrees with the upper bound up to a parameter‐independent prefactor. The coarsening of folds in hanging drapes has also been considered in the recent physics literature, by using a self‐similar construction whose basic cell has been called a “wrinklon.” Our results complement and extend that work by showing that self‐similar coarsening achieves the optimal scaling law in a certain parameter regime, and by showing that other constructions (involving lateral spreading of the sheet) do better in other regions of parameter space. Our analysis uses a geometrically linear Föppl‐von Kármán model for the elastic energy, and is restricted to the case when Poisson's ratio is 0. © 2016 Wiley Periodicals, Inc.     

半无穷平面到半无穷长圆管的低雷诺数流动

本文利用匹配法和配置法求出了粘性流体从半无穷平面到半无穷长圆管的Stokes流动的无穷级数形式的解.结果表明,经过圆柱半径的一半路程之后,速度剖面和Poiseuille剖面只差1%.初始段长度比Dagan的有限长圆管情形显著缩短,在孔口外的半无穷空间内,孔口右边的边界只对孔口附近一倍管径的区域有强烈影响.在此以外的区域内几乎没有影响.此外,本文还对压力和流量的关系进行了研究.     

Large deviations and the generalized processor sharing scheduling for a multiple-queue system

We establish asymptotic upper and lower bounds on the asymptotic decay rate of per-session queue length tail distributions for a multiple-queue system where a single constant rate server services the queues using the generalized processor sharing (GPS) scheduling discipline. In the special case where there are only two queues, the upper and lower bounds match, yielding the optimal bound proved in [15]. The dynamics of bandwidth sharing of a multiple-queue GPS system is captured using the notion of partial feasible sets, and the bounds are obtained using the sample-path large deviation principle. The results have implications in call admission control for high-speed communication networks. This revised version was published online in June 2006 with corrections to the Cover Date.     

Free Energy Wells and Overlap Gap Property in Sparse PCA

We study a variant of the sparse PCA (principal component analysis) problem in the “hard” regime, where the inference task is possible yet no polynomial-time algorithm is known to exist. Prior work, based on the low-degree likelihood ratio, has conjectured a precise expression for the best possible (subexponential) runtime throughout the hard regime. Following instead a statistical physics-inspired point of view, we show bounds on the depth of free energy wells for various Gibbs measures naturally associated to the problem. These free energy wells imply hitting time lower bounds that corroborate the low-degree conjecture: we show that a class of natural MCMC (Markov chain Monte Carlo) methods (with worst-case initialization) cannot solve sparse PCA with less than the conjectured runtime. These lower bounds apply to a wide range of values for two tuning parameters: temperature and sparsity misparametrization. Finally, we prove that the overlap gap property (OGP), a structural property that implies failure of certain local search algorithms, holds in a significant part of the hard regime. © 2022 Wiley Periodicals, Inc.     

Lower Bounds on the (Laplacian) Spectral Radius of Weighted Graphs

The weighted graphs, where the edge weights are positive numbers, are considered. The authors obtain some lower bounds on the spectral radius and the Laplacian spectral radius of weighted graphs, and characterize the graphs for which the bounds are attained. Moreover, some known lower bounds on the spectral radius and the Laplacian spectral radius of unweighted graphs can be deduced from the bounds.     

Norm bounds and underestimators for unconstrained polynomial integer minimization

We consider the problem of minimizing a polynomial function over the integer lattice. Though impossible in general, we use a known sufficient condition for the existence of continuous minimizers to guarantee the existence of integer minimizers as well. In case this condition holds, we use sos programming to compute the radius of a p-norm ball which contains all integer minimizers. We prove that this radius is smaller than the radius known from the literature. Our numerical results show that the number of potentially optimal solutions is reduced by several orders of magnitude. Furthermore, we derive a new class of underestimators of the polynomial function. Using a Stellensatz from real algebraic geometry and again sos programming, we optimize over this class to get a strong lower bound on the integer minimum. Also our lower bounds are evaluated experimentally. They show a good performance, in particular within a branch and bound framework.     

Quantum mechanics and the hydrogen atom in a generalized Wigner-Seitz cell

We investigate the energy spectrum of a nonrelativistic quantum particle and a hydrogen-like atom placed in a vacuum cavity with general boundary conditions ensuring confinement. When these conditions, as in the Wigner-Seitz model, admit a large amplitude of the wave function on the boundary of the cavity, a nonperturbative rearrangement of lower energy levels of the spectrum occurs, which is essentially different from the case of the confinement by a potential barrier. A nontrivial role in this spectrum rearrangement is played by the von Neumann-Wigner effect of repulsion of nearby levels. For such a confined state of a hydrogen-like atom in a spherical cavity of radius R with the boundary formed by a potential layer of depth d, we show that the lowest energy level of the atom has a pronounced minimum at physically meaningful layer parameters and that the binding energy can be much greater than E _1s , the energy of the 1s level of a free-standing atom, and that the regime where the atom binding is much greater than E _1s becomes possible for a cavity with R ～ 10–100 nm.     

On Upper Bounds for Minimum Distance and Covering Radius of Non-binary Codes

We consider upper bounds on two fundamental parameters of a code; minimum distance and covering radius. New upper bounds on the covering radius of non-binary linear codes are derived by generalizing a method due to S. Litsyn and A. Tietäväinen lt:newu and combining it with a new upper bound on the asymptotic information rate of non-binary codes. The upper bound on the information rate is an application of a shortening method of a code and is an analogue of the Shannon-Gallager-Berlekamp straight line bound on error probability. These results improve on the best presently known asymptotic upper bounds on minimum distance and covering radius of non-binary codes in certain intervals.     

Uniform Slip Flow on a Cylinder

In this paper, we determine the shear stress along the entire length of a stationary cylinder having radius a, under uniform axisymmetric flow, with velocity U0, in the slip regime. Investigating motion at small and large axial distances, we employ asymptotic series techniques to obtain the shear stress coefficient in non-dimensional form. For intermediate regions, we obtain a solution using the Rayleigh approximation method. (© 2010 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

正交各向异性圆柱体在轴压作用下的应力场

基于材料体积不可压假设,对轴向压缩作用下圆柱试件在加载面内的环向和径向应力分布进行理论分析,计算结果表明:当试件材料本构为正交各向异性时,环向和径向应力分布为半径的幂函数形式;试件材料为横观各向同性时,环向和径向应力为半径的二次函数.在圆柱试件轴线上环向和径向应力相等,且均具有最大值;试件圆周边界上径向应力为0,环向应力具有极小值.通过最大拉伸应变破坏理论对试件环向应变进行分析,获得了产生环向拉伸破坏时的临界轴向载荷;并采用Hill-蔡强度理论对试件圆周边界上计算得到的应力参量进行描述,得到了轴压作用下圆柱试件的Hill-蔡强度理论表达式,其不仅取决于轴向应力和试件材料的基本力学性能,还与试件轴向变形的应变率及应变率随时间的变化率相关.     

Growth estimates for sine-type-functions and applications to Riesz bases of exponentials

We present explicit estimates for the growth of sine-type-functions as well as for the derivatives at theirzero sets, thus obtaining explicit constants in a result of Levin. The estimates are then used to derive explicitlower bounds for exponential Riesz bases, as they arise in Avdonin's Theorem on 1/4 in the mean or in alower bounds of exponential Riesz bases is desirable.     

Sharp upper and lower bounds for the Laplacian spectral radius and the spectral radius of graphs

In this paper, sharp upper bounds for the Laplacian spectral radius and the spectral radius of graphs are given, respectively. We show that some known bounds can be obtained from our bounds. For a bipartite graph G, we also present sharp lower bounds for the Laplacian spectral radius and the spectral radius, respectively.     

Fast rotating Bose-Einstein condensates in an asymmetric trap

We investigate the effect of the anisotropy of a harmonic trap on the behaviour of a fast rotating Bose-Einstein condensate. This is done in the framework of the 2D Gross-Pitaevskii equation and requires a symplectic reduction of the quadratic form defining the energy. This reduction allows us to simplify the energy on a Bargmann space and study the asymptotics of large rotational velocity. We characterize two regimes of velocity and anisotropy; in the first one where the behaviour is similar to the isotropic case, we construct an upper bound: a hexagonal Abrikosov lattice of vortices, with an inverted parabola profile. The second regime deals with very large velocities, a case in which we prove that the ground state does not display vortices in the bulk, with a 1D limiting problem. In that case, we show that the coarse grained atomic density behaves like an inverted parabola with large radius in the deconfined direction but keeps a fixed profile given by a Gaussian in the other direction. The features of this second regime appear as new phenomena.     

Extremal graph characterization from the upper bound of the Laplacian spectral radius of weighted graphs

We consider weighted graphs, where the edge weights are positive definite matrices. In this paper, we obtain two upper bounds on the spectral radius of the Laplacian matrix of weighted graphs and characterize graphs for which the bounds are attained. Moreover, we show that some known upper bounds on the Laplacian spectral radius of weighted and unweighted graphs can be deduced from our upper bounds.     

Extremal graph characterization from the bounds of the spectral radius of weighted graphs

We consider weighted graphs, where the edge weights are positive definite matrices. The eigenvalues of a graph are the eigenvalues of its adjacency matrix. We obtain a lower bound and an upper bound on the spectral radius of the adjacency matrix of weighted graphs and characterize graphs for which the bounds are attained.     

Stability with the axial compression of an axisymmetrically heated orthotropic cylindrical shell fastened to an elastic cylinder which is pliable with respect to shear

The article gives a solution to the problem of stability with the axial compression of an axisymmetrically heated orthotropic cylindrical shell fastened to an elastic thin-walled cylinder through an intermediate layer. It is assumed that the parameters of the elasticity of the orthotropic shell depend on the temperature, and vary over the thickness of the wall. The intermediate layer is assumed to be isotropic and absolutely rigid in a radial direction, but pliable with respect to axial shear. The thin-walled cylinder is considered to be elastic, isotropic, and unheated.Scientific-Research Institute for Chemical Engineering, Moscow Region. Translated from Mekhanika Polimerov, No. 3, pp. 546–550, May–June, 1970.