A WKB analysis of the buckling condition for a cylindrical shell of arbitrary thickness subjected to an external pressure

We consider the plane-strain buckling of a cylindrical shellof arbitrary thickness which is made of a Varga material andis subjected to an external hydrostatic pressure on its outersurface. The WKB method is used to solve the eigenvalue problemthat results from the linear bifurcation analysis. We show thatthe circular cross-section buckles into a non-circular shapeat a value of µ₁ which depends on A₁/A₂ and a mode number,where A₁ and A₂ are the undeformed inner and outer radii, andµ₁ is the ratio of the deformed inner radius to A₁. Inthe large mode number limit, we find that the dependence ofµ₁ on A₁/A₂ has a boundary layer structure: it is constantover almost the entire region of 0 < A₁/A₂ < 1 and decreasessharply from this constant value to unity as A₁/A₂ tends tounity. Our asymptotic results for A₁ – 1 = O(1) and A₁– 1 = O(1/n) are shown to agree with the numerical resultsobtained by using the compound matrix method.     

Zero Dissipative, Explicit Numerov-Type Methods for Second Order IVPs with Oscillating Solutions

New explicit, zero dissipative, hybrid Numerov type methods are presented in this paper. We derive these methods using an alternative which avoids the use of costly high accuracy interpolatory nodes. We only need the Taylor expansion at some internal points then. The method is of sixth algebraic order at a cost of seven stages per step while their phase lag order is fourteen. The zero dissipation condition is satisfied, so the methods possess an non empty interval of periodicity. Numerical results over some well known problems in physics and mechanics indicate the superiority of the new method.     

Local Feasible QP-Free Algorithms for the Constrained Minimization of SC1 Functions

We consider the problem of minimizing an SC¹ function subject to inequality constraints. We propose a local algorithm whose distinguishing features are that: (a) a fast convergence rate is achieved under reasonable assumptions that do not include strict complementarity at the solution; (b) the solution of only linear systems is required at each iteration; (c) all the points generated are feasible. After analyzing a basic Newton algorithm, we propose some variants aimed at reducing the computational costs and, in particular, we consider a quasi-Newton version of the algorithm.     

Absorbing boundary conditions for reaction-diffusion equations

We treat here of the question of absorbing boundary conditionsfor nonlinear diffusion equations. We use the conditions designedfor the linear equation, we prove them to be well posed forthe nonlinear problem, and through numerical experiments thatthey are well suited for reaction–diffusion equations.     

CAP-子群与p-幂零性

设G是有限群。H是G的一个正规子群。P是|H|的一个素因子。P是H的一个Sylow p-子群。若下列条件之一满足。则H是p-幂零：1)P的极大子群都是G的CAP-子群且(|H|，P-1)=1；2)P的二次极大子群都是G的CAP-子群且(|H|，P^2-1)=1。特别地，若进一步假设G／H为P-幂零且(|G|，P-1)=1或(|G|，P^2-1)=1。则G自身亦为P-幂零。     

Tomographic reconstruction using heuristic Monte Carlo methods

A tomographic reconstruction method based on Monte Carlo random searching guided by the information contained in the projections of radiographed objects is presented. In order to solve the optimization problem, a multiscale algorithm is proposed to reduce computation. The reconstruction is performed in a coarse-to-fine multigrid scale that initializes each resolution level with the reconstruction of the previous coarser level, which substantially improves the performance. The method was applied to a real case reconstructing the internal structure of a small metallic object with internal components, showing excellent results.     

A model study for the steady state error of numerical approximations of inviscid flow equations on Cartesian grid

The widely used locally adaptive Cartesian grid methods involve a series of abruptly refined interfaces. In this paper we consider the influence of the refined interfaces on the steady state errors for second‐order three‐point difference approximations of flow equations. Since the various characteristic components of the Euler equations should behave similarly on such grids with regard to refinement‐induced errors, it is sufficient enough to conduct the analysis on a scalar model problem. The error we consider is a global error, different to local truncation error, and reflects the interaction between multiple interfaces. The steady state error will be compared to the errors on smooth refinement grids and on uniform grids. The conclusion seems to support the numerical findings of Yamaleev and Carpenter (J. Comput. Phys. 2002; 181: 280–316) that refinement does not necessarily reduce the numerical error. Copyright © 2005 John Wiley & Sons, Ltd.     

On computation of the greatest common divisor of several polynomials over a finite field

We propose a probabilistic algorithm to reduce computing the greatest common divisor of m polynomials over a finite field (which requires computing m−1 pairwise greatest common divisors) to computing the greatest common divisor of two polynomials over the same field.     

On the degree of convergence of lemniscates in finite connected domains

For an arbitrary bounded closed set E in the complex plane with complement Ω of finite connectivity, we study the degree of convergence of the lemniscates in Ω.