Results 261 to 270 of about 5,846,948 (298)
Some of the next articles are maybe not open access.
Convergence of the Fixed-Point Iteration for Multilinear PageRank
Numerical Linear Algebra With Applications, 2021AbstractFixed‐point iteration is a popular method for the multilinear PageRank problem. In [B. Meini, F. Poloni, Perron‐based algorithms for the multilinear PageRank, Numer. Linear Algebra Appl., 25: e2177, 2018], a theorem was proved to determine the behavior of the fixed‐point iteration as the parameter .
Gang Wu, Gang Wu
exaly +3 more sources
Finiteness conditions for fixed point iteration
ACM SIGPLAN Lisp Pointers, 1992This paper provides a link between the formulation of static program analyses using the framework of abstract interpretation (popular for functional languages and using the more classical framework of data flow anlysis (popular for imperative languages). In particular we show how the classical notions of fastness, rapidity and
Flemming Nielson, Hanne Riis Nielson
openaire +1 more source
An improvement to the fixed point iterative method
Applied Mathematics and Computation, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jafar Biazar, Alireza Amirteimoori
openaire +3 more sources
Jackknifing fixed points of iterations
Biometrika, 1987The jackknife method for estimating the dispersion of a statistic T, considered as an estimator of a p-dimensional vector of parameters, can be modified so as to become computationally feasible for the class of statistics that are obtained as limits of iterative processes. Examples are given to show how the method can be applied to the EM algorithm and
openaire +2 more sources
Random Relaxation of Fixed-Point Iteration
SIAM Journal on Scientific Computing, 1996The author considers a stochastic fixed-point iteration where each coordinate is updated with a certain probability and otherwise left unchanged. The iteration is interesting from the viewpoint of parallel distributed computation because the realized sequences belong to the class of asynchronous fixed-point iterations.
openaire +2 more sources
Iterative and fixed point common belief
Journal of Philosophical Logic, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Fixed Point Iteration in Availability Modeling
1991This paper presents a fixed point iteration technique for modeling system availability of large fault tolerant systems. The systems modeled are composed of several subsystems having redundant components. Real systems have a large number of subsystems and very general types of interaction between components within a subsystem and between subsystems ...
Lorrie A. Tomek, Kishor S. Trivedi
openaire +2 more sources
Iterative construction of fixed points
Numerical Functional Analysis and Optimization, 1996Abstract, It is proved that an Ishikawa—type iteration scheme converges to the fixed point of a generalized contraction map in a convex metric space. The class of generalized contraction maps includes all quasi—contraction maps.
S.N. Mishra, A.K. Kalinde
openaire +1 more source
Fixed Point Iterations and Global Stability in Economics
Mathematics of Operations Research, 1985Stability 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 +2 more sources
Sequential iteration of the Erlang fixed-point equations
Information Processing Letters, 2002The 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