The rate of multiplicity of the roots of nonlinear equations and its application to iterative methods

Nonsimple roots of nonlinear equations present some challenges for classic iterative methods, such as instability or slow, if any, convergence. As a consequence, they require a greater computational cost, depending on the knowledge of the order of multiplicity of the roots. In this paper, we introduce dimensionless function, called rate of multiplicity, which estimates the order of multiplicity of the roots, as a dynamic global concept, in order to accelerate iterative processes. This rate works not only with integer but also fractional order of multiplicity and even with poles (negative order of multiplicity).

Third-order iterative methods without using any Fréchet derivative

AbstractA modification of classical third-order methods is proposed. The main advantage of these methods is they do not need to evaluate any Fréchet derivative. A convergence theorem in Banach spaces, just assuming the second divided difference is bounded and a punctual condition, is analyzed. Finally, some numerical results are presented.

Mathematical Models for Restoration of Baroque Paintings

In this paper we adapt different techniques for image deconvolution, to the actual restoration of works of arts (mainly paintings and sculptures) from the baroque period. We use the special characteristics of these works in order to both restrict the strategies and benefit from those properties. We propose an algorithm which presents good results in the pieces we have worked. Due to the diversity of the period and the amount of artists who made it possible, the algorithms are too general even in this context. This is a first approach to the problem, in which we have assumed very common and shared features for the works of art. The flexibility of the algorithm, and the freedom to choose some…

A general framework for a class of non-linear approximations with applications to image restoration

Este artículo se encuentra disponible en la página web de la revista en la siguiente URL: https://www.sciencedirect.com/science/article/abs/pii/S0377042717301188 Este es el pre-print del siguiente artículo: Candela, V., Falcó, A. & Romero, PD. (2018). A general framework for a class of non-linear approximations with applications to image restoration. Journal of Computational and Applied Mathematics, vol. 330 (mar.), pp. 982-994, que se ha publicado de forma definitiva en https://doi.org/10.1016/j.cam.2017.03.008 This is the pre-peer reviewed version of the following article: Candela, V., Falcó, A. & Romero, PD. (2018). A general framework for a class of non-linear approximations with applic…

A Polynomial Approach to the Piecewise Hyperbolic Method

In this paper, a local (third-order accurate) shock capturing method for hyperbolic conservation laws is presented. The method has been made with the same idea as the PHM method, but with a simpler reconstruction. A comparison with the classic high order methods is discussed.

A class of third order iterative Kurchatov–Steffensen (derivative free) methods for solving nonlinear equations

Abstract In this paper we show a strategy to devise third order iterative methods based on classic second order ones such as Steffensen’s and Kurchatov’s. These methods do not require the evaluation of derivatives, as opposed to Newton or other well known third order methods such as Halley or Chebyshev. Some theoretical results on convergence will be stated, and illustrated through examples. These methods are useful when the functions are not regular or the evaluation of their derivatives is costly. Furthermore, special features as stability, laterality (asymmetry) and other properties can be addressed by choosing adequate nodes in the design of the methods.

A class of quasi-Newton generalized Steffensen methods on Banach spaces

AbstractWe consider a class of generalized Steffensen iterations procedure for solving nonlinear equations on Banach spaces without any derivative. We establish the convergence under the Kantarovich–Ostrowski's conditions. The majorizing sequence will be a Newton's type sequence, thus the convergence can have better properties. Finally, a numerical comparation with the classical methods is presented.

The convergence of the perturbed Newton method and its application for ill-conditioned problems

Abstract Iterative methods, such as Newton’s, behave poorly when solving ill-conditioned problems: they become slow (first order), and decrease their accuracy. In this paper we analyze deeply and widely the convergence of a modified Newton method, which we call perturbed Newton, in order to overcome the usual disadvantages Newton’s one presents. The basic point of this method is the dependence of a parameter affording a degree of freedom that introduces regularization. Choices for that parameter are proposed. The theoretical analysis will be illustrated through examples.

Local Total Variation Bounded Methods for Hyperbolic Conservation Laws