scholarly journals One Parameter Optimal Derivative-Free Family to Find the Multiple Roots of Algebraic Nonlinear Equations

Mathematics ◽  
2020 ◽  
Vol 8 (12) ◽  
pp. 2223
Author(s):  
Munish Kansal ◽  
Ali Saleh Alshomrani ◽  
Sonia Bhalla ◽  
Ramandeep Behl ◽  
Mehdi Salimi
Keyword(s):  
Basin Of Attraction ◽  
Nonlinear Function ◽  
Second Order ◽  
Function Evaluation ◽  
Multiple Roots ◽  
Derivative Free ◽  
The One ◽  
Special Case ◽  
The Basin Of Attraction ◽  
Taylor’S Series

In this study, we construct the one parameter optimal derivative-free iterative family to find the multiple roots of an algebraic nonlinear function. Many researchers developed the higher order iterative techniques by the use of the new function evaluation or the first-order or second-order derivative of functions to evaluate the multiple roots of a nonlinear equation. However, the evaluation of the derivative at each iteration is a cumbersome task. With this motivation, we design the second-order family without the utilization of the derivative of a function and without the evaluation of the new function. The proposed family is optimal as it satisfies the convergence order of Kung and Traub’s conjecture. Here, we use one parameter a for the construction of the scheme, and for a=1, the modified Traub method is its a special case. The order of convergence is analyzed by Taylor’s series expansion. Further, the efficiency of the suggested family is explored with some numerical tests. The obtained results are found to be more efficient than earlier schemes. Moreover, the basin of attraction of the proposed and earlier schemes is also analyzed.

scholarly journals Basins of Attraction for Various Steffensen-Type Methods

2014 ◽  
Vol 2014 ◽  
pp. 1-17 ◽  
Author(s):  
Alicia Cordero ◽  
Fazlollah Soleymani ◽  
Juan R. Torregrosa ◽  
Stanford Shateyi
Keyword(s):  
Computer Algebra System ◽  
Dynamical Behavior ◽  
Basin Of Attraction ◽  
Basins Of Attraction ◽  
Numerical Tests ◽  
Derivative Free ◽  
Iteration Functions ◽  
The Stability ◽  
Programming Package ◽  
The Basin Of Attraction

The dynamical behavior of different Steffensen-type methods is analyzed. We check the chaotic behaviors alongside the convergence radii (understood as the wideness of the basin of attraction) needed by Steffensen-type methods, that is, derivative-free iteration functions, to converge to a root and compare the results using different numerical tests. We will conclude that the convergence radii (and the stability) of Steffensen-type methods are improved by increasing the convergence order. The computer programming package MATHEMATICAprovides a powerful but easy environment for all aspects of numerics. This paper puts on show one of the application of this computer algebra system in finding fixed points of iteration functions.

scholarly journals Family of Bistable Attractors Contained in an Unstable Dissipative Switching System Associated to a SNLF

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-9 ◽  
Author(s):  
J. L. Echenausía-Monroy ◽  
J. H. García-López ◽  
R. Jaimes-Reátegui ◽  
D. López-Mancilla ◽  
G. Huerta-Cuellar
Keyword(s):  
Global Attractor ◽  
Control Parameter ◽  
Initial Conditions ◽  
Basin Of Attraction ◽  
Nonlinear Function ◽  
Bifurcation Parameter ◽  
Switching System ◽  
Generator System ◽  
The Basin Of Attraction

This work presents a multiscroll generator system, which addresses the issue by the implementation of 9-level saturated nonlinear function, SNLF, being modified with a new control parameter that acts as a bifurcation parameter. By means of the modification of the newly introduced parameter, it is possible to control the number of scrolls to generate. The proposed system has richer dynamics than the original, not only presenting the generation of a global attractor; it is capable of generating monostable and bistable multiscrolls. The study of the basin of attraction for the natural attractor generation (9-scroll SNLF) shows the restrictions in the initial conditions space where the system is capable of presenting dynamical responses, limiting its possible electronic implementations.

scholarly journals One-Point Optimal Family of Multiple Root Solvers of Second-Order

