Transient analysis of nonlinear problems in structural and solid mechanics is mainly carried out using direct time integration of the equations of motion. For reliable solutions, a stable and efficient integration algorithm is desirable. Methods that are unconditionally stable in linear analyses appear to be a natural choice for use in nonlinear analyses, but unfortunately may not remain stable...

Solution of the diffusion equation is usually performed with the finite element discretization for the spatial elliptic part of the equation and the time dependency is integrated via some difference scheme, often the trapezoidal rule (Crank-Nicolson) or the unconditionally stable semi-implicit two-step algorithm of Lees. A common procedure is to use Picard’s iteration with the trapezoidal rule....

In this paper, a due date assignment scheduling problem with precedence constraints and controllable processing times in uncertain environment is investigated, in which the basic processing time of each job is assumed to be the symmetric trapezoidal fuzzy number, and the linear resource consumption function is used.The objective is to minimize the crisp possibilistic mean (or expected) value of...

The problem to find the nearest trapezoidal approximation of a fuzzy number with respect to a well-knownmetric, which preserves the expected interval of the fuzzy number, is completely solved. The previously proposed approximation operators are improved so as to always obtain a trapezoidal fuzzy number. Properties of this new trapezoidal approximation operator are studied. © 2007 Elsevier B.V. ...

The nearest trapezoidal fuzzy number to a fuzzy number, with respect to a well-known metric and preserving the expected interval, was determined in recent articles. In the present paper the properties of additivity and continuity of the trapezoidal approximation operator are studied. Keywords— Additivity, Approximation, Continuity, Fuzzy number, Trapezoidal fuzzy number.

A path-following algorithm for industrial robots is presented in this paper. The algorithm generates off-line a joint space point-to-point trajectory that, by exploiting knowledge of the dynamic model, takes into account the actuators’ torque limits while preserving the geometric path. Due to the software characteristic of the specific industrial architecture, the trajectories adopt a trapezoid...

We investigate the I/O-complexity of computing the trapezoidal decomposition deened by a set of N line segments in the plane. We present a randomized algorithm which solves optimally this problem requiring O(N B log M=B N B + K B) expected I/O operations, where K is the number of pairwise intersections, M is the size of available internal memory and B is the size of the block transfer. The prop...