scholarly journals Fractals via Generalized Jungck–S Iterative Scheme

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Zhihua Chen ◽  
Muhammad Tanveer ◽  
Waqas Nazeer ◽  
Jing Wu
Keyword(s):  
Iterative Method ◽  
Iterative Scheme ◽  
Mandelbrot Set ◽  
Iterative Schemes ◽  
Mandelbrot Sets

The purpose of this research is to introduce a Jungck–S iterative method with m , h 1 , h 2 –convexity and hence unify different comparable iterative schemes existing in the literature. A Jungck–S orbit is constructed, and escape radius is derived with our scheme. A new escape radius is also obtained for generating the fractals. Julia and Mandelbrot set are visualized with the help of proposed algorithms based on our iterative scheme. Moreover, we present some complex graphs of Julia and Mandelbrot sets using the derived orbit and discuss their nature in detail.

A Study on Mandelbrot Sets to Generate Visual Aesthetic Fractal Patterns

2013 ◽  
Vol 311 ◽  
pp. 111-116 ◽  
Author(s):  
Zong Wen Cai ◽  
Artde D. Kin Tak Lam
Keyword(s):  
Information System ◽  
Program Development ◽  
Development Program ◽  
Visual Basic ◽  
Time Algorithm ◽  
Mandelbrot Set ◽  
Escape Time ◽  
Mandelbrot Sets ◽  
Fractal Patterns ◽  
Power Orders

The fractal pattern is a highly visual aesthetic image. This article describes the generation method of Mandelbrot set to generate fractal art patterns. Based on the escape time algorithm on complex plane, the visual aesthetic fractal patterns are generated from Mandelbrot sets. The generated program development, a pictorial information system, is integrated through the application of Visual Basic programming language and development integration environment. Application of the development program, this article analyzes the shape of the fractal patterns generated by the different power orders of the Mandelbrot sets. Finally, the escape time algorithm has been proposed as the generation tools of highly visual aesthetic fractal patterns.

scholarly journals Newton Type Iteration for Tikhonov Regularization of Nonlinear Ill-Posed Problems in Hilbert Scales

2014 ◽  
Vol 2014 ◽  
pp. 1-9
Author(s):  
Monnanda Erappa Shobha ◽  
Santhosh George
Keyword(s):  
Integral Equation ◽  
Iterative Method ◽  
Iterative Scheme ◽  
Initial Guess ◽  
Optimal Order ◽  
Source Condition ◽  
Adaptive Scheme ◽  
Actual Solution ◽  
Ill Posed ◽  
General Source

Recently, Vasin and George (2013) considered an iterative scheme for approximately solving an ill-posed operator equationF(x)=y. In order to improve the error estimate available by Vasin and George (2013), in the present paper we extend the iterative method considered by Vasin and George (2013), in the setting of Hilbert scales. The error estimates obtained under a general source condition onx0-x^(x0is the initial guess andx^is the actual solution), using the adaptive scheme proposed by Pereverzev and Schock (2005), are of optimal order. The algorithm is applied to numerical solution of an integral equation in Numerical Example section.

scholarly journals Convergence of Infinite Family of Multivalued Quasi-Nonexpansive Mappings Using Multistep Iterative Processes

2014 ◽  
Vol 2014 ◽  
pp. 1-11
Author(s):  
Renu Chugh ◽  
Sanjay Kumar
Keyword(s):  
Real Banach Space ◽  
Iterative Scheme ◽  
Nonexpansive Mappings ◽  
Infinite Family ◽  
Finite Family ◽  
Countable Family ◽  
Uniformly Convex ◽  
Iterative Schemes ◽  
Strong And Weak Convergence ◽  
Convergence Results

We prove strong and weak convergence results using multistep iterative sequences for countable family of multivalued quasi-nonexpansive mappings by using some conditions in uniformly convex real Banach space. The results presented extended and improved the corresponding result of Zhang et al. (2013), Bunyawat and Suantai (2012), and some others from finite family, one countable family, and two countable families tok-number of countable families of multivalued quasi-nonexpansive mappings. Also we used a numerical example in C++ computational programs to prove that the iterative scheme we used has better rate of convergence than other existing iterative schemes.

scholarly journals On Rate of Convergence of Jungck-Type Iterative Schemes

2013 ◽  
Vol 2013 ◽  
pp. 1-15 ◽  
Author(s):  
Nawab Hussain ◽  
Vivek Kumar ◽  
Marwan A. Kutbi
Keyword(s):  
Strong Convergence ◽  
Rate Of Convergence ◽  
Iterative Scheme ◽  
Convergence Speed ◽  
Contractive Condition ◽  
Iterative Schemes ◽  
The Stability

We introduce a new iterative scheme called Jungck-CR iterative scheme and study the stability and strong convergence of this iterative scheme for a pair of nonself-mappings using a certain contractive condition. Also, convergence speed comparison and applications of Jungck-type iterative schemes will be shown through examples.

scholarly journals Smooth Decomposition of Generalized Fatou Set Explains Smooth Structure in Generalized Mandelbrot Set

1988 ◽  
Vol 43 (1) ◽  
pp. 14-16 ◽  
Author(s):  
J. Peinke ◽  
J. Parisi ◽  
B. Röhricht ◽  
O. E. Rössler ◽  
W. Metzler
Keyword(s):  
Parameter Space ◽  
Initial Conditions ◽  
Logistic Map ◽  
Mandelbrot Set ◽  
Fatou Set ◽  
Smooth Structure ◽  
Mandelbrot Sets ◽  
Generalized Mandelbrot Sets

