In this paper, we propose a new two-parameter class of iterative methods to solve a nonlinear equation. It is proved that any method in this class is cubically convergent if and only if the parameters sum up to one. Some of the existing third-order methods, by suitable selection of parameters, can be put in this class. Every iteration of the class requires an evaluation of the function, three o...

Stereophotometric computer vision is based on the inversion of an equation system which represents the physical reflection phenomenon under different lighting conditions. In noisy conditions, the system has generally no solution, and the typical way to solve it is to find the solution which minimizes some error function. This paper proposes a new approach to deal with this system, using the so-...

The root is an important plant part contributing to peanut productivity underwater-limited conditions. Root volume, root surface area and root diameter may becharacters responding to pre-flowering drought (PFD) in peanut. The objectives ofthis study were to investigate the responses to PFD for root surface area, rootvolume and root diameter and to determine the inter-relationships among theresp...

In th is paper, we present a fifth-order method for find ing mult iple zeros of nonlinear equations. Per iteration, the new method requires two evaluations of functions and two of its first derivative. It is proved that the method has a convergence of order five. Finally, some numerical examples are g iven to show the performance of the presented method, and compared with some known methods.

Algorithms for polynomial real root isolation are ubiquitous in computational real algebraic geometry but few lower bounds are known for their maximum computing time functions. One exception is the continued fractions method due to Vincent (1836) and recommended by Uspensky (1948). Collins and Akritas (1976) proved that the maximum computing time of the method is at least exponential in the len...

Kontakt: [email protected], [email protected] Results We store the attributes of Q in that pixel and shade it afterwards using our Global Illumination framework. Our algorithm operates on local surface intervals of homogeneous curvature. We thus first create a Labeled Homogeneous Curvature Map, containing unique IDs for each homogeneously curved region per pixel. We assign each scene...

Numerical methods for bifurcation problems of the form (*) Ly = Xf(y), By = 0, where/(0) = 0 and /'(0) ^ 0, are considered. Here y is a scalar function, A. is a real scalar, L is a linear differential operator and By = 0 represents some linear homogeneous two-point boundary conditions. Under certain assumptions, it is shown that if (*) is replaced by an appropriate difference scheme, then there...

Changing variables is a useful tool that appears in many guises in computer graphics and geometric modeling. Changing the variables allows us to change the way we traverse a curve or surface, change their derivatives or place or interpret textures and other properties associated with them. In calculus, changing variables miraculously converts hard integration problems into simple standard ones ...

In this paper new fourth order optimal root-finding methods for solving nonlinear equations are proposed. The classical Jarratt’s family of fourth-order methods are obtained as special cases. We then present results which describe the conjugacy classes and dynamics of the presented optimal method for complex polynomials of degree two and three. The basins of attraction of existing optimal metho...

one of the main causes of endodontic treatment failure is the clinician’s inability to localize all the root canals. due to the complex anatomy of the root canal system, missed canals are not uncommon. there are several strategies to decrease the possibility of missed root canals starting with good pre-operative radiographies. in order to overcome the limitations of conventional radiographies, ...