Synthesis of Spherical Four-Bar Function Generators to Match Two Prescribed Velocity Ratios

1983 ◽  
Vol 105 (4) ◽  
pp. 631-636 ◽  
Author(s):  
C. H. Chiang

The present problem is a variation of synthesizing spherical four-bar function generators to coordinate three pairs of finitely separated crank-angle displacements. It is to be stressed here that, since the technique is on the basis of equations of three relative poles, the characteristic equation is simply a quadratic equation in the unknown tan ψo (initial output crank angle). It is not necessary, as in the case of a characteristic equation derived from displacement equations, to resort to techniques such as iterative methods for solving nonlinear equations. Equations are so presented as to facilitate computer programing. The synthesis of spherical crank-rockers is a special case of the present problem.

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Tahereh Eftekhari

Based on iterative methods without memory of eighth-order convergence proposed by Thukral (2012), some iterative methods with memory and high efficiency index are presented. We show that the order of convergence is increased without any additional function evaluations. Numerical comparisons are made to show the performance of the presented methods.


2007 ◽  
Vol 48 (3) ◽  
pp. 343-359 ◽  
Author(s):  
Sergio Amat ◽  
Sonia Busquier ◽  
Sergio Plaza

AbstractWe study the dynamics of a family of third-order iterative methods that are used to find roots of nonlinear equations applied to complex polynomials of degrees three and four. This family includes, as particular cases, the Chebyshev, the Halley and the super-Halleyroot-finding algorithms, as well as the so-called c-methods. The conjugacy classes of theseiterative methods are found explicitly.


2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Gustavo Fernández-Torres ◽  
Juan Vásquez-Aquino

We present new modifications to Newton's method for solving nonlinear equations. The analysis of convergence shows that these methods have fourth-order convergence. Each of the three methods uses three functional evaluations. Thus, according to Kung-Traub's conjecture, these are optimal methods. With the previous ideas, we extend the analysis to functions with multiple roots. Several numerical examples are given to illustrate that the presented methods have better performance compared with Newton's classical method and other methods of fourth-order convergence recently published.


Sign in / Sign up

Export Citation Format

Share Document