Mathematics ◽  
2019 ◽  
Vol 7 (7) ◽  
pp. 655 ◽  
Author(s):  
Deepak Kumar ◽  
Janak Raj Sharma ◽  
Clemente Cesarano
Keyword(s):  
Weight Function ◽  
Basin Of Attraction ◽  
Multiple Root ◽  
Second Order ◽  
Weight Functions ◽  
Modified Newton Method ◽  
The Family ◽  
Dynamical Nature ◽  
Iterative Functions ◽  
The Basin Of Attraction

This manuscript contains the development of a one-point family of iterative functions. The family has optimal convergence of a second-order according to the Kung-Traub conjecture. This family is used to approximate the multiple zeros of nonlinear equations, and is based on the procedure of weight functions. The convergence behavior is discussed by showing some essential conditions of the weight function. The well-known modified Newton method is a member of the proposed family for particular choices of the weight function. The dynamical nature of different members is presented by using a technique called the “basin of attraction”. Several practical problems are given to compare different methods of the presented family.

scholarly journals Optimal One-Point Iterative Function Free from Derivatives for Multiple Roots

Mathematics ◽  
2020 ◽  
Vol 8 (5) ◽  
pp. 709 ◽  
Author(s):  
Deepak Kumar ◽  
Janak Raj Sharma ◽  
Ioannis K. Argyros
Keyword(s):  
Complex Geometry ◽  
Basins Of Attraction ◽  
Second Order ◽  
Multiple Roots ◽  
Single Variable ◽  
Optimal Method ◽  
Multiple Zeros ◽  
Derivative Free ◽  
Derivative Free Methods ◽  
The Stability

We suggest a derivative-free optimal method of second order which is a new version of a modification of Newton’s method for achieving the multiple zeros of nonlinear single variable functions. Iterative methods without derivatives for multiple zeros are not easy to obtain, and hence such methods are rare in literature. Inspired by this fact, we worked on a family of optimal second order derivative-free methods for multiple zeros that require only two function evaluations per iteration. The stability of the methods was validated through complex geometry by drawing basins of attraction. Moreover, applicability of the methods is demonstrated herein on different functions. The study of numerical results shows that the new derivative-free methods are good alternatives to the existing optimal second-order techniques that require derivative calculations.

scholarly journals A Family of Derivative Free Optimal Fourth Order Methods for Computing Multiple Roots

Symmetry ◽  
2020 ◽  
Vol 12 (12) ◽  
pp. 1969
Author(s):  
Sunil Kumar ◽  
Deepak Kumar ◽  
Janak Raj Sharma ◽  
Lorentz Jäntschi
Keyword(s):  
Fourth Order ◽  
Nonlinear Problems ◽  
Multiple Root ◽  
Optimal Order ◽  
Multiple Roots ◽  
New Methods ◽  
Derivative Free ◽  
The Family ◽  
Derivative Free Method ◽  
Special Case

Many optimal order multiple root techniques, which use derivatives in the algorithm, have been proposed in literature. But contrarily, derivative free optimal order techniques for multiple root are almost nonexistent. By this as an inspirational factor, here we present a family of optimal fourth order derivative-free techniques for computing multiple roots of nonlinear equations. At the beginning the convergence analysis is executed for particular values of multiplicity afterwards it concludes in general form. Behl et. al derivative-free method is seen as special case of the family. Moreover, the applicability and comparison is demonstrated on different nonlinear problems that certifies the efficient convergent nature of the new methods. Finally, we conclude that our new methods consume the lowest CPU time as compared to the existing ones. This illuminates the theoretical outcomes to a great extent of this study.

scholarly journals Preserving the Shape of Functions by Applying Multidimensional Schoenberg-Type Operators

Symmetry ◽  
2021 ◽  
Vol 13 (6) ◽  
pp. 1016
Author(s):  
Camelia Liliana Moldovan ◽  
Radu Păltănea
Keyword(s):  
Applied Sciences ◽  
Degree Of Approximation ◽  
Higher Order ◽  
Second Order ◽  
Dimensional Case ◽  
Moduli Of Continuity ◽  
One Dimensional ◽  
Multidimensional Generalization ◽  
The One

