We show how some results of the theory of iterated function systems can be derived from the Tarski–Kantorovitch fixed–point principle for maps on partially ordered sets. In particular, this principle yields, without using the Hausdorff metric, the Hutchinson–Barnsley theorem with the only restriction that a metric space considered has the Heine–Borel property. As a by–product, we also obtain so...

We investigate the efficiency of multi-step Newton method (the classical Newton method in which the first derivative is re-evaluated periodically after m steps) for solving nonlinear equations, F(x) = 0, F : D ⊆ Rn → Rn. We highlight the following property of multi-step Newton method with respect to some other Newton-type method: for a given n, there exist thresholds of m, that is an interval (...

Inexact Newton methods are constructed by combining Newton’s method with another iterative method that is used to solve the Newton equations inexactly. In this paper, we establish two semilocal convergence theorems for the inexact Newton methods. When these two theorems are specified to Newton’s method, we obtain a different Newton-Kantorovich theorem about Newton’s method. When the iterative m...

Inexact Newton methods are constructed by combining Newton’s method with another iterative method that is used to solve the Newton equations inexactly. In this paper, we establish two semilocal convergence theorems for the inexact Newton methods. When these two theorems are specified to Newton’s method, we obtain a different Newton-Kantorovich theorem about Newton’s method. When the iterative m...

The main purpose of this paper is to find fuzzy root of fuzzy polynomials (if exists) by using Newton-Raphson method. The proposed numerical method has capability to solve fuzzy polynomials as well as algebric ones. For this purpose, by using parametric form of fuzzy coefficients of fuzzy polynomial and Newton-Rphson method we can find its fuzzy roots. Finally, we illustrate our approach by nu...

The smoothness-constrained least-squares method is widely used for two-dimensional (2D) and three-dimensional (3D) inversion of apparent resistivity data sets. The Gauss–Newton method that recalculates the Jacobian matrix of partial derivatives for all iterations is commonly used to solve the least-squares equation. The quasi-Newton method has also been used to reduce the computer time. In this...

for the nonlinear analysis of structures using the well known newton-raphson method, the tangent stiffness matrices of the elements must be constructed in each iteration. due to the high expense required to find the exact tangent stiffness matrices, researchers have developed novel innovations into the newton-raphson method to reduce the cost and time required by the analysis. in this paper, a ...

In the following paper, we present a way to accelerate speed of convergence fractional Newton–Raphson (F N–R) method, which seems have an order at least linearly for case in α derivative is different from one. A simplified constructing Riemann–Liouville (R–L) operators, integral and presented along with examples its application on functions. Furthermore, introduction Aitken’s method made it exp...