搜索结果: 1-10 共查到“数学 Iterations”相关记录10条 . 查询时间(0.062 秒)
Designing fast distributed iterations via semidefinite programming
Iteration markov chain the transition probability mixing ratio the monte carlo markov chain
2015/8/11
The general setting we consider involves a process, iteration, or method in which the computation or communication at each step is local, determined by a given graph, and involves some parameters or c...
A Pseudo Random Numbers Generator Based on Chaotic Iterations. Application to Watermarking
Internet Security Chaotic Sequences Statistical Tests
2010/12/28
In this paper, a new chaotic pseudo-random number gen-erator (PRNG) is proposed. It combines the well-known ISAAC and XORshift generators with chaotic iterations. This PRNG possesses im-
portant prop...
Improving random number generators by chaotic iterations. Application in data hiding
Chaotic sequences Topological chaos Pseudorandom random number generator
2010/12/28
In this paper, a new pseudo-random number generator (PRNG) based on chaotic iterations is proposed. This method also combines the digits of two XORshifts PRNGs.
Description of limits of ranges of iterations of stochastic integral mappings of infinitely divisible distributions
completely selfdecomposable distribution infinitely divisible dis-tribution
2011/1/17
For infinitely divisible distributions on Rd the stochastic integral map-ping f is defined as the distribution of improper stochastic integral R∞−0 f(s)dX() s ,where f(s) is a non-random f...
The Padé iterations for the matrix sign function and their reciprocals are optimal
The Padé iterations the matrix sign function reciprocals
2010/11/12
It is proved that among the rational iterations locally converging with order s>1 to the sign function, the Pad\'e iterations and their reciprocals are the unique rationals with the lowest sum of the ...
How Many Iterations are Sufficient for Semiparametric Estimation?
k-step Estimation Semiparametric Models Generalized Profile Likelihood Newton Raphson Algorithm
2010/12/3
A common practice in obtaining a semiparametric efficient esti-mate is through iteratively maximizing the (penalized) log-likelihood w.r.t.
New Perturbed Iterations for a Generalized Class of Strongly Nonlinear Operator Inclusion Problems in Banach Spaces
Generalized $m$-accretive mapping Generalized strongly nonlinear operator inclusion problems Perturbed iterative algorithm with errors Existence Convergence and stability
2008/6/30
The purpose of this paper is to introduce and study a new kind of generalized strongly nonlinear operator inclusion problems involving generalized m-accretive mapping in Banach spaces. By using the re...
We study the behavior of some polynomial interior-point algorithms for solving random linear programming (LP) problems. We show that the expected and anticipated number of iterations of these algorith...
A class of asynchronous matrix multi-splitting multi-parameter
relaxation methods, including the asynchronous matrix multisplitting
SAOR, SSOR and SGS methods as well as the known asynchronous matri...
Convergence of Inner Iterations Scheme of the Discrete Ordinate Method in Spherical Geometry
2007/12/12
In transport theory, the convergence of the inner iteration scheme to the spherical neutron transport equation has been an open problem. In this paper, the inner iteration for a positive step function...