Results 231 to 240 of about 57,211 (263)
Some of the next articles are maybe not open access.

Iterative and fixed point common belief

Journal of Philosophical Logic, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Sequential iteration of the Erlang fixed-point equations

Information Processing Letters, 2002
The link or route blocking probabilities of a loss network are typically used to assess its performance. Unfortunately, closed form expressions for these, whilst being easy to write down, are quite intractable to evaluate computationally. Consequently, a number of approximations to the blocking probabilities have been proposed.
Andrew G. Hart, Servet Martínez 0001
openaire   +1 more source

Fixed Point Iterations and Global Stability in Economics

Mathematics of Operations Research, 1985
Stability is studied from the point of view of ordinary Picard iteration in a metric space. The Convergence Theorem proved here states that a sequence of Picard iterates converges if the mapping in question is a proper convex combination of a contraction (nonexpansive mapping) and the identity.
openaire   +1 more source

Fixed point theorems for mappings with lipschitzian iterates

Nonlinear Analysis: Theory, Methods & Applications, 1992
The authors show new fixed point theorems for mappings with Lipschitzian iterates. Let \(C\) be a nonempty subset of a Banach space \(E\). A mapping \(T: C\to C\) is said to be uniformly Lipschitzian if \[ \| T^ n x- T^ n y\|\leq K\| x-y\|, \quad x,y\in C, \quad n=1,2,\ldots\;. \] holds for some \(K>0\).
Górnicki, Jarosław, Krüppel, Manfred
openaire   +1 more source

Iteration Near a Fixed Point

Journal of Applied Probability, 1975
An exposition is given of the properties of the iterates of complex functions near a fixed point, with explicit expressions for their power series in certain cases. The relevance to problems in genetics and statistics is pointed out.
openaire   +1 more source

On Convergence of Iterations for Fixed Points of Repulsive Type

Canadian Mathematical Bulletin, 1971
This paper deals with the convergence of iterations of the equation1.1with u0 ∊ Rn, both as a root and a point of repulsion. Here u and ϕ are real n-vectors and ϕ is continuously differentiate with respect to u. By taking u0 as an initial approximation to u0 in a neighbourhood of u0 we define the sequence of iterates {uk+1} by1.1For the sake of ...
Koneru, R. S., Lalli, B. S.
openaire   +1 more source

Fixed Point Iteration

1992
Iteration seems to play a fundamental role in learning theory - as everywhere else. Since neurons need a rather long time to reach a stable state, Caianiello's Paradox suggests that special actions cause the iteration of state transitions until a stable neural state is reached. Now, a stable state is a fixed point for any transition function; so we may
G. Germano, MAZZANTI, STEFANO
openaire   +1 more source

Parallel asynchronous iterations of least fixed points

Parallel Computing, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Anderson accelerated fixed‐point iteration for multilinear PageRank

Numerical Linear Algebra With Applications, 2023
Yannan Chen
exaly  

Home - About - Disclaimer - Privacy