Finite element aided design evolution of composite leaf spring

This paper shows the process of the virtual production development of the mechanical connection between the top leaf of a dual composite leaf spring system to a shackle using finite element methods. The commercial FEA package MSC/MARC has been used for the analysis. In the original design the joint was based on a closed eye-end. Full scale testing results showed that this configuration achieved the vertical proof load of 150 kN and 1 million cycles of fatigue load. However, a problem with delamination occurred at the interface between the fibres going around the eye and the main leaf body. To overcome this problem, a second design was tried using transverse bandages of woven glass fibre reinforced tape to wrap the section that is prone to delaminate. In this case, the maximum interlaminar shear stress was reduced by a certain amount but it was still higher than the material’s shear strength. Based on the fact that, even with delamination, the top leaf spring still sustained the maximum static and fatigue loads required, the third design was proposed with an open eye-end, eliminating altogether the interface where the maximum shear stress occurs. The maximum shear stress predicted by FEA is reduced significantly and a safety factor of around 2 has been obtained. Thus, a successful and safe design has been achieved.

Global exponential periodicity of a class of bidirectional associative memory networks with finite distributed delays

In this paper, we study the periodic oscillatory behavior of a class of bidirectional associative memory (BAM) networks with finite distributed delays. A set of criteria are proposed for determining global exponential periodicity of the proposed BAM networks, which assume neither differentiability nor monotonicity of the activation function of each neuron. In addition, our criteria are easily checkable. (c) 2005 Elsevier Inc. All rights reserved.

An efficient finite difference scheme for three-dimensional, non-equilibrium flows using operator splitting

An efficient finite difference scheme is presented for the inviscid terms of the three-dimensional, compressible flow equations for chemical non-equilibrium gases. This scheme represents an extension and an improvement of one proposed by the author, and includes operator splitting.

A TVD finite difference scheme with non-uniform meshes and without upstream weighting

We present a finite difference scheme, with the TVD (total variation diminishing) property, for scalar conservation laws. The scheme applies to non-uniform meshes, allowing for variable mesh spacing, and is without upstream weighting. When applied to systems of conservation laws, no scalar decomposition is required, nor are any artificial tuning parameters, and this leads to an efficient, robust algorithm.

A finite difference scheme for inviscid flows with non-eequilibrium chemistry and internal energy

A finite difference scheme is presented for the inviscid terms of the equations of compressible fluid dynamics with general non-equilibrium chemistry and internal energy.

A finite difference scheme for steady, supersonic, two-dimensional, compressible flow of real gases

A finite difference scheme is presented for the solution of the two-dimensional equations of steady, supersonic, compressible flow of real gases. The scheme incorparates numerical characteristic decomposition, is shock-capturing by design and incorporates space-marching as a result of the assumption that the flow is wholly supersonic in at least one space dimension. Results are shown for problems involving oblique hydraulic jumps and reflection from a wall.

Finite- N effects for ideal polymer chains near a flat impenetrable wall

This paper addresses the statistical mechanics of ideal polymer chains next to a hard wall. The principal quantity of interest, from which all monomer densities can be calculated, is the partition function, G N(z) , for a chain of N discrete monomers with one end fixed a distance z from the wall. It is well accepted that in the limit of infinite N , G N(z) satisfies the diffusion equation with the Dirichlet boundary condition, G N(0) = 0 , unless the wall possesses a sufficient attraction, in which case the Robin boundary condition, G N(0) = - x G N ′(0) , applies with a positive coefficient, x . Here we investigate the leading N -1/2 correction, D G N(z) . Prior to the adsorption threshold, D G N(z) is found to involve two distinct parts: a Gaussian correction (for z <~Unknown control sequence '\lesssim' aN 1/2 with a model-dependent amplitude, A , and a proximal-layer correction (for z <~Unknown control sequence '\lesssim' a described by a model-dependent function, B(z).

An Exponentially Convergent Nonpolynomial Finite Element Method for Time-Harmonic Scattering from Polygons

In recent years nonpolynomial finite element methods have received increasing attention for the efficient solution of wave problems. As with their close cousin the method of particular solutions, high efficiency comes from using solutions to the Helmholtz equation as basis functions. We present and analyze such a method for the scattering of two-dimensional scalar waves from a polygonal domain that achieves exponential convergence purely by increasing the number of basis functions in each element. Key ingredients are the use of basis functions that capture the singularities at corners and the representation of the scattered field towards infinity by a combination of fundamental solutions. The solution is obtained by minimizing a least-squares functional, which we discretize in such a way that a matrix least-squares problem is obtained. We give computable exponential bounds on the rate of convergence of the least-squares functional that are in very good agreement with the observed numerical convergence. Challenging numerical examples, including a nonconvex polygon with several corner singularities, and a cavity domain, are solved to around 10 digits of accuracy with a few seconds of CPU time. The examples are implemented concisely with MPSpack, a MATLAB toolbox for wave computations with nonpolynomial basis functions, developed by the authors. A code example is included.

Bernoulli free-boundary problems in strip-like domains and a property of permanent waves on water of finite depth

We study weak solutions for a class of free-boundary problems which includes as a special case the classical problem of travelling gravity waves on water of finite depth. We show that such problems are equivalent to problems in fixed domains and study the regularity of their solutions. We also prove that in very general situations the free boundary is necessarily the graph of a function.

A moving-mesh finite element method and its application to the numerical solution of phase-change problems

A distributed Lagrangian moving-mesh finite element method is applied to problems involving changes of phase. The algorithm uses a distributed conservation principle to determine nodal mesh velocities, which are then used to move the nodes. The nodal values are obtained from an ALE (Arbitrary Lagrangian-Eulerian) equation, which represents a generalization of the original algorithm presented in Applied Numerical Mathematics, 54:450--469 (2005). Having described the details of the generalized algorithm it is validated on two test cases from the original paper and is then applied to one-phase and, for the first time, two-phase Stefan problems in one and two space dimensions, paying particular attention to the implementation of the interface boundary conditions. Results are presented to demonstrate the accuracy and the effectiveness of the method, including comparisons against analytical solutions where available.

Optimum decision delay of the finite-length DFE

This work investigates the optimum decision delay and tap-length of the finite-length decision feedback equalizer. First we show that, if the feedback filter (FBF) length Nb is equal to or larger than the channel memory v and the decision delay Δ is smaller than the feedforward filter (FFF) length Nf, then only the first Δ+1 elements of the FFF can be nonzero. Based on this result we prove that the maximum effective FBF length is equal to the channel memory v, and if Nb ≥ v and Nf is long enough, the optimum decision delay that minimizes the MMSE is Nf-1.