Rate of Convergence of the Linear Discrete Pólya 1-Algorithm
✍ Scribed by J.M. Quesada; J. Martinez-Moreno; J. Navas; J. Fernández-Ochoa
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 148 KB
- Volume
- 118
- Category
- Article
- ISSN
- 0021-9045
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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
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
## Abstract In the present paper, we introduce certain __q__‐Durrmeyer operators and estimate the rate of convergence for continuous functions in terms of modulus of continuity. The obtained estimate is sharp with respect to order. Copyright © 2008 John Wiley & Sons, Ltd.
We discuss the performance optimization of the Semi-Implicit Method for Pressure-Linked Equations-Revised (SIMPLER) Picard algorithm for steady incompressible internal ows. We discuss the nonlinear convergence of the Picard iteration as a function of the pressure and scalar potential continuity proj