Ashish Nandal
Ashish Nandal has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Renu Chugh
Department of Mathematics, Maharshi Dayanand University, Rohtak, India
5 shared publications - Krzysztof Gdawiec
Institute of Computer Science, University of Silesia in Katowice, Sosnowiec, Poland
2 shared publications - Lateef Olakunle Jolaoso
School of Mathematical Sciences, University of Southampton, Southampton, UK
2 shared publications - Mihai Postolache
Department of Mathematics and Informatics, National University of Science and Technology Politehnica Bucharest, Bucharest, Romania
2 shared publications - Naresh Kumar
Department of Mathematics, Guru Jambheshwar University of Science & Technology, Hisar, India
2 shared publications - Nishu Gupta
Department of Mathematics, Government College, Julana, Jind, 126101, India
2 shared publications
Latest Publications
- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Numerical Algebra, Control & Optimization
- Vol. 15 (2) , 273-299
Convergence analysis of multiple-sets split equality common fixed point problem with applications
In this paper, we suggest a new inertial type parallel iterative algorithm and prove its strong convergence for finding a solution of multiple-sets split equality common fixed point problem for a finite family of demicontractive mappings in real Hilbert spaces. The suggested algorithm does not require prior knowledge of operator norm. We apply our result to study multiple-sets split equality common fixed point problem for a finite family of quasi-pseudocontractive mappings. Further, we also apply our result to solve various split type problems and intensity-modulated radiation therapy. Moreover, we give numerical experiments for supporting our main result and compare it with other existing methods.
- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Numerical Algebra, Control & Optimization
- Vol. 15 (2) , 273-299
Convergence analysis of multiple-sets split equality common fixed point problem with applications
In this paper, we suggest a new inertial type parallel iterative algorithm and prove its strong convergence for finding a solution of multiple-sets split equality common fixed point problem for a finite family of demicontractive mappings in real Hilbert spaces. The suggested algorithm does not require prior knowledge of operator norm. We apply our result to study multiple-sets split equality common fixed point problem for a finite family of quasi-pseudocontractive mappings. Further, we also apply our result to solve various split type problems and intensity-modulated radiation therapy. Moreover, we give numerical experiments for supporting our main result and compare it with other existing methods.
- Open Access
- 1 January 2024
- Published by National Library of Serbia in Filomat
- Vol. 38 (13) , 4529-4551
Weak and strong convergence of inertial-type iterative algorithms for solving split general system of generalized equilibrium problem
In this article, we generalize several equilibrium and variational inequality problems by in-troducing new general system of split generalized equilibrium problem. We introduce an inertial-type iterative algorithm and prove its weak convergence to the common solution of general system of split gen-eralized equilibrium problem and fixed point problem of demicontractive mapping. We also prove strong convergence of the proposed algorithm by using shrinking projection method. Finally, we give numerical experiments to validate the performance of our algorithm and compare it with other existing method.
- 1 January 2024
- Published by National Library of Serbia in Filomat
- Vol. 38 (13) , 4529-4551
Open AccessWeak and strong convergence of inertial-type iterative algorithms for solving split general system of generalized equilibrium problem
In this article, we generalize several equilibrium and variational inequality problems by in-troducing new general system of split generalized equilibrium problem. We introduce an inertial-type iterative algorithm and prove its weak convergence to the common solution of general system of split gen-eralized equilibrium problem and fixed point problem of demicontractive mapping. We also prove strong convergence of the proposed algorithm by using shrinking projection method. Finally, we give numerical experiments to validate the performance of our algorithm and compare it with other existing method.
- Open Access
- 17 August 2023
- Published by Springer Nature in Numerical Algorithms
- Vol. 96 (1) , 211-236
On the viscosity approximation type iterative method and its non-linear behaviour in the generation of Mandelbrot and Julia sets
In this paper, we visualise and analyse the dynamics of fractals (Julia and Mandelbrot sets) for complex polynomials of the form $$T(z) = z^{n} + mz + r$$ , where $$n \ge 2$$ and $$m, r \in \mathbb {C}$$ , by adopting the viscosity approximation type iteration process which is most widely used iterative method for finding fixed points of non-linear operators. We establish a convergence condition in the form of escape criterion which allows to adapt the escape-time algorithm to the considered iteration scheme. We also present some graphical examples of the Mandelbrot and Julia fractals showing the dependency of Julia and Mandelbrot sets on complex polynomials, contraction mappings, and iteration parameters. Moreover, we propose two numerical measures that allow the study of the dependency of the set shape change on the values of the iteration parameters. Using these two measures, we show that the dependency for the considered iteration method is non-linear.- 17 August 2023
- Published by Springer Nature in Numerical Algorithms
- Vol. 96 (1) , 211-236
Open AccessOn the viscosity approximation type iterative method and its non-linear behaviour in the generation of Mandelbrot and Julia sets
In this paper, we visualise and analyse the dynamics of fractals (Julia and Mandelbrot sets) for complex polynomials of the form $$T(z) = z^{n} + mz + r$$ , where $$n \ge 2$$ and $$m, r \in \mathbb {C}$$ , by adopting the viscosity approximation type iteration process which is most widely used iterative method for finding fixed points of non-linear operators. We establish a convergence condition in the form of escape criterion which allows to adapt the escape-time algorithm to the considered iteration scheme. We also present some graphical examples of the Mandelbrot and Julia fractals showing the dependency of Julia and Mandelbrot sets on complex polynomials, contraction mappings, and iteration parameters. Moreover, we propose two numerical measures that allow the study of the dependency of the set shape change on the values of the iteration parameters. Using these two measures, we show that the dependency for the considered iteration method is non-linear. - Open Access
- 20 August 2022
- Published by Springer Nature in Aequationes mathematicae
- Vol. 97 (2) , 257-278
An Application of Viscosity Approximation Type Iterative Method in the Generation of Mandelbrot and Julia Fractals
In this paper, we present an application of the viscosity approximation type iterative method introduced by Nandal et al. (Iteration Process for Fixed Point Problems and Zeros of Maximal Monotone Operators, Symmetry, 2019) to visualize and analyse the Julia and Mandelbrot sets for a complex polynomial of the type $$T(z) = z^{n} + p z + r$$ , where $$p, r\in {\mathbb {C}}$$ , and $$n \ge 2$$ . This iterative method has many applications in solving various fixed point problems. We derive an escape criterion to visualize Julia and Mandelbrot sets via the proposed viscosity approximation type method. Moreover, we present several graphical examples of the fractals generated with the proposed iteration method.- 20 August 2022
- Published by Springer Nature in Aequationes mathematicae
- Vol. 97 (2) , 257-278
Open AccessAn Application of Viscosity Approximation Type Iterative Method in the Generation of Mandelbrot and Julia Fractals
In this paper, we present an application of the viscosity approximation type iterative method introduced by Nandal et al. (Iteration Process for Fixed Point Problems and Zeros of Maximal Monotone Operators, Symmetry, 2019) to visualize and analyse the Julia and Mandelbrot sets for a complex polynomial of the type $$T(z) = z^{n} + p z + r$$ , where $$p, r\in {\mathbb {C}}$$ , and $$n \ge 2$$ . This iterative method has many applications in solving various fixed point problems. We derive an escape criterion to visualize Julia and Mandelbrot sets via the proposed viscosity approximation type method. Moreover, we present several graphical examples of the fractals generated with the proposed iteration method. - 1 January 2021
- Published by Springer Nature
- p. 269-308
Application of Fixed Point Iterative Methods to Construct Fractals and Anti-fractals
- 1 January 2021
- Published by Springer Nature
- p. 269-308
Application of Fixed Point Iterative Methods to Construct Fractals and Anti-fractals
- Open Access
- 22 August 2019
- Published by MDPI AG in Mathematics
- Vol. 7 (9) , 773
Strong Convergence of a New Generalized Viscosity Implicit Rule and Some Applications in Hilbert Space
In this paper, based on the very recent work by Nandal et al. (Nandal, A.; Chugh, R.; Postolache, M. Iteration process for fixed point problems and zeros of maximal monotone operators. Symmetry 2019, 11, 655.), we propose a new generalized viscosity implicit rule for finding a common element of the fixed point sets of a finite family of nonexpansive mappings and the sets of zeros of maximal monotone operators. Utilizing the main result, we first propose and investigate a new general system of generalized equilibrium problems, which includes several equilibrium and variational inequality problems as special cases, and then we derive an implicit iterative method to solve constrained multiple-set split convex feasibility problem. We further combine forward-backward splitting method and generalized viscosity implicit rule for solving monotone inclusion problem. Moreover, we apply the main result to solve convex minimization problem.
- 22 August 2019
- Published by MDPI AG in Mathematics
- Vol. 7 (9) , 773
Open AccessStrong Convergence of a New Generalized Viscosity Implicit Rule and Some Applications in Hilbert Space
In this paper, based on the very recent work by Nandal et al. (Nandal, A.; Chugh, R.; Postolache, M. Iteration process for fixed point problems and zeros of maximal monotone operators. Symmetry 2019, 11, 655.), we propose a new generalized viscosity implicit rule for finding a common element of the fixed point sets of a finite family of nonexpansive mappings and the sets of zeros of maximal monotone operators. Utilizing the main result, we first propose and investigate a new general system of generalized equilibrium problems, which includes several equilibrium and variational inequality problems as special cases, and then we derive an implicit iterative method to solve constrained multiple-set split convex feasibility problem. We further combine forward-backward splitting method and generalized viscosity implicit rule for solving monotone inclusion problem. Moreover, we apply the main result to solve convex minimization problem.
- Open Access
Iteration Process for Fixed Point Problems and Zeros of Maximal Monotone Operators
We introduce an iterative algorithm which converges strongly to a common element of fixed point sets of nonexpansive mappings and sets of zeros of maximal monotone mappings. Our iterative method is quite general and includes a large number of iterative methods considered in recent literature as special cases. In particular, we apply our algorithm to solve a general system of variational inequalities, convex feasibility problem, zero point problem of inverse strongly monotone and maximal monotone mappings, split common null point problem, split feasibility problem, split monotone variational inclusion problem and split variational inequality problem. Under relaxed conditions on the parameters, we derive some algorithms and strong convergence results to solve these problems. Our results improve and generalize several known results in the recent literature.
Open AccessIteration Process for Fixed Point Problems and Zeros of Maximal Monotone Operators
We introduce an iterative algorithm which converges strongly to a common element of fixed point sets of nonexpansive mappings and sets of zeros of maximal monotone mappings. Our iterative method is quite general and includes a large number of iterative methods considered in recent literature as special cases. In particular, we apply our algorithm to solve a general system of variational inequalities, convex feasibility problem, zero point problem of inverse strongly monotone and maximal monotone mappings, split common null point problem, split feasibility problem, split monotone variational inclusion problem and split variational inequality problem. Under relaxed conditions on the parameters, we derive some algorithms and strong convergence results to solve these problems. Our results improve and generalize several known results in the recent literature.