Kinematic Synthesis of Adjustable Mechanisms—Part 1: Function Generation

1973 ◽  
Vol 95 (2) ◽  
pp. 417-422 ◽  
Author(s):  
Joseph F. McGovern ◽  
George N. Sandor
Keyword(s):  
Complex Number ◽  
Relative Orientation ◽  
Complex Numbers ◽  
Input Output ◽  
Kinematic Synthesis ◽  
Digital Computation ◽  
Closed Form Solutions ◽  
Function Generation ◽  
Planar Linkages ◽  
Adjustable Mechanisms

One of the major advantages of linkages over cams is the ease with which they can be adjusted to modify their output. Incorporating an adjustment into the design of a linkage makes it possible to make a selection from two, three, or more different outputs by simply making the adjustment. Adjustable mechanisms make it possible to use the same hardware for different input-output relationships. The adjustment considered in this paper is the changing of a fixed pivot location. This paper presents a method of synthesizing adjustable planar linkages for function generation with finitely separated precision points and higher order synthesis involving prescribed velocities, accelerations, and higher accelerations. The method of synthesis is analytical with closed form solutions and utilizes complex numbers. The method is programmed for automatic digital computation. The linkages considered are a four-bar, a geared five-bar, and a geared six-bar mechanism. Examples include adjustable mechanisms which have been successfully synthesized with the method developed here. Future extensions of the complex number method to include adjustment by changing the length of a link and by changing of the relative orientation of the gears in geared linkages are outlined.

Kinematic Synthesis of Adjustable Mechanisms—Part 2: Path Generation

1973 ◽  
Vol 95 (2) ◽  
pp. 423-429 ◽  
Author(s):  
Joseph F. McGovern ◽  
George N. Sandor
Keyword(s):  
Closed Form ◽  
Higher Order ◽  
Complex Numbers ◽  
Path Generation ◽  
Function Generator ◽  
Kinematic Synthesis ◽  
Closed Form Solutions ◽  
Straight Line ◽  
Adjustable Mechanisms

A method utilizing complex numbers similar to that used in Part 1 for adjustable function generator synthesis is applied to the synthesis of adjustable path generators. Finitely separated path points with prescribed timing as well as higher order approximations (infinitesimally separated path points) are treated, by way of analytical and closed form solutions. Adjustment of the path generator mechanism is accomplished by moving a fixed pivot. Mechanisms adjustable for different approximate straight line motions, for various path curvatures, and path tangents as well as several arbitrary paths can be synthesized. Four-bar and geared five-bar mechanisms are considered. Examples are included describing synthesized mechanisms.

New Complex-Number Forms of the Euler-Savary Equation in a Computer-Oriented Treatment of Planar Path-Curvature Theory for Higher-Pair Rolling Contact

1982 ◽  
Vol 104 (1) ◽  
pp. 227-232 ◽  
Author(s):  
G. N. Sandor ◽  
A. G. Erdman ◽  
L. Hunt ◽  
E. Raghavacharyulu
Keyword(s):  
Complex Number ◽  
Rolling Contact ◽  
Radius Of Curvature ◽  
Planar Mechanisms ◽  
Kinematic Synthesis ◽  
Synthesis Of Mechanisms ◽  
Curvature Theory ◽  
Path Curvature ◽  
Planar Linkages ◽  
Contact Mechanism

It is well known from the theory of Kinematic Synthesis of planar mechanisms that the Euler-Savary Equation (ESE) gives the radius of curvature and the center of curvature of the path traced by a point in a planar rolling-contact mechanism. It can also be applied in planar linkages for which equivalent roll-curve mechanisms can be found. Typical example: the curvature of the coupler curve of a four-bar mechanism. Early works in the synthesis of mechanisms concerned themselves with deriving the ESE by means of combined graphical and algebraic techniques, using certain sign conventions. These sign conventions often become sources of error. In this paper new complex-number forms of the Euler-Savary Equation are derived and are presented in a computer-oriented format. The results are useful in the application of path-curvature theory to higher-pair rolling contact mechanisms, such as cams, gears, etc., as well as linkages, once the key parameters of an equivalent rolling-contact mechanism are known. The complex-number technique has the advantage of eliminating the need for the traditional sign conventions and is suitable for digital computation. An example is presented to illustrate this.

Finite Kinematic Synthesis of a Cycloidal-Crank Mechanism for Function Generation

