首页 | 本学科首页   官方微博 | 高级检索  
     检索      


On the rate of convergence of the Robbins–Monro's algorithm in a linear stochastic ill-posed problem with α-mixing data
Authors:Nabila Aiane  Abdelnasser Dahmani
Institution:1. Laboratoire de Mathématiques Appliquées, Faculté des Sciences Exactes, Université de Bejaia, Bejaia, Algérie;2. Laboratoire de Mathématiques Appliquées, Centre universitaire de Tamanrasset, Tamanrasset, Algérie
Abstract:In this paper we consider a recursive method of Robbins–Monro type to estimate the solution of the linear problem Ax = u, in which the second member is measured with α-mixing errors. We also show the almost complete convergence (a.co) of this algorithm specifying its convergence rate.
Keywords:Ill-posed problems  stochastic approximation  α-mixing  
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号