The paper presents a multidimensional generalization of the Schoenberg operators of higher order. The new operators are powerful tools that can be used for approximation processes in many fields of applied sciences. The construction of these operators uses a symmetry regarding the domain of definition. The degree of approximation by sequences of such operators is given in terms of the first and the second order moduli of continuity. Extending certain results obtained by Marsden in the one-dimensional case, the property of preservation of monotonicity and convexity is proved.

scholarly journals Derivative-Free King’s Scheme for Multiple Zeros of Nonlinear Functions

Mathematics ◽  
2021 ◽  
Vol 9 (11) ◽  
pp. 1242
Author(s):  
Ramandeep Behl ◽  
Sonia Bhalla ◽  
Eulalia Martínez ◽  
Majed Aali Alsulami
Keyword(s):  
Iterative Methods ◽  
Fourth Order ◽  
Order Of Convergence ◽  
Real Life ◽  
Multiple Roots ◽  
Computational Results ◽  
Nonlinear Functions ◽  
First Order ◽  
Life Problems ◽  
Derivative Free

There is no doubt that the fourth-order King’s family is one of the important ones among its counterparts. However, it has two major problems: the first one is the calculation of the first-order derivative; secondly, it has a linear order of convergence in the case of multiple roots. In order to improve these complications, we suggested a new King’s family of iterative methods. The main features of our scheme are the optimal convergence order, being free from derivatives, and working for multiple roots (m≥2). In addition, we proposed a main theorem that illustrated the fourth order of convergence. It also satisfied the optimal Kung–Traub conjecture of iterative methods without memory. We compared our scheme with the latest iterative methods of the same order of convergence on several real-life problems. In accordance with the computational results, we concluded that our method showed superior behavior compared to the existing methods.

An efficient class of fourth-order derivative-free method for multiple-roots

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Sunil Kumar ◽  
Deepak Kumar ◽  
Janak Raj Sharma ◽  
Ioannis K. Argyros
Keyword(s):  
Multiple Root ◽  
Second Step ◽  
Optimal Order ◽  
Multiple Roots ◽  
Nonlinear Functions ◽  
New Methods ◽  
Derivative Free ◽  
Derivative Free Methods ◽  
Derivative Free Method ◽  
Good Number

Abstract Many optimal order multiple root techniques, which use derivatives in the algorithm, have been proposed in literature. Many researchers tried to construct an optimal family of derivative-free methods for multiple roots, but they did not get success in this direction. With this as a motivation factor, here, we present a new optimal class of derivative-free methods for obtaining multiple roots of nonlinear functions. This procedure involves Traub–Steffensen iteration in the first step and Traub–Steffensen-like iteration in the second step. Efficacy is checked on a good number of relevant numerical problems that verifies the efficient convergent nature of the new methods. Moreover, we find that the new derivative-free methods are just as competent as the other existing robust methods that use derivatives.

scholarly journals Congruence pairs of principal MS-algebras and perfect extensions

2020 ◽  
Vol 70 (6) ◽  
pp. 1275-1288
Author(s):  
Abd El-Mohsen Badawy ◽  
Miroslav Haviar ◽  
Miroslav Ploščica
Keyword(s):  
Boolean Algebra ◽  
Congruence Lattices ◽  
Descriptive Solution ◽  
The One ◽  
Special Case ◽  
Congruence Pair

AbstractThe notion of a congruence pair for principal MS-algebras, simpler than the one given by Beazer for K2-algebras [6], is introduced. It is proved that the congruences of the principal MS-algebras L correspond to the MS-congruence pairs on simpler substructures L°° and D(L) of L that were associated to L in [4].An analogy of a well-known Grätzer’s problem [11: Problem 57] formulated for distributive p-algebras, which asks for a characterization of the congruence lattices in terms of the congruence pairs, is presented here for the principal MS-algebras (Problem 1). Unlike a recent solution to such a problem for the principal p-algebras in [2], it is demonstrated here on the class of principal MS-algebras, that a possible solution to the problem, though not very descriptive, can be simple and elegant.As a step to a more descriptive solution of Problem 1, a special case is then considered when a principal MS-algebra L is a perfect extension of its greatest Stone subalgebra LS. It is shown that this is exactly when de Morgan subalgebra L°° of L is a perfect extension of the Boolean algebra B(L). Two examples illustrating when this special case happens and when it does not are presented.

Sign in / Sign up

Export Citation Format

Share Document