Abstract Generalized Mandelbrot sets arise in perturbed (non-analytic) versions of the complex logistic map. Numerically, it contains smooth portions as shown previously. To exclude that this result is specific to particular initial conditions only, the structure of the analogue to the Fatou set is looked at in the region in question. The set of non-divergent points is being "eaten up" by a smooth invading boundary. Therefore, the same type of decomposition applies independent of position in parameter space, in the region in question.

Motion Control of Manipulators with Closed-Form Inverse Solutions Near Wrist Singularities

1989 ◽  
Vol 111 (1) ◽  
pp. 87-93 ◽  
Author(s):  
Jim Z. Lai ◽  
C. H. Menq
Keyword(s):  
Iterative Method ◽  
Closed Form ◽  
Motion Control ◽  
Iterative Scheme ◽  
Industrial Robots ◽  
Orientation Error ◽  
Acceptable Solution ◽  
Closed Form Solutions ◽  
Position Accuracy ◽  
Inverse Solutions

Two algorithms, the degenerate axis and iterative methods, are developed for the motion control of manipulators with closed-form solutions in the neighborhood of singularities. These two methods theoretically guarantee a robot’s position accuracy. The degenerate axis method may not work well when a robot’s orientation and location increments become finite. If a robot is moving with slow speed or the interpolation time is in the order of microsecond, the location and orientation increments are small. In this case, the degenerate axis method is favored for it has less computation than that of the iterative method. Two examples are given to illustrate the concepts presented in this paper. Although it cannot be proved that the iterative scheme gives the required position accuracy and minimizes the orientation error, the results seem to show that this scheme converges to an acceptable solution. It is believed that the iterative method is the first of its kind to solve the singular motion control problem by using a robot’s closed-form inverse kinematics. Simple computation for the iterative scheme makes it possible to be implemented in many industrial robots.

scholarly journals Four-Point Optimal Sixteenth-Order Iterative Method for Solving Nonlinear Equations

2013 ◽  
Vol 2013 ◽  
pp. 1-5 ◽  
Author(s):  
Malik Zaka Ullah ◽  
A. S. Al-Fhaid ◽  
Fayyaz Ahmad
Keyword(s):  
Iterative Method ◽  
Nonlinear Equations ◽  
Numerical Experiments ◽  
Order Of Convergence ◽  
Iterative Scheme ◽  
Optimal Order ◽  
Optimal Order Of Convergence

We present an iterative method for solving nonlinear equations. The proposed iterative method has optimal order of convergence sixteen in the sense of Kung-Traub conjecture (Kung and Traub, 1974); it means that the iterative scheme uses five functional evaluations to achieve 16(=25-1) order of convergence. The proposed iterative method utilizes one derivative and four function evaluations. Numerical experiments are made to demonstrate the convergence and validation of the iterative method.

scholarly journals On the JK Iterative Process in Banach Spaces

2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Junaid Ahmad ◽  
Hüseyin Işık ◽  
Faeem Ali ◽  
Kifayat Ullah ◽  
Eskandar Ameer ◽  
...  
Keyword(s):  
Weak Convergence ◽  
Banach Spaces ◽  
Iterative Process ◽  
Iterative Scheme ◽  
Nonexpansive Mappings ◽  
The Other ◽  
Iterative Schemes ◽  
Strong And Weak Convergence ◽  
Nonexpansive Maps ◽  
Iterative Procedures

In the recent progress, different iterative procedures have been constructed in order to find the fixed point for a given self-map in an effective way. Among the other things, an effective iterative procedure called the JK iterative scheme was recently constructed and its strong and weak convergence was established for the class of Suzuki mappings in the setting of Banach spaces. The first purpose of this research is to obtain the strong and weak convergence of this scheme in the wider setting of generalized α -nonexpansive mappings. Secondly, by constructing an example of generalized α -nonexpansive maps which is not a Suzuki map, we show that the JK iterative scheme converges faster as compared the other iterative schemes. The presented results of this paper properly extend and improve the corresponding results of the literature.

scholarly journals Convergence Theorems of Iterative Schemes For Nonexpansive Mappings

2017 ◽  
Vol 12 (12) ◽  
pp. 6845-6851
Author(s):  
Inaam Mohammed Ali Hadi ◽  
Dr. salwa Salman Abd
Keyword(s):  
Hilbert Space ◽  
Fixed Point ◽  
Variational Inequality ◽  
Common Fixed Point ◽  
Convex Analysis ◽  
Iterative Scheme ◽  
Real Hilbert Space ◽  
Nonexpansive Mappings ◽  
Convergence Theorems ◽  
Iterative Schemes

In this paper, we give a type of iterative scheme for sequence of nonexpansive mappings and we study the strongly convergence of these schemes in real Hilbert space to common fixed point which is also a solution of a variational inequality. Also there are some consequent of this results in convex analysis

scholarly journals Convergence and Stability of New Approximation Algorithms for Certain Contractive-Type Mappings

2021 ◽  
Vol 2 ◽  
pp. 1
Author(s):  
Imo Kalu Agwu ◽  
Donatus Ikechi Igbokwe
Keyword(s):  
Approximation Algorithms ◽  
Fixed Points ◽  
Iterative Scheme ◽  
Type Condition ◽  
Iterative Schemes ◽  
Convergence And Stability ◽  
Contractive Type ◽  
Stability Results

We present new fixed points algorithms called multistep H-iterative scheme and multistep SH-iterative scheme. Under certain contractive-type condition, convergence and stability results were established without any imposition of the ’sum conditions’, which to a large extent make some existing iterative schemes so far studied by other authors in this direction practically inefficient. Our results complement and improve some recent results in literature.

Sign in / Sign up

Export Citation Format

Share Document