Results 11 to 20 of about 3,335 (249)
Escape Criteria Using Hybrid Picard S-Iteration Leading to a Comparative Analysis of Fractal Mandelbrot Sets Generated with S-Iteration [PDF]
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
doaj +2 more sources
On the numerical Picard iterations with collocations for the initial value problem
Journal of Numerical Analysis and Approximation Theory, 2019 Some variants of the numerical Picard iterations method are presented to solve an IVP for an ordinary differential system. The term "numerical" emphasizes that a numerical solution is computed.
Ernest Scheiber
doaj +7 more sources
Fixed Point Theory and Applications, 2008 The purpose of this paper is to compare convergence speed of the Picard and Mann iterations on one hand, Krasnoselskij and Ishikawa iterations on the other hand, for the class of Zamfirescu operators. The results improve corresponding results of (Berinde
Zhiqun Xue
doaj +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 ...
Francisco Andrade +2 more
openaire +3 more sources
A PICARD THEOREM FOR ITERATIVE DIFFERENTIAL EQUATIONS [PDF]
Demonstratio Mathematica, 2009 AbstractA Picard type existence and uniqueness theorem is established for iterative differential equations of the ...
Li, Wenrong, Cheng, Sui Sun
openaire +2 more sources
Iterative approximation of fixed points of contraction mappings in complex valued Banach spaces
Arab Journal of Mathematical Sciences, 2019 We approximate the fixed points of contraction mappings using the Picard–Krasnoselskii hybrid iterative process, which is known to converge faster than all of Picard, Mann and Ishikawa iterations in complex valued Banach spaces.
Godwin Amechi Okeke
doaj +1 more source
An Investigation of an Integral Equation Involving Convex–Concave Nonlinearities
Mathematics, 2021 We investigate the existence and uniqueness of positive solutions to an integral equation involving convex or concave nonlinearities. A numerical algorithm based on Picard iterations is provided to obtain an approximation of the unique solution. The main
Ravi P. Agarwal +2 more
doaj +1 more source
ANALYSIS OF MODIFIED PASSIVE SAFETY SYSTEM IN FAST RECTORS TRANSIENTS [PDF]
EPJ Web of Conferences, 2021 The Autonomous Reactivity Control (ARC) system is a passive safety system aiming to provide an additional negative reactivity feedback during reactor transient scenarios.
Oggioni Carlo +2 more
doaj +1 more source
Remarks on Picard-Lindelöf iteration
BIT, 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.
Ulla Miekkala, Olavi Nevanlinna
+4 more sources
Some results on T-stability of Picard’s iteration [PDF]
SpringerPlus, 2016 We prove the existence and uniqueness of fixed points of T-stability for an iteration on partial cone metric space of Zamfirescu contraction. As an application, we prove a theorem for integral equation. We also give illustrative examples to verify our results.
Thokchom Chhatrajit, Yumnam Rohen
openaire +2 more sources