On a 1-D Model of Stress Relaxation in an Annealed Glass

A 1-D model of a slab of glass of a small thickness is considered. The governing equations are those of the classical 1-D linear viscoelasticity. A load due to the temperature gradients is assumed. The aim is to model the process called annealing. It is shown that an additional load due to structural strain is crucial for the success of the model. Algorithms of a numerical solution of the governing equations are proposed. Numerical results are presented and commented.     

On the Gauss-Newton method for l1 orthogonal distance regression

The problem of fitting a curve or surface to data has many applications.There are also many fitting criteria which can be used, andone which is widely used in metrology, for example, is thatof minimizing the least squares norm of the orthogonal distancesfrom the data points to the curve or surface. The Gauss–Newtonmethod, in correct separated form, is a popular method for solvingthis problem. There is also interest in alternatives to leastsquares, and here we focus on the use of the l₁ norm, whichis traditionally regarded as important when the data containwild points. The effectiveness of the Gauss–Newton methodin this case is studied, with particular attention given tothe influence of zero distances. Different aspects of the computationare illustrated by consideration of two particular fitting problems.     

On the distribution of the number of customers in the symmetric M/G/1 queue

We consider an M/G/1 queue with symmetric service discipline. The class of symmetric service disciplines contains, in particular, the preemptive last-come-first-served discipline and the processor-sharing discipline. It has been conjectured in Kella et al. [1] that the marginal distribution of the queue length at any time is identical for all symmetric disciplines if the queue starts empty. In this paper we show that this conjecture is true if service requirements have an Erlang distribution. We also show by a counterexample, involving the hyperexponential distribution, that the conjecture is generally not true. AMS Subject Classifications Primary—60K25; Secondary—90B22     

On the use of consistent approximations in the solution of semi-infinite optimization and optimal control problems

The purpose of this study is to broaden the scope of projective transformation methods in mathematical programming, both in terms of theory and algorithms. We start by generalizing the concept of the analytic center of a polyhedral system of constraints to the w-center of a polyhedral system, which stands for weighted center, where there is a positive weight on the logarithmic barrier term for each inequality constraint defining the polyhedronX. We prove basic results regarding contained and containing ellipsoids centered at the w-center of the systemX. We next shift attention to projective transformations, and we exhibit an elementary projective transformation that transforms the polyhedronX to another polyhedronZ, and that transforms the current interior point to the w-center of the transformed polyhedronZ. We work throughout with a polyhedral system of the most general form, namely both inequality and equality costraints.This theory is then applied to the problem of finding the w-center of a polyhedral systemX. We present a projective transformation algorithm, which is an extension of Karmarkar's algorithm, for finding the w-center of the systemX. At each iteration, the algorithm exhibits either a fixed constant objective function improvement, or converges superlinearly to the optimal solution. The algorithm produces upper bounds on the optimal value at each iteration. The direction chosen at each iteration is shown to be a positively scaled Newton direction. This broadens a result of Bayer and Lagarias regarding the connection between projective transformation methods and Newton's method. Furthermore, the algorithm specializes to Vaidya's algorithm when used with a line-search, and so shows that Vaidya's algorithm is superlinearly convergent as well. Finally, we show how the algorithm can be used to construct well-scaled containing and contained ellipsoids at near-optimal solutions to the w-center problem.This paper is a revision of the two papers Projective transformations for interior point methods, part I: Basic theory and linear programming, O.R. working paper 179-88 and Projective transformations for interior point methods, part II: Analysis of an algorithm for finding the weighted center of a polyhedral system, O.R. working paper 180-88, M.I.T.     

On an Augmented Lagrangian SQP Method for a Class of Optimal Control Problems in Banach Spaces

An augmented Lagrangian SQP method is discussed for a class of nonlinear optimal control problems in Banach spaces with constraints on the control. The convergence of the method is investigated by its equivalence with the generalized Newton method for the optimality system of the augmented optimal control problem. The method is shown to be quadratically convergent, if the optimality system of the standard non-augmented SQP method is strongly regular in the sense of Robinson. This result is applied to a test problem for the heat equation with Stefan-Boltzmann boundary condition. The numerical tests confirm the theoretical results.     

On the stress distribution in a rectangular thick plate of a composite material with curved structure under forced vibration

The stress distribution in a rectangular plate of a multilayer composite material with a periodically curved structure under forced vibration is studied. It is assumed that the plate is hinge supported at opposite sides. The investigation is carried out within the exact three-dimensional linear theory of elasticity. The mechanical relationships of the plate material are described by the continuum theory of Akbarov and Guz'. The numerical results obtained by the finite element method show that even in low-frequency dynamic loading of the plate the extreme values of stresses, which appear as a result of the curving in the plate structure, considerably exceed those in the corresponding static loading.Institute of Mathematics and Mechanics, Academy of Sciences of Azerbaijan, Baku, Azerbaijan. Translated from Mekhanika Kompozitnykh Materialov, Vol. 35, No. 4, pp. 447–454, July–August, 1999.     

On the Finite Element Analysis of Problems with Nonlinear Newton Boundary Conditions in Nonpolygonal Domains

The paper is concerned with the study of an elliptic boundary value problem with a nonlinear Newton boundary condition considered in a two-dimensional nonpolygonal domain with a curved boundary. The existence and uniqueness of the solution of the continuous problem is a consequence of the monotone operator theory. The main attention is paid to the effect of the basic finite element variational crimes: approximation of the curved boundary by a polygonal one and the evaluation of integrals by numerical quadratures. With the aid of some important properties of Zlamal's ideal triangulation and interpolation, the convergence of the method is analyzed.     

剩余寿命增补变量法在排队模型M/GI/1/K中的应用

本文尝试用剩余寿命作为增补变量，建立了经典排队模型M／GI／1／K的密度演化方程，并应用递归的方法得到了模型队长平稳分布的精确解．     

On the efficiency of Newton and Broyden numerical methods in the investigation of the regular polygon problem of (N + 1) bodies

Numerical methods of finding the roots of a system of non-linear algebraic equations are treated in this paper. This paper attempts to give an answer to the selection of the most efficient method in a complex problem of Celestial Dynamics, the so-called ring problem of (N + 1) bodies. We apply Newton and Broyden’s method to these problems and we investigate, by means of their use, the planar equilibrium points, the five equilibrium zones, which are symbolized by A₁, A₂, B, C₂, and C₁ (by order of appearance from the center O to the periphery of the imaginary circle on which the primaries lie) [T.J. Kalvouridis, A planar case of the N + 1 body problem: the ring problem. Astrophys. Space Sci. 260 (3) (1999) 309-325], and the attracting regions of the system. The efficiency of these methods is studied through a comparative process. The obtained results are demonstrated in figures and are discussed.     

On the behavio r of complete g raphs in $${\mathbb{R}\sp{n+1}}$$ with Lp-finite r-cu rvatu re

We study the behavior of complete graphs in with L ^p -finite r-curvature, that is, whose length of the r-th Newton transformation |P _r | is in L ^p , for some p ≥ 1. Moreover, we use a monotonicity formulae to establish an L ^p -lower bound for |P _r | in balls. As application, we prove some new Bernstein-type results.