Results 1 to 10 of about 135 (102)
Estimating the Local Radius of Convergence for Picard Iteration [PDF]
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 +5 more sources
Fractals 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
On the numerical Picard iterations with collocations for the initial value problem
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
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.
Xue Zhiqun
doaj +2 more sources
A PICARD THEOREM FOR ITERATIVE DIFFERENTIAL EQUATIONS [PDF]
AbstractA Picard type existence and uniqueness theorem is established for iterative differential equations of the ...
Li, Wenrong, Cheng, Sui Sun
openaire +2 more sources
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 L. Andrade +2 more
openaire +6 more sources
A modification of the convergence conditions for Picard's iteration [PDF]
To solve by successive approximation nonlinear equations of the form F(x)=0, where F:Ω⊆X→X, is an operator defined on an open convex domain of a Banach space X with values in X, one uses a fixed point theorem based method which requires the operator G(x)=x−F(x) to be a contraction. This has a very limited scope of applicability.
Ezquerro, J. A., Hernández, M. A.
openaire +4 more sources
An alternative approach is proposed for constructing a strongly continuous semigroup based on the classical method of successive approximations, or Picard iterations, together with generating functions.
Marianito R. Rodrigo
doaj +1 more source
Iterative approximation of fixed points of contraction mappings in complex valued Banach spaces
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
Remarks of Equivalence among Picard, Mann, and Ishikawa Iterations in Normed Spaces
We show that the convergence of Picard iteration is equivalent to the convergence of Mann iteration schemes for various Zamfirescu operators. Our result extends of Soltuz (2005).
Xue Zhiqun
doaj +2 more sources

