𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Rate of Convergence of the Linear Discrete Polya Algorithm

✍ Scribed by J.M Quesada; J Navas

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
122 KB
Volume
110
Category
Article
ISSN
0021-9045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Rate of Convergence of the Discrete PΓ³ly
Rate of Convergence of the Discrete PΓ³lya-1 Algorithm
✍ A.G. Egger; G.D. Taylor πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 389 KB

The rate of convergence of the discrete Polya-1 algorithm is studied. Examples are given to show that the rates derived are sharp. (c) 1993 Academic Press, Inc

Techniques for bounding the convergence
Techniques for bounding the convergence rate of genetic algorithms
✍ Yuri Rabinovich; Avi Wigderson πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 308 KB πŸ‘ 2 views

The main purpose of the present paper is the study of computational aspects, ## Ε½ . and primarily the convergence rate, of genetic algorithms GAs . Despite the fact that such algorithms are widely used in practice, little is known so far about their theoretical properties, and in particular about

Effects of Asynchronism on the Convergen
Effects of Asynchronism on the Convergence Rate of Iterative Algorithms
✍ Aydin Üresin; Michel Dubois πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 392 KB

In multiprocessor systems, iterative algorithms can be implemented synchronously or asynchronously. Unfortunately, few guidelines exist to make a choice. In this paper, we compare the execution times of an asynchronous iterative algorithm and of its synchronous counterpart. Synchronization overhead

Robustness and convergence rate of a dis
Robustness and convergence rate of a discrete-time learning control algorithm for a class of nonlinear systems
✍ Samer S. Saab πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 127 KB πŸ‘ 2 views

In this paper, we apply a discrete-time learning algorithm to a class of discrete-time varying nonlinear systems with a$ne input action and linear output having relative degree one. We investigate the robustness of the algorithm to state disturbance, measurement noise and reinitialization errors. We