Curvature analysis of roller-follower cam mechanisms

The equations related to the curvature analysis of the roller-follower cam mechanisms are presented for roller surfaces being revolution surface, hyperboloidal surface, and globoidal surface. These equations give the expressions of the meshing function, the limit function of the first kind, and the limit function of the second kind. Once these functions are known, the principal curvatures of the cam surface, the relative normal curvatures of contacting surfaces, and the condition of undercutting can be derived. Three particular cam mechanisms with hyperboloidal roller are illustrated and the numerical comparison between 2-D and 3-D cam is given.     

Stiffness and damping models for the oil film in line contact elastohydrodynamic lubrication and applications in the gear drive

Innovative stiffness and damping models for oil films are developed to account for the impacts in both normal and tangential directions. Given that these models are applied to a gear drive in line contact elastohydrodynamic lubrication (EHL), the combined stiffness is derived from the stiffness of both the oil film and gear tooth while the combined damping is established from the damping of these parts. The effects of three fundamental parameters (contact force, rotation speed, and tooth numbers) of the gear drive in line contact EHL on the combined stiffness and damping are then investigated. The results reveal that the small normal and tangential stiffness of the lubricant can alleviate meshing impact and shear vibration, while the impact and friction heat can be reduced by using an oil film with either a large normal damping or small tangential damping. Given that its amplitude and fluctuation are closely related to shear rate, effective viscosity, entrainment velocity, and curvature radii, the improved combined stiffness and damping can be obtained by rationally matching the geometric and operating parameters.     

Static contact analysis of spiral bevel gear based on modified VFIFE (vector form intrinsic finite element) method

Since the intrinsic limitations of FEM (Finite element method) and lumped-mass method, we derive the formula of 8-node hexahedral element based on VFIFE (vector form intrinsic finite element method) method and applied it in contact analysis of gears. This paper proposed a new method to determine pure nodal deformation, which could simplify the computation compared to the traditional VFIFE method. Combining the VFIFE method and matching contact algorithm, we analyzed spiral bevel gear meshing problems. Spiral bevel models with two different mesh densities are calculated analyzed by the VFIFE method and FEM. Performance indicators of gears are extracted and compared, including contact forces, contact and bending stresses, contact stress patterns and loaded transmission errors. The results show that the VFIFE method has a stable performance and reliable accuracy under coarse or refined mesh conditions, while the FEM inaccurately calculates the contact stress of the coarse mesh model. The examples demonstrate that the proposed method could precisely analyze gear meshing problems with a coarse mesh model, which provides a new solution for gear mechanics.     

Rational Functions and Association Scheme Parameters

The parameters of metric, cometric, symmetric association schemes with q ± 1 (the same as the parameters of the underlying orthogonal polynomials) can be given in general by evaluating a single rational function of degree (4, 4) in the complex variable q ^j. But in all known examples, save the simple n-gons, these reduce to polynomials of degree at most 2 in q ^j with q an integer. One reason this occurs is that the rational function can have singularities at points which would determine some of the parameters. This paper deals with the case in which not all of the singularities are removable, thus giving some reason why the n-gons might naturally be the only exceptions to schemes with parameters being polynomials of degree at most 2 in q ^j , except possibly for schemes of very small diameter.     

On modelling and analysis of gear drives with nonlinear couplings

