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
Estimation of convergence rate for robust identification algorithms
β Scribed by O. Yu. Kul'Chitskiy; A. E. Mozgovoy
- Publisher
- John Wiley and Sons
- Year
- 1992
- Tongue
- English
- Weight
- 204 KB
- Volume
- 6
- Category
- Article
- ISSN
- 0890-6327
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
This paper considers the problem of dynamic errors-in-variables identification. Convergence properties of the previously proposed bias-eliminating algorithms are investigated. An error dynamic equation for the bias-eliminating parameter estimates is derived. It is shown that the convergence of the b
V -cycle, F -cycle and W -cycle multigrid algorithms for interior penalty methods for second order elliptic boundary value problems are studied in this paper. It is shown that these algorithms converge uniformly with respect to all grid levels if the number of smoothing steps is sufficiently large,