1970 ◽  
Vol 92 (3) ◽  
pp. 531-535 ◽  
Author(s):  
S. N. Kramer ◽  
G. N. Sandor
Keyword(s):  
Closed Form ◽  
Closed Form Solution ◽  
Optimization Method ◽  
Gear Ratio ◽  
Form Solution ◽  
Complex Numbers ◽  
Kinematic Synthesis ◽  
Function Generation ◽  
Approximate Function ◽  
Crank Mechanism

The method of complex numbers is applied towards the kinematic synthesis of a planar geared five-bar cycloidal-crank mechanism for approximate function generation with finitely separated precision points. It is shown that up to 10 precision points can be obtained, and a closed-form solution is presented which yields up to 6 different mechanisms with a 6-point approximation. In this method, the designer has control over the design of the cycloidal crank regarding gear ratio and configuration. The method has been programmed for automatic digital computation on the IBM-360 system, and the program is made available to interested readers. An optimization method utilizing iterative application of the closed-form solution is outlined.

Kinematic Synthesis of a Geared Five-Bar Function Generator

1971 ◽  
Vol 93 (1) ◽  
pp. 11-16 ◽  
Author(s):  
Arthur G. Erdman ◽  
George N. Sandor
Keyword(s):  
Computer Program ◽  
Closed Form ◽  
Complex Numbers ◽  
Function Generator ◽  
Kinematic Synthesis ◽  
Numerical Examples ◽  
Function Generation ◽  
Structural Error ◽  
Dependent Variables ◽  
Angular Displacements

A general closed form method of planar kinematic synthesis, using complex numbers to represent link vectors, is applied to the synthesis of a geared five-bar linkage for function generation. Equations are derived and a computer program is developed to yield several solutions. Angular displacements of the input, a cycloidal crank, and the output, a simple follower, are used as linear analogs of the independent and the dependent variables, respectively. A method is demonstrated for six precision conditions (three first, three second-order precision conditions). Numerical examples are included, and the structural error of these geared five-bars are compared to that of optimized four-bar linkages generating the same functions.

scholarly journals Winding Numbers, Unwinding Numbers, and the Lambert W Function

2021 ◽  
Author(s):  
A. F. Beardon
Keyword(s):  
Complex Plane ◽  
Complex Number ◽  
Lambert W Function ◽  
Complex Numbers ◽  
Winding Number ◽  
Line Integral ◽  
Complex Functions

AbstractThe unwinding number of a complex number was introduced to process automatic computations involving complex numbers and multi-valued complex functions, and has been successfully applied to computations involving branches of the Lambert W function. In this partly expository note we discuss the unwinding number from a purely topological perspective, and link it to the classical winding number of a curve in the complex plane. We also use the unwinding number to give a representation of the branches $$W_k$$ W k of the Lambert W function as a line integral.

Encircling Graphs

2017 ◽  
Author(s):  
Arthur Benjamin ◽  
Gary Chartrand ◽  
Ping Zhang
Keyword(s):  
Nineteenth Century ◽  
Real Number ◽  
Traveling Salesman Problem ◽  
Complex Number ◽  
Traveling Salesman ◽  
Complex Numbers ◽  
Real Numbers ◽  
Hamiltonian Graphs ◽  
The World ◽  
The Traveling Salesman Problem

This chapter considers Hamiltonian graphs, a class of graphs named for nineteenth-century physicist and mathematician Sir William Rowan Hamilton. In 1835 Hamilton discovered that complex numbers could be represented as ordered pairs of real numbers. That is, a complex number a + b i (where a and b are real numbers) could be treated as the ordered pair (a, b). Here the number i has the property that i² = -1. Consequently, while the equation x² = -1 has no real number solutions, this equation has two solutions that are complex numbers, namely i and -i. The chapter first examines Hamilton's icosian calculus and Icosian Game, which has a version called Traveller's Dodecahedron or Voyage Round the World, before concluding with an analysis of the Knight's Tour Puzzle, the conditions that make a given graph Hamiltonian, and the Traveling Salesman Problem.

scholarly journals The generalized criterion of multiaxial random fatigue based on conception proposed by prof. Macha

2019 ◽  
Vol 300 ◽  
pp. 15001
Author(s):  
Tadeusz Łagoda ◽  
Marta Kurek ◽  
Karolina Łagoda
Keyword(s):  
Shear Stress ◽  
Complex Number ◽  
Mathematical Problem ◽  
Equivalent Stress ◽  
Complex Stress ◽  
Complex Numbers ◽  
Pure Bending ◽  
Pure Torsion ◽  
Special Cases ◽  
Random Fatigue

