Results 1 to 10 of about 190,455 (220)
On Picard–Krasnoselskii Hybrid Iteration Process in Banach Spaces
Journal of Mathematics, 2020 In this research, we prove strong and weak convergence results for a class of mappings which is much more general than that of Suzuki nonexpansive mappings on Banach space through the Picard–Krasnoselskii hybrid iteration process.
Thabet Abdeljawad +2 more
doaj +4 more sources
Estimating the Local Radius of Convergence for Picard Iteration [PDF]
Algorithms, 2017 In this paper, we propose an algorithm to estimate the radius of convergence for the Picard iteration in the setting of a real Hilbert space. Numerical experiments show that the proposed algorithm provides convergence balls close to or even identical to the best ones.
Laura Maruster
exaly +6 more sources
Remarks on Picard-Lindelöf iteration [PDF]
BIT Numerical Mathematics, 1989 The paper discusses Picard-Lindelof iteration for systems of autonomous linear equations on finite intervals, as well as its numerical variants. Most of the discussion is under a model assumption which roughly says that the coupling terms are of moderate size compared with the slow time scales in the problem.
Olavi Nevanlinna
exaly +4 more sources
The Picard-HSS-SOR iteration method for absolute value equations
Journal of Inequalities and Applications, 2020 In this paper, we present the Picard-HSS-SOR iteration method for finding the solution of the absolute value equation (AVE), which is more efficient than the Picard-HSS iteration method for AVE.
Lin Zheng
exaly +2 more sources
Distributed Banach–Picard Iteration for Locally Contractive Maps
IEEE Transactions on Automatic Control, 2023 The Banach-Picard iteration is widely used to find fixed points of locally contractive (LC) maps. This paper extends the Banach-Picard iteration to distributed settings; specifically, we assume the map of which the fixed point is sought to be the average of individual (not necessarily LC) maps held by a set of agents linked by a communication network ...
Mário A T Figueiredo +2 more
exaly +5 more sources
Convergence analysis of Suzuki's generalized nonexpansive mappings using the Picard-Abbas iteration process. [PDF]
PLoS ONEThis manuscript investigates the convergence behavior of Suzuki's generalized nonexpansive mappings using the recently introduced Picard-Abbas iteration process.
Bashir Nawaz +4 more
doaj +2 more sources
Fractal and FractionalFractals are a common characteristic of many artificial and natural networks having topological patterns of a self-similar nature. For example, the Mandelbrot set has been investigated and extended in several ways since it was first introduced, whereas ...
Rekha Srivastava +2 more
exaly +3 more sources
Generation of Antifractals via Hybrid Picard-Mann Iteration [PDF]
IEEE Access, 2020 The aim of this paper is to generate antifractals using fixed point iterative algorithms, i.e., we aim to generate anti Julia sets, tricorns and multicorns for the anti-polynomial z → z̅k +c of the complex polynomial zk +c, for k ≥ 2.
Wei Wang +3 more
doaj +2 more sources
Stable Iteration Procedures in Metric Spaces which Generalize a Picard-Type Iteration [PDF]
Fixed Point Theory and Applications, 2010 This paper investigates the stability of iteration procedures defined by continuous functions acting on self-maps in continuous metric spaces. Some of the obtained results extend the contraction principle to the use of altering-distance functions and ...
De la Sen M
doaj +5 more sources
Introduction of new Picard–S hybrid iteration with application and some results for nonexpansive mappings [PDF]
Arab Journal of Mathematical Sciences, 2022 Purpose – In this paper, Picard–S hybrid iterative process is defined, which is a hybrid of Picard and S-iterative process. This new iteration converges faster than all of Picard, Krasnoselskii, Mann, Ishikawa, S-iteration, Picard–Mann hybrid, Picard ...
Julee Srivastava
doaj +1 more source