Results 221 to 230 of about 57,211 (263)

Ground User Clustering for Adaptive Multibeam GEO Satellite Networks. [PDF]

Sensors (Basel)
Shehata H, Inaltekin H, Collings IB.
europepmc   +1 more source

A well-defined local continuum damage model with softening via convexification and entropic regularization

Lauff C, Schlichting A, Böhlke T, Schneider M.   +3 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Convergence of the fixed‐point iteration for multilinear PageRank

Numerical Linear Algebra With Applications, 2021
AbstractFixed‐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
exaly   +3 more sources

Finiteness conditions for fixed point iteration

ACM SIGPLAN Lisp Pointers, 1992
This 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, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jafar Biazar, Alireza Amirteimoori
openaire   +2 more sources

Jackknifing fixed points of iterations

Biometrika, 1987
The 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, 1996
The 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   +1 more source

Fixed Point Iteration in Availability Modeling

1991
This 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   +1 more source

Iterative construction of fixed points

Numerical Functional Analysis and Optimization, 1996
Abstract, 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