This criterion has been repeatedly verified, analyzed and special cases of this criterion reducing complex stress to equivalent uniaxial were taken into account. Since both normal and shear stress are vectors, we encounter the mathematical problem of adding these vectors, and the question arises how to understand the obtained equivalent stress, because two perpendicular vectors are added with weighting factors. Therefore, in this work it was proposed to adopt a system of complex numbers. Normal stress was defined as the real part and shear stress as imaginary part. As a result, on the basis of the defined complex number and basing on pure bending and pure torsion after transformations, the expression for equivalent stress was identical to the previously proposed criteria defined on the basis of the concept of prof. Macha.

Finding All Solutions to Unconstrained Nonlinear Optimization for Approximate Synthesis of Planar Linkages Using Continuation Method

1999 ◽  
Vol 121 (3) ◽  
pp. 368-374 ◽  
Author(s):  
A.-X. Liu ◽  
T.-L. Yang
Keyword(s):  
Continuation Method ◽  
Optimization Method ◽  
Global Optimum ◽  
Kinematic Synthesis ◽  
All Solutions ◽  
Approximate Synthesis ◽  
Unconstrained Nonlinear Optimization ◽  
Optimum Solution ◽  
Planar Linkages ◽  
Four Bar Linkage

Generally, approximate kinematic synthesis of planar linkage is studied using optimization method. But this method has two defects: i) the suitable initial guesses are hard to determine and ii) the global optimum solution is difficult to find. In this paper, a new method which can find all solutions to approximate kinematic synthesis of planar linkage is proposed. Firstly, we reduce the approximate synthesis problem to finding all solutions to polynomial equations. Polynomial continuation method is then used to find all solutions. Finally, all possible linkages can be obtained. Approximate syntheses of planar four-bar linkage for function generation, rigid-body guidance and path generation are studied in detail and three examples are given to illustrate the advantages of the proposed method.

scholarly journals Definite Integral of Algebraic, Exponential and Hyperbolic Functions Expressed in Terms of Special Functions

Mathematics ◽  
2020 ◽  
Vol 8 (9) ◽  
pp. 1425
Author(s):  
Robert Reynolds ◽  
Allan Stauffer
Keyword(s):  
Closed Form ◽  
Special Function ◽  
Special Functions ◽  
Complex Numbers ◽  
Definite Integral ◽  
Hyperbolic Functions ◽  
Closed Form Solutions ◽  
Definite Integrals ◽  
Arbitrary Complex ◽  
Famous Book

While browsing through the famous book of Bierens de Haan, we came across a table with some very interesting integrals. These integrals also appeared in the book of Gradshteyn and Ryzhik. Derivation of these integrals are not listed in the current literature to best of our knowledge. The derivation of such integrals in the book of Gradshteyn and Ryzhik in terms of closed form solutions is pertinent. We evaluate several of these definite integrals of the form ∫0∞(a+y)k−(a−y)keby−1dy, ∫0∞(a+y)k−(a−y)keby+1dy, ∫0∞(a+y)k−(a−y)ksinh(by)dy and ∫0∞(a+y)k+(a−y)kcosh(by)dy in terms of a special function where k, a and b are arbitrary complex numbers.

scholarly journals Complex Number Vedic Multiplier and its Implementation in a Filter

2018 ◽  
Vol 7 (2.24) ◽  
pp. 336
Author(s):  
N Saraswathi ◽  
Lokesh Modi ◽  
Aatish Nair
Keyword(s):  
Complex Number ◽  
Digital Signal ◽  
Digital Signal Processors ◽  
Complex Numbers ◽  
Fast Speed ◽  
Vedic Multiplier ◽  
X 32 ◽  
Signal Processors ◽  
Complex Multiplier ◽  
Mathematical Process

Complex numbers multiplication is a fundamental mathematical process in systems like digital signal processors (DSP). The main     objective of complex number multiplication is to perform operations at lightning fast speed with less intake of power. In this paper, the best possible architecture is designed for a Real vedic multiplier based on the ancient Indian mathematical procedure known as URDHVA TIRYAKBHYAM SUTRA i.e. the structure of a MxM Vedic real multiplier architecture is developed. Then, a Vedic real multiplier solution of a complex multiplier is presented and its simulation results are obtained. The MxM Vedic real multiplier architecture, architecture of the Real Vedic  multiplier solution for 32 x 32 bit complex numbers multiplication of complex multiplier and the architecture of a FIR filter has been code in Verilog and implementation is done through Modelsim 5.6 and Xilinx ISE 7.1 navigator. 

Sign in / Sign up

Export Citation Format

Share Document