The paper deals with modelling of vibration of shaft systems with gears and rolling-element bearings using the modal synthesis method with DOF number reduction. The influence of the nonlinear bearing and gearing contact forces with the possibility of the contact interruption is respected. The gear drive nonlinear vibrations caused by internal excitation generated in gear meshing, accompanied by impact and chaotic motions are studied. The theory is applied to a simple test-gearbox. (© 2006 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Quadrilateral surface meshes without self-intersecting dual cycles for hexahedral mesh generation

Several promising approaches for hexahedral mesh generation work as follows: Given a prescribed quadrilateral surface mesh they first build the combinatorial dual of the hexahedral mesh. This dual mesh is converted into the primal hexahedral mesh, and finally embedded and smoothed into the given domain. Two such approaches, the modified whisker weaving algorithm by Folwell and Mitchell, as well as a method proposed by the author, rely on an iterative elimination of certain dual cycles in the surface mesh. An intuitive interpretation of the latter method is that cycle eliminations correspond to complete sheets of hexahedra in the volume mesh.

Although these methods can be shown to work in principle, the quality of the generated meshes heavily relies on the dual cycle structure of the given surface mesh. In particular, it seems that difficulties in the hexahedral meshing process and poor mesh qualities are often due to self-intersecting dual cycles. Unfortunately, all previous work on quadrilateral surface mesh generation has focused on quality issues of the surface mesh alone but has disregarded its suitability for a high-quality extension to a three-dimensional mesh.

In this paper, we develop a new method to generate quadrilateral surface meshes without self-intersecting dual cycles. This method reuses previous b-matching problem formulations of the quadrilateral mesh refinement problem. The key insight is that the b-matching solution can be decomposed into a collection of simple cycles and paths of multiplicity two, and that these cycles and paths can be consistently embedded into the dual surface mesh.

A second tool uses recursive splitting of components into simpler subcomponents by insertion of internal two-manifolds. We show that such a two-manifold can be meshed with quadrilaterals such that the induced dual cycle structure of each subcomponent is free of self-intersections if the original component satisfies this property. Experiments show that we can achieve hexahedral meshes with a good quality.     

Approximation of singularly perturbed reaction-diffusion problems by quadratic C 1-splines

Collocation with quadratic C ¹-splines for a singularly perturbed reaction-diffusion problem in one dimension is studied. A modified Shishkin mesh is used to resolve the layers. The resulting method is shown to be almost second order accurate in the maximum norm, uniformly in the perturbation parameter. Furthermore, a posteriori error bounds are derived for the collocation method on arbitrary meshes. These bounds are used to drive an adaptive mesh moving algorithm. Numerical results are presented.     

Direct analytical solution of a modified form of the meshing equations in two dimensions for non-conjugate gear contact

The current technological state-of-the-art utilises modified gear profiles, which are in part non-conjugate and therefore cannot be analysed using standard conjugate contact theory. Existing non-conjugate mathematical models require the solution of a system of implicit equations, typically with significant computational effort and need for careful monitoring of solution stability, convergence and selection of initial values. This paper derives a modified form for the fundamental gear meshing equations, which are reduced analytically to a single scalar equation, resulting in improved solution speed and stability. The solution is verified in benchmark tests using real gear geometries.     

Switched modified function projective synchronization of hyperchaotic Qi system with uncertain parameters

This work is involved with switched modified function projective synchronization of two identical Qi hyperchaotic systems using adaptive control method. Switched synchronization of chaotic systems in which a state variable of the drive system synchronize with a different state variable of the response system is a promising type of synchronization as it provides greater security in secure communication. Modified function projective synchronization with the unpredictability of scaling functions can enhance security. Recently formulated hyperchaotic Qi system in the hyperchaotic mode has an extremely broad frequency bandwidth of high magnitudes, verifying its unusual random nature and indicating its great potential for some relevant engineering applications such as secure communications. By Lyapunove stability theory, the adaptive control law and the parameter update law are derived to make the state of two chaotic systems modified function projective synchronized. Synchronization under the effect of noise is also considered. Numerical simulations are presented to demonstrate the effectiveness of the proposed adaptive controllers.     

Meshing skin surfaces with certified topology

Skin surfaces are used for the visualization of molecules. They form a class of tangent continuous surfaces defined in terms of a set of balls (the atoms of the molecule) and a shrink factor. More recently, skin surfaces have been used for approximation purposes.

We present an algorithm that approximates a skin surface with a topologically correct mesh. The complexity of the mesh is linear in the size of the Delaunay triangulation of the balls, which is worst case optimal.

We also adapt two existing refinement algorithms to improve the quality of the mesh and show that the same algorithm can be used for meshing a union of balls.     

Planar mesh refinement cannot be both local and regular

We show that two desirable properties for planar mesh refinement techniques are incompatible. Mesh refinement is a common technique for adaptive error control in generating unstructured planar triangular meshes for piecewise polynomial representations of data. Local refinements are modifications of the mesh that involve a fixed maximum amount of computation, independent of the number of triangles in the mesh. Regular meshes are meshes for which every interior vertex has degree 6. At least for some simple model meshing problems, optimal meshes are known to be regular, hence it would be desirable to have a refinement technique that, if applied to a regular mesh, produced a larger regular mesh. We call such a technique a regular refinement. In this paper, we prove that no refinement technique can be both local and regular. Our results also have implications for non-local refinement techniques such as Delaunay insertion or Rivara's refinement. Received August 1, 1996 / Revised version received February 28, 1997     

CONVERGENCE PROPERTIES OF A MODIFIED BFGS ALGORITHM FOR MINIMIZATION WITHARMIJO-GOLDSTEIN STEPLENGTHS

1.IntroductionAssumethatwearefindingtheminimizerofthefollowingunconstrainedoptimizationproblemminf(x),(1.1)acReandassumethecurrentpointisxk'TOcalculatexk 1fromxkbyalinesearchmethod,thefollowingiterationXk 1~Xk Akpk,k~1,2,'(1.2)isapplied.IntheBFGSal...     

SINGLE PROJECTION ALGORITHM FOR VARIATIONAL INEQUALITIES IN BANACH SPACES WITH APPLICATION TO CONTACT PROBLEM

We study the single projection algorithm of Tseng for solving a variational inequality problem in a 2-uniformly convex Banach space. The underline cost function of the variational inequality is assumed to be monotone and Lipschitz continuous. A weak convergence result is obtained under reasonable assumptions on the variable step-sizes. We also give the strong convergence result for when the underline cost function is strongly monotone and Lipchitz continuous. For this strong convergence case, the proposed method does not require prior knowledge of the modulus of strong monotonicity and the Lipschitz constant of the cost function as input parameters, rather, the variable step-sizes are diminishing and non-summable. The asymptotic estimate of the convergence rate for the strong convergence case is also given. For completeness, we give another strong convergence result using the idea of Halpern's iteration when the cost function is monotone and Lipschitz continuous and the variable step-sizes are bounded by the inverse of the Lipschitz constant of the cost function.Finally, we give an example of a contact problem where our proposed method can be applied.     

Combined unstructured and hanging-node-based remeshing with boundary control for metal forming simulations

During finite element simulation of metal forming process, the mesh which represents the workpiece undergoes extreme large deformation, which could result in highly distorted mesh and numerical failure in simulation. To overcome the problem and improve computation efficiency, advancing front quad meshing technique and non–conforming mesh refinement approach are combined to generate new mesh according to desired mesh size distribution. Application of the combined remeshing strategy to rolling simulation will be presented. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Isotopic Implicit Surface Meshing

This paper addresses the problem of piecewise linear approximation of implicit surfaces. We first give a criterion ensuring that the zero-set of a smooth function and the one of a piecewise linear approximation of it are isotopic. Then, we deduce from this criterion an implicit surface meshing algorithm certifying that the output mesh is isotopic to the actual implicit surface. This is the first algorithm achieving this goal in a provably correct way.     

Parametric Reduction of FE Models with Variable Mesh Topology

Designing whole machines or processes you may need both, an integrated dynamic simulation of all components on system level and a detailed analysis of how the macroscopic behavior of a component depends on geometry and material parameters. The former analysis is usually based on systems of differential algebraic equations representing a component by not more than a few hundred states and requires tools like Matlab-Simulink® or Dymola®. The latter analysis solves discretized partial differential equations with several 100,000 degrees of freedom using finite element software like Ansys® or Comsol®. Model reduction bridges the gap between the two worlds providing small state space models with approximately the same input-output behavior as the original large finite element models. Building systems from generic components, e.g. a gas transport network from pipeline models with variable length, or optimizing the design of a device with respect to mechanical or thermal properties, we need parametric reduced models. The idea is to reduce FE models offline for selected parameter sets and to generate models for new parameters by cheap interpolation rather than expensive reduction. The different approaches to parametric linear model reduction may be divided into three classes [1]. Interpolation of transfer functions is well suited for parabolic or highly damped hyperbolic problems. However, poles are duplicated rather than shifted, which is unacceptable for weakly damped hyperbolic problems like in mechanics. The second class of methods look for a basis of state space covering system behavior over the full range of parameters. They share the critical assumption that number and meaning of states do not change with the parameters. In terms of finite elements this means that the meshes for different design parameters are morphed variants of the same reference mesh.This may become a severe restriction in practice when automatic meshing is to be applied to complicated geometries. Therefore, we propose a method from the third class, which is based on interpolating reduced system matrices [2]. Only those parts of the mesh need to share a constant topology where nodal inputs are applied and outputs are collected. The inner mesh, however, may change for different parameters. The main challenges arise from the fact that state space representations of a system are unique only up to a change of basis and that interpolating matrices which refer to non-fitting bases may cause arbitrary errors. In the article we will show how problems like leaving and entering modes or eigenvalue crossing can be overcome by using normal forms and eigenvalue tracking in parameter space. The method, which is implemented in the Fraunhofer Model Reduction Toolbox, is applied to a parametric model of a mechanical device the eigenfrequencies of which have to be kept away from some dominant excitation frequencies. (© 2014 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Kinetostatic analysis of variable lead screw mechanisms with 3° conic frustum meshing elements

The main concern of this paper is the theoretical kinetostatic analysis of a variable lead screw mechanism (VLSM) used in high speed shuttleless weaving looms. The mechanism consists of a slider-crank submechanism, with four conic frustum meshing elements (with a 3° conical angle) installed in the slider to drive the oscillatory motion of the variable lead screw. It is the spatial cam joint between the meshing elements and the screw. Then, d'Alembert's principle and theory of conjugate surfaces are applied to develop the models for the kinetostatic analysis; models for analyzing the frictional forces of various kinematic joints are also implemented. The result is a set of 27 nonlinear equations with 27 unknowns. The power equation is also applied to analyze the input and dissipated power of the VLSM, its results are also used to check the correctness of solutions to the nonlinear equation set. The VLSM is analyzed for a specified constant input speed or a measured state of motion of the crank. The results show that the peak input power and the peak input torque at constant input velocity are almost twice that of their values at nonconstant input velocities. There are obvious changes in the bearing loads when the slider is at both of its limit positions due to the change in the directions of the frictional forces.     

Bayesian binary regression involving two explanatory variables

Summary The purpose of the present paper is to propose a practical Bayesian procedure for the estimation of binary response probability where the explanatory variable is bivariate. The procedure is an extension of the procedure for univariate case which was proposed by the present authors [2] and is based on a model which approximates the logistic transformation of response probability by a quadratic orthogonal spline function on the two-dimensional space of explanatory variable. The flexibility of the model is guaranteed by assuming a spline function on sufficiently fine mesh. To obtain stable estimates we introduce a prior distribution of the parameters of the model. The prior distribution has several parameters (hyper-parameters) which are chosen to minimize an Bayesian information criterion ABIC. The procedure is applicable cable to cases where each explanatory variable takes continuous values provided that the probability of the occurrence changes smoothly. The practical utility of the procedure is demonstrated by examples of applications to five sets of data. The Institute of Statistical Mathematics     

On the sizes of Delaunay meshes

Let be a polyhedral domain occupying a convex volume. We prove that the size of a graded mesh of with bounded vertex degree is within a factor of the size of any Delaunay mesh of with bounded radius-edge ratio. The term depends on the geometry of and it is likely a small constant when the boundaries of are fine triangular meshes. There are several consequences. First, among all Delaunay meshes with bounded radius-edge ratio, those returned by Delaunay refinement algorithms have asymptotically optimal sizes. This is another advantage of meshing with Delaunay refinement algorithms. Second, if no input angle is acute, the minimum Delaunay mesh with bounded radius-edge ratio is not much smaller than any minimum mesh with aspect ratio bounded by a particular constant.     

Quad mesh generation for k-sided faces and hex mesh generation for trivalent polyhedra

Two mesh generation methods are presented in this paper: one for quadrilateral meshing of faces with convex vertices but an arbitrary number of sides, the other hexahedral meshing of polyhedra with convex edges, vertices connected to three edges and an arbitrary number of faces each of which has at least three sides. Efficient mapping methods for determining nodal positions are developed based on an extension to transfinite mapping and it is shown that these are identical to those obtained by iterative isoparametric smoothing.