scholarly journals DYNAMICAL ANALYSIS TO EXPLAIN THE NUMERICAL ANOMALIES IN THE FAMILY OF ERMAKOV-KALITLIN TYPE METHODS

2019 ◽  
Vol 24 (3) ◽  
pp. 335-350
Author(s):  
Alicia Cordero ◽  
Juan R. Torregrosa ◽  
Pura Vindel

In this paper, we study the dynamics of an iterative method based on the Ermakov-Kalitkin class of iterative schemes for solving nonlinear equations. As it was proven in ”A new family of iterative methods widening areas of convergence, Appl. Math. Comput.”, this family has the property of getting good estimations of the solution when Newton’s method fails. Moreover, the set of converging starting points for several non-polynomial test functions was plotted and they showed to be wider in the case of proposed methods than in Newton’s case, for small values of the parameter. Now, we make a complex dynamical analysis of this parametric class in order to justify the stability properties of this family.

Mathematics ◽  
2021 ◽  
Vol 9 (1) ◽  
pp. 86
Author(s):  
Alicia Cordero ◽  
Eva G. Villalba ◽  
Juan R. Torregrosa ◽  
Paula Triguero-Navarro

A new parametric class of iterative schemes for solving nonlinear systems is designed. The third- or fourth-order convergence, depending on the values of the parameter being proven. The analysis of the dynamical behavior of this class in the context of scalar nonlinear equations is presented. This study gives us important information about the stability and reliability of the members of the family. The numerical results obtained by applying different elements of the family for solving the Hammerstein integral equation and the Fisher’s equation confirm the theoretical results.


Mathematics ◽  
2020 ◽  
Vol 8 (12) ◽  
pp. 2194
Author(s):  
Francisco I. Chicharro ◽  
Rafael A. Contreras ◽  
Neus Garrido

A straightforward family of one-point multiple-root iterative methods is introduced. The family is generated using the technique of weight functions. The order of convergence of the family is determined in its convergence analysis, which shows the constraints that the weight function must satisfy to achieve order three. In this sense, a family of iterative methods can be obtained with a suitable design of the weight function. That is, an iterative algorithm that depends on one or more parameters is designed. This family of iterative methods, starting with proper initial estimations, generates a sequence of approximations to the solution of a problem. A dynamical analysis is also included in the manuscript to study the long-term behavior of the family depending on the parameter value and the initial guess considered. This analysis reveals the good properties of the family for a wide range of values of the parameter. In addition, a numerical test on academic and engineering multiple-root functions is performed.


2018 ◽  
Vol 2018 ◽  
pp. 1-12 ◽  
Author(s):  
Faisal Ali ◽  
Waqas Aslam ◽  
Kashif Ali ◽  
Muhammad Adnan Anwar ◽  
Akbar Nadeem

We introduce a new family of iterative methods for solving mathematical models whose governing equations are nonlinear in nature. The new family gives several iterative schemes as special cases. We also give the convergence analysis of our proposed methods. In order to demonstrate the improved performance of newly developed methods, we consider some nonlinear equations along with two complex mathematical models. The graphical analysis for these models is also presented.


Filomat ◽  
2020 ◽  
Vol 34 (12) ◽  
pp. 4171-4188
Author(s):  
Nafiseh Shams ◽  
Alireza Fakharzadeh Jahromi ◽  
Fatemeh Beik

In this paper, we develop the idea of constructing iterative methods based on block splittings (BBS) to solve absolute value equations. The class of BBS methods incorporates the well-known Picard iterative method as a special case. Convergence properties of mentioned schemes are proved under some sufficient conditions. Numerical experiments are examined to compare the performance of the iterative schemes of BBS-type with some of existing approaches in the literature such as generalized Newton and Picard(-HSS) iterative methods.


2013 ◽  
Vol 90 (10) ◽  
pp. 2049-2060 ◽  
Author(s):  
Santiago Artidiello ◽  
Francisco Chicharro ◽  
Alicia Cordero ◽  
Juan R. Torregrosa

