Year: 1994
Author: Yun-Min Zhu, Gang Yin
Journal of Computational Mathematics, Vol. 12 (1994), Iss. 1 : pp. 21–30
Abstract
A new approach for stochastic approximation in real time is developed. A number of processors are simultaneously active to carry out a computing task. All processors work on the same system with different starting time. After each iteration, computed date are passed to the next processor on line. Interacting tasks and iterative instructions are carried through pipelining of computation and communication. Asymptotic properties of the algorithm are developed, and comparisons of the performance between the new algorithm and the classical one are made.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/1994-JCM-10222
Journal of Computational Mathematics, Vol. 12 (1994), Iss. 1 : pp. 21–30
Published online: 1994-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 10