Abstract
The root-finding problem is very important in many applications and has become an extensive research field. One of the directions in this field is the use of various iteration schemes. In this paper, we propose a new generalised iteration scheme. The schemes like Mann, Ishikawa, Das–Debata schemes are special cases of the proposed iteration. Moreover, we use the proposed iteration with the PSO-based Newton-like method in two tasks. In the first task, we search for the roots, whereas in the second one for patterns with aesthetic features. The obtained results show that the proposed iteration can decrease the average number of iterations needed to find the roots and that we can generate patterns with potential artistic applications.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Agarwal, R., O’Regan, D., Sahu, D.: Iterative construction of fixed points of nearly asymptotically nonexpansive mappings. J. Nonlinear Convex Anal. 8(1), 61–79 (2007)
Ardelean, G., Cosma, O., Balog, L.: A comparison of some fixed point iteration procedures by using the basins of attraction. Carpathian J. Math. 32(3), 277–284 (2016)
Cheney, W., Kincaid, D.: Numerical Mathematics and Computing, 6th edn. Brooks/Cole, Pacific Groove (2007)
Das, G., Debata, J.: Fixed points of quasinonexpansive mappings. Indian J. Pure Appl. Math. 17(11), 1263–1269 (1986)
Gdawiec, K., Kotarski, W.: Polynomiography for the polynomial infinity norm via Kalantari’s formula and nonstandard iterations. Appl. Math. Comput. 307, 17–30 (2017). https://doi.org/10.1016/j.amc.2017.02.038
Gościniak, I., Gdawiec, K.: Visual analysis of dynamics behaviour of an iterative method depending on selected parameters and modifications. Entropy 22(7), 734 (2020). https://doi.org/10.3390/e22070734
Howes, L., Munshi, A.: The OpenCL specification (2015). http://www.khronos.org/registry/OpenCL/specs/opencl-2.0.pdf
Ishikawa, S.: Fixed points by a new iteration method. Proc. Am. Math. Soc. 44(1), 147–150 (1974). https://doi.org/10.1090/S0002-9939-1974-0336469-5
Kalantari, B.: Polynomial Root-Finding and Polynomiography. World Scientific, Singapore (2009). https://doi.org/10.1142/9789812811837
Khan, S., Cho, Y., Abbas, M.: Convergence to common fixed points by a modified iteration process. J. Appl. Math. Comput. 35(1), 607–616 (2011). https://doi.org/10.1007/s12190-010-0381-z
Mann, W.: Mean value methods in iteration. Proc. Am. Math. Soc. 4(3), 506–510 (1953). https://doi.org/10.1090/S0002-9939-1953-0054846-3
Petković, I., Rančić, L.: Computational geometry as a tool for studying root-finding methods. Filomat 33(4), 1019–1027 (2019). https://doi.org/10.2298/FIL1904019P
Picard, E.: Mémoire sur la théorie des équations aux dérivées partielles et la méthode des approximations successives. J. de Mathématiques Pures et Appliquées 6(4), 145–210 (1890)
Wall, M.: GAlib, a C++ library of genetic algorithm components (2008). http://lancet.mit.edu/ga/
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Gościniak, I., Gdawiec, K. (2022). On a New Generalised Iteration Method in the PSO-Based Newton-Like Method. In: Groen, D., de Mulatier, C., Paszynski, M., Krzhizhanovskaya, V.V., Dongarra, J.J., Sloot, P.M.A. (eds) Computational Science – ICCS 2022. ICCS 2022. Lecture Notes in Computer Science, vol 13350. Springer, Cham. https://doi.org/10.1007/978-3-031-08751-6_45
Download citation
DOI: https://doi.org/10.1007/978-3-031-08751-6_45
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-08750-9
Online ISBN: 978-3-031-08751-6
eBook Packages: Computer ScienceComputer Science (R0)