2007 ◽  
Vol 49 (2) ◽  
pp. 281-292 ◽  
Author(s):  
Shiliang Wu ◽  
Tingzhu Huang

AbstractBoth Evans et al. and Li et al. have presented preconditioned methods for linear systems to improve the convergence rates of AOR-type iterative schemes. In this paper, we present a new preconditioner. Some comparison theorems on preconditioned iterative methods for solving L-matrix linear systems are presented. Comparison results and a numerical example show that convergence of the preconditioned Gauss-Seidel method is faster than that of the preconditioned AOR iterative method.


Algorithms ◽  
2019 ◽  
Vol 12 (11) ◽  
pp. 236
Author(s):  
Abdolreza Amiri ◽  
Alicia Cordero ◽  
Mohammad Taghi Darvishi ◽  
Juan R. Torregrosa

It is well known that scalar iterative methods with derivatives are highly more stable than their derivative-free partners, understanding the term stability as a measure of the wideness of the set of converging initial estimations. In multivariate case, multidimensional dynamical analysis allows us to afford this task and it is made on different Jacobian-free variants of Newton’s method, whose estimations of the Jacobian matrix have increasing order. The respective basins of attraction and the number of fixed and critical points give us valuable information in this sense.


2002 ◽  
Vol 7 (1) ◽  
pp. 1-10
Author(s):  
V. N. Abrashin ◽  
R. Čiegis ◽  
V. Pakeniene ◽  
N. G. Zhadaeva

This paper deals with the stability analysis of multicomponent iterative methods for solving elliptic problems. They are based on a general splitting method, which decomposes a multidimensional parabolic problem into a system of one dimensional implicit problems. Error estimates in the L 2 norm are proved for the first method. For the stability analysis of Seidel type iterative method we use a spectral method. Two dimensional and three dimensional problems are investigated. Finally, we present results of numerical experiments. Our goal is to investigate the dependence of convergence rates of multicomponent iterative methods on the smoothness of the solution. Hence we solve a discrete problem, which approximates the 3D Poisson's problem. It is proved that the number of iterations depends weakly on the number of grid points if the exact solution and the initial approximation are smooth functions, both. The same problem is also solved by the Stability Correction iterative method. The obtained results indicate a similar behavior.


Mathematics ◽  
2021 ◽  
Vol 9 (14) ◽  
pp. 1640
Author(s):  
Petko D. Proinov ◽  
Milena D. Petkova

In this paper, we construct and study a new family of multi-point Ehrlich-type iterative methods for approximating all the zeros of a uni-variate polynomial simultaneously. The first member of this family is the two-point Ehrlich-type iterative method introduced and studied by Trićković and Petković in 1999. The main purpose of the paper is to provide local and semilocal convergence analysis of the multi-point Ehrlich-type methods. Our local convergence theorem is obtained by an approach that was introduced by the authors in 2020. Two numerical examples are presented to show the applicability of our semilocal convergence theorem.


2011 ◽  
Vol 20 (1) ◽  
pp. 161-173
Author(s):  
A.P. Kassatkina

Resuming published and own data, a revision of classification of Chaetognatha is presented. The family Sagittidae Claus & Grobben, 1905 is given a rank of subclass, Sagittiones, characterised, in particular, by the presence of two pairs of sac-like gelatinous structures or two pairs of fins. Besides the order Aphragmophora Tokioka, 1965, it contains the new order Biphragmosagittiformes ord. nov., which is a unique group of Chaetognatha with an unusual combination of morphological characters: the transverse muscles present in both the trunk and the tail sections of the body; the seminal vesicles simple, without internal complex compartments; the presence of two pairs of lateral fins. The only family assigned to the new order, Biphragmosagittidae fam. nov., contains two genera. Diagnoses of the two new genera, Biphragmosagitta gen. nov. (type species B. tarasovi sp. nov. and B. angusticephala sp. nov.) and Biphragmofastigata gen. nov. (type species B. fastigata sp. nov.), detailed descriptions and pictures of the three new species are presented.


Sign in / Sign up

Export Citation